Nothing up my sleeve number

In cryptography, nothing up my sleeve numbers are any numbers which, by their construction, are above suspicion of hidden properties. They are used in creating cryptographic functions such as hashes and ciphers. These algorithms often need randomized constants for mixing or initialization purposes. The cryptographer may wish to pick these values in a way that demonstrates the constants were not selected for (in Bruce Schneier's words) a "nefarious purpose", for example, to create a "backdoor" to the algorithm.^[1] These fears can be allayed by using numbers created in a way that leaves little room for adjustment. An example would be the use of initial digits from the number π as the constants.^[2] Using digits of π millions of places into its definition would not be considered as trustworthy because the algorithm designer might have selected that starting point because it created a secret weakness the designer could later exploit.

Digits in the positional representation of real numbers such as π, e and irrational roots are believed to appear random. See normal number. Such numbers can be viewed as the opposite extreme of Chaitin–Kolmogorov random numbers in that they appear random but have very low information entropy. Their use is motivated by early controversy over the U.S. Government's 1975 Data Encryption Standard, which came under criticism because no explanation was supplied for the constants used in its S-box (though they were later found to have good justification, see Differential cryptanalysis).^[3]p.278 Thus a need was felt for a more transparent way to generate constants used in cryptography.

"Nothing up my sleeve" is a phrase associated with magicians, who sometimes preface a magic trick by holding open their sleeves to show they have no objects hidden inside.^[4]

Examples

• The cipher Khafre, designed in 1989, includes constants from the book A Million Random Digits with 100,000 Normal Deviates, published by the RAND Corporation in 1951.
• Ron Rivest used the trigonometric sine function to generate constants for the widely-used MD5 hash.^[5]
• The U.S. National Security Agency used the square roots of small integers to produce the constants used in its "Secure Hash Algorithm" SHA-1. The SHA-2 functions use the square roots and cube roots of small primes.^[6]
• The Blowfish encryption algorithm uses the binary representation of π to initialize its key schedule.^[2]
• RFC 3526 describes prime numbers for internet key exchange that are also generated from π.
• The S-box of the NewDES cipher is derived from the United States Declaration of Independence.^[7]
• The AES candidate DFC derives all of its arbitrary constants, including all entries of the S-box, from the binary expansion of e.^[8]
• The ARIA key schedule uses the binary expansion of 1/π.^[9]
• The key schedule of the RC5 cipher uses binary digits from both e and the golden ratio.^[10]
• Dual EC DRBG, a NIST-recommended cryptographic random bit generator, came under criticism in 2007 because constants recommended for use in the algorithm could have been selected in a way that would permit their author to predict future outputs given a sample of past generated values.^[1]

Footnotes

1. ^ ^{a b} Bruce Schneier (2007-11-15). "Did NSA Put a Secret Backdoor in New Encryption Standard?". Wired News. http://www.wired.com/politics/security/commentary/securitymatters/2007/11/securitymatters_1115. 
2. ^ ^{a b} http://www.schneier.com/paper-blowfish-fse.html
3. ^ Bruce Schneier. Applied Cryptography, second edition, John Wiley and Sons, 1996.
4. ^ http://tvtropes.org/pmwiki/pmwiki.php/Main/NothingUpMySleeve TV Tropes entry for "nothing up my sleeve"
5. ^ RFC 1321 Sec. 3.4
6. ^ FIPS 180-2: Secure Hash Standard (SHS) (PDF, 236 kB) – Current version of the Secure Hash Standard (SHA-1, SHA-224, SHA-256, SHA-384, and SHA-512), 1 August 2002, amended 25 February 2004
7. ^ Revision of NEWDES, Robert Scott, 1996
8. ^ Henri Gilbert, M. Girault, P. Hoogvorst, F. Noilhan, T. Pornin, G. Poupard, J. Stern, S. Vaudenay (May 19, 1998) (PDF/PostScript). Decorrelated Fast Cipher: an AES candidate. http://citeseer.ist.psu.edu/gilbert98decorrelated.html. 
9. ^ A. Biryukov, C. De Cannière, J. Lano, B. Preneel, S. B. Örs (January 7, 2004) (PostScript). Security and Performance Analysis of ARIA. Version 1.2—Final Report. Katholieke Universiteit Leuven. http://www.cosic.esat.kuleuven.be/publications/article-500.ps. 
10. ^ Rivest, R. L. (1994). "The RC5 Encryption Algorithm" (pdf). Proceedings of the Second International Workshop on Fast Software Encryption (FSE) 1994e. pp. 86–96. http://theory.lcs.mit.edu/~rivest/Rivest-rc5rev.pdf. 

References

• Bruce Schneier. Applied Cryptography, second edition. John Wiley and Sons, 1996.
• Eli Biham, Adi Shamir, (1990). Differential Cryptanalysis of DES-like Cryptosystems. Advances in Cryptology — CRYPTO '90. Springer-Verlag. 2–21.