sage_の素因数分解アルゴリズムにヒントを与える
#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…
