#pbctf_2021 #rbtree #!/usr/bin/env python3 from Crypto.Util.number import * import random def genPrime(): while True: a = random.getrandbits(256) b = random.getrandbits(256) if b % 3 == 0: continue p = a ** 2 + 3 * b ** 2 if p.bit_length()…

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