Module: `rsa`

A module for factoring large random RSA integers.

This module uses Ekerå–Håstad's algorithm to factor RSA integers, as described in [EH17], with improvements from [E20] and [E23p].

Import directive

import quaspy.factoring.rsa

postprocessing

A module for splitting N = pq into the large l-bit prime factors p and q given d = (p - 1) / 2 + (q - 1) / 2 - 2^(l - 1).

setup_d_given_p_q(p, q)

Sets up d = (p - 1) / 2 + (q - 1) / 2 - 2^(l - 1) given p and q.
setup_x_given_g_N(g, N)

Sets up x = g^d' for d' = (N - 1) / 2 - 2^(l - 1) given g and N, for N the product of two large random distinct l-bit primes.