#IrisCTF2024 from Crypto.Util.number import getPrime, isPrime e = 65537 N = 1 while (N - 1) % e == 0: N = getPrime(2048) def xor(a, b): return bytes(x^y for x,y in zip(a,b)) class MySeededHash(): def __init__(self, N, e): self.N = N self.e…

#diceCTF2022 from Crypto.Util.number import getPrime, bytes_to_long, long_to_bytes def getAnnoyingPrime(nbits, e): while True: p = getPrime(nbits) if (p-1) % e**2 == 0: return p nbits = 128 e = 17 p = getAnnoyingPrime(nbits, e) q = getAnno…

#srdnlen_CTF_2022 e: 18959 p: 8853107629856302430942645802685600792214004993921099904332911487775152756152460899671437787731654521568200225685173143721860070387195312109191089843558621 q: 122637763991345814139940390432201063534644731251148…

#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…

#SECCON_CTF_2022_Quals #kurenaif from Crypto.Util.number import * from Crypto.Random import * from flag import flag p = getPrime(512) q = getPrime(512) r = getPrime(512) n = p * q * r e = 2 * 65537 assert n.bit_length() // 8 - len(flag) > …