confidence_ctf_2019_teaser|really_suspicious_acronym
circle_city_con_2021
suspicious_prime
rsa
confidence_ctf_2019_teaser|really_suspicious_acronym
midnightsun_ctf_2021__quals_|_ocat_024
フェルマー法
#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(…
midnightsunctf2021quals
confidence_ctf_2019_teaser|really_suspicious_acronym
suspicious_prime
multivariate_coppersmith
pbctf2020_|_special_gift
rsaで一部の値がわかっている時
#midnightsunctf2021quals u = getrandbits(512) p = next_prime(1337 * u + getrandbits(300)) q = next_prime(2021 * u + getrandbits(300)) n = p * q sage: n 376347864369130929314918003073529176189619811132906053032580291332225522349124770927556…
