pwnbox.number¶
Number theory algorithms.
-
pwnbox.number.cf(*args, **kwargs)¶ Rational number
n // mto continued fraction.Parameters: - n – numerator.
- m – denominator.
-
pwnbox.number.cf_convergents(*args, **kwargs)¶ Continued fraction to convergents
Parameters: cf – continued fraction.
-
pwnbox.number.crt(*args, **kwargs)¶ Chinese Remainder Theorem.
Parameters: - remainders – list of remainders.
- moduli – list of modulies.
- coprime – (optional) set
Falseif modulies are not coprimes.
-
pwnbox.number.fermat_factoring(*args, **kwargs)¶ Perform Fermat’s factorization.
Parameters: - N – number to factorize.
- trial – (optional) maximum trial number.
-
pwnbox.number.pollard_rho(*args, **kwargs)¶ Pollard’s rho method for small prime factor.
Parameters: N – number to factorize.
-
pwnbox.number.wiener_attack(*args, **kwargs)¶ Perform Wiener’s attack.
Parameters: - N – RSA public key N.
- e – RSA public key e.