RSA flag = open('flag', 'rb').read() pt = int.from_bytes(flag, 'big') def case1(x): N = 0x9cca93a0eff966a6cc3426dc79f66c0526944c5a51681a3be685daee7506352dfb7bdd76e59995d2ba980158212f4797c3fc1ae81fdd3500e93634e7e5a47944d14b2de0922d0fcbe2ada…

gcd(phi, e) != 1のRSAで とかの場合にこれで解けるかも ちなみにこんなことをしなくてもsageにはnth_rootが実装されていてそれで良いかも Elements of \(\ZZ/n\ZZ\) — Sage 9.3 Reference Manual: Finite Rings import random def eth_root(x, e, p): """ A…

#*CTF_2021 from Crypto.Util.number import * from libnum import * from secret import flag,special,p,q,n def little_trick(msg): p1 = getPrime(1024) q1 = getPrime(1024) n1 = p1 * q1 d1=random.randint(1,2**256) e1=inverse(d1,(p1-1)*(q1-1)) pri…

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