Shor's algorithm: only the classical part of it, implemented in a very naive and linear way. Use the quantum period finding function: f(x) =

Search for partial q. Tunable to search longer. Source: https://0day.work/0ctf-2016-quals-writeups/ Based on: RSA? Challenge in

Integer factorization using z3 theorem prover implementation: We can factor composite integers by SAT solving the model N=PQ directly using th

Main class managing the attacks

Create RSA key from input content :param key: public key file content :type key: string

Create private key from base components :param p: extracted from n :param q: extracted from n :param e: exponent :para

Configuration

Print armored public key

Print armored private key

Factorial