RSACrack

rsacrack.egcd(a: int, b: int) → Tuple[int, int, int]

Calculates the Euclidean GCD of a and b

rsacrack.genprimes(n) → List

A copy of the prime generator found in fastgen.py

rsacrack.genprimes_file(f)

Generates primes from a given file that contains a list

rsacrack.genprimes_generic()

Generates probable primes using 6*i +- 1

rsacrack.modinv(a: int, m: int) → int

Calculates the modular inverse of a and m

rsacrack

Main group

rsacrack [OPTIONS] COMMAND [ARGS]...

fcrack

Finds the private key of the public key in OUTF, optionally using PRIMELIST as a list of primes

rsacrack fcrack [OPTIONS] I

Options

-o, --outf <outf>

-p, --primelist <primelist>

Arguments

I

Required argument