The Laws of Cryptography:
Cryptographer's Favorites

by Neal R. Wagner

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

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

Law XOR1: The cryptographer's favorite function is Exclusive-Or.

Law LOG2: The cryptographer's favorite logarithm is log base 2.

Law LOG2: The log base 2 of an integer x tells how many bits it takes to represent x in binary.

Law GROUP1: The cryptographer's favorite group is the integers mod n, Zn.

Law FIELD1: The cryptographer's favorite field is the integers mod p, denoted Zp, where p is a prime number.

Law FIELD2: The cryptographer's other favorite field is GF(2n).

Law FERMAT1: The cryptographer's favorite theorem is Fermat's Theorem..


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