#circle_city_con_2021 from gmpy2 import next_prime, is_prime import random, os, sys if __name__ == "__main__": random.seed(os.urandom(32)) p = next_prime(random.randrange((1<<1024), (1<<1024) + (1<<600))) pp = (p * 7) // 11 q = next_prime(…

#xornet #seccon2021 from Crypto.Util.number import bytes_to_long, getPrime, getRandomInteger, isPrime from secret import flag def create_prime(p_bit_len, add_bit_len, a): p = getPrime(p_bit_len) p_bit_len2 = 2*p_bit_len // 3 + add_bit_len …

https://ctftime.org/task/7777 #pragyanctf #RabinCryptosystem #フェルマー法 Rabin has received a text from someone special, but it's all in ciphertext and he is unable to make head or tail of it. He requested her for a little hint, and she …

#secconbeginners2021 from Crypto.Util.number import * from random import getrandbits from os import urandom # from flag import flag def gen_primes(bits, e): q = getStrongPrime(bits) p = q while True: p = p-8 # p-8 phi = (p - 1) * (q - 1) i…