#imaginaryctf2021 #!/usr/bin/env python3 from itertools import islice from math import gcd from random import randint ELEMENT_LEN = 16 def primes(): num = 2 while True: prime = 1 for i in range(2, num): if num%i == 0: prime = 0 if prime: y…

#imaginaryctf2021 n = 1871866865483941810106035041489767872458177408174210228790876521269086223189954740558299715702009349950617763239543057254260001925842494780359139592647224634741398653143717780175432460620024371083660969445388889466865…

#imaginaryctf2021 from itertools import cycle, islice from gmpy2 import popcount def x(a,b): return bytes(islice((x^y for x,y in zip(cycle(a), cycle(b))), max(*map(len, [a, b])))) def t(x): return sum((((x & 28) >> 4) & 1) << i for i, x in…

#imaginaryctf2021 from Crypto.Util.number import bytes_to_long import random flag = bytes_to_long(open("flag.txt", "rb").read()) msg = bytes_to_long(b":roocursion:") p = 828208757675404802784998591016022506443991176995496942317967203886469…

#imaginaryctf2021