Glossary

modulon ; mod n

An integer x modulo another positive integer n is the remainder of the Euclidean division of x by n: x = qn + r with q integer and remainder 0 ≤ r < n, and we note x = r mod n, or $x=r$ mod n.

RSA (Rivest, Shamir, Adleman)

Initials of the authors, by extension, public key cryptosystem published in 1977 by these authors.

DH (Diffie, Hellman)

Authors' initials, by extension, asymmetric cryptosystem published in 1976 by these authors.

CADO-NFS (Algebraic Screening: Distribution, Optimization)

Open-source software for factoring and calculating discrete logarithms using the...