
48 Cryptography with Open-Source Software
Discrete log arithm problem. The problem (in ge neral with no easy solu-
tion) of solving a discrete logarithm equation.
Euclidean algorithm. An efficient algorithm for finding the greatest com-
mon divisor of two numbers.
Factorization. The pr oblem (in general with no easy solution) of deco mpo s-
ing a number into its prime factors.
Non-determinis tic primality test. A primality test, such as the Miller–
Rabin test, that does not prove a number to be prime, but produces a
very high probability of its primality.
Prime number. An integer with no factors other than itself and 1.
Primality testing. Determining whether ...