The Laws of Cryptography:
Cryptographers' Favorite Algorithms

by Neal R. Wagner

Copyright © 2002 by Neal R. Wagner. All rights reserved.

NOTE: This site is obsolete. See book draft (in PDF):

Law GCD1: The cryptographer's first and oldest favorite algorithm is the extended Euclidean algorithm, which computes the greatest common divisor of two positive integers a and b and also supplies integers x and y such that

Law EXP1: Many cryptosystems in modern cryptography depend on a fast algorithm to perform integer exponentiation.

Law PRIME1: A source of large random prime integers is an essential part of many current cryptosystems.

Law PRIME2: Just one simple pseudo-prime test is enough to test that a very large random integer is probably prime.


Revision date: 2002-02-12. (Please use ISO 8601, the International Standard.)