RSA multi attacks tool : uncipher data from weak public key and try to recover private key Automatic selection of best attack for the given public key

Attacks :

• Weak public key factorization
• Wiener's attack
• Hastad's attack (Small public exponent attack)
• Small q (q < 100,000)
• Common factor between ciphertext and modulus attack
• Fermat's factorisation for close p and q
• Gimmicky Primes method
• Past CTF Primes method
• Self-Initializing Quadratic Sieve (SIQS) using Yafu (https://github.com/DarkenCode/yafu.git)
• Common factor attacks across multiple keys
• Small fractions method when p/q is close to a small fraction
• Boneh Durfee Method when the private exponent d is too small compared to the modulus (i.e d < n^0.292)
• Elliptic Curve Method
• Pollards p-1 for relatively smooth numbers
• Mersenne primes factorization
• Factordb
• Londahl
• Noveltyprimes
• Partial q
• Primefac
• Qicheng
• Same n, huge e
• binary polynomial factoring
• Euler method
• Pollard Rho
• Wolfram alpha
• cm-factor
• z3 theorem prover
• Primorial pm1 gcd
• Mersenne pm1 gcd
• Fermat Numbers gcd
• Fibonacci gcd

usage: RsaCtfTool.py [-h] [--publickey PUBLICKEY] [--timeout TIMEOUT]
                     [--createpub] [--dumpkey] [--ext] [--sendtofdb]
                     [--uncipherfile UNCIPHERFILE] [--uncipher UNCIPHER]
                     [--verbosity {CRITICAL,ERROR,WARNING,DEBUG,INFO}]
                     [--private] [--ecmdigits ECMDIGITS] [-n N] [-p P] [-q Q]
                     [-e E] [--key KEY] [--isconspicuous]
                     [--attack {binary_polinomial_factoring,boneh_durfee,comfact_cn,cube_root,ecm,ecm2,euler,factordb,fermat,londahl,mersenne_primes,noveltyprimes,partial_q,pastctfprimes,pollard_p_1,pollard_rho,qicheng,roca,siqs,smallfraction,smallq,wiener,wolframalpha,cm_factor,z3_solver,primorial_pm1_gcd,mersenne_pm1_gcd,fermat_numbers_gcd,fibonacci_gcd,commonfactors,hastads,same_n_huge_e,all]

Mode 1 : Attack RSA (specify --publickey or n and e)

• publickey : public rsa key to crack. You can import multiple public keys with wildcards.
• uncipher : cipher message to decrypt
• private : display private rsa key if recovered

Mode 2 : Create a Public Key File Given n and e (specify --createpub)

• n : modulus
• e : public exponent

Mode 3 : Dump the public and/or private numbers (optionally including CRT parameters in extended mode) from a PEM/DER format public or private key (specify --dumpkey)

• key : the public or private key in PEM or DER format

./RsaCtfTool.py --publickey ./key.pub --uncipherfile ./ciphered\_file

./RsaCtfTool.py --publickey ./key.pub --private

./RsaCtfTool.py --publickey "*.pub" --private

./RsaCtfTool.py --publickey "*.pub" --private --sendtofdb

./RsaCtfTool.py --createpub -n 7828374823761928712873129873981723...12837182 -e 65537

./RsaCtfTool.py --dumpkey --key ./key.pub

./RsaCtfTool.py --key examples/conspicuous.priv --isconspicuous

./RsaCtfTool.py --publickey key.pub --ecmdigits 25 --verbose --private

For more examples, look at test.sh file

• GMPY2
• SymPy
• PyCrypto
• Requests
• Libnum
• SageMath : optional but advisable
• Sage binaries

git clone https://github.com/Ganapati/RsaCtfTool.git
sudo apt-get install libgmp3-dev libmpc-dev
pip3 install -r "requirements.txt"
python3 RsaCtfTool.py

If pip3 install -r "requirements.txt" fails to install requirements accessible within environment, the following command may work.

easy_install `cat requirements.txt`

• Brainstorm moar attack types !