M. Abadi, personal communication.
[BDRSSTW96] M. Blaze, W. Diffie, R. Rivest, B. Schneier, T. Shimomura, E. Thompson, and M. Wiener, “Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security,” January 1996.
H. Dobbertin, A. Bosselaers, and B. Preneel, “RIPEMD-160: A Strengthened Version of RIPEMD,” Fast Software Encryption: Third International Workshop, Cambrdige, UK, February 1996 Proceedings, Springer-Verlag, 1996, pp. 71–82.
M.E. Hellman, “A Cryptanalytic Time-Memory Trade Off,” IEEE Transactions on Information Theory, v. 26, n. 4, Jul 1980, pp. 401–406.Google Scholar
D. Knuth, The Art of Computer Programming: Volume 2, Seminumerical Algorithms, Addison-Wesley, 1981.
U. Manber, “A Simple Scheme to Make Passwords Based on One-Way Functions Much Harder to Crack,” Computers & Security
, v. 15, n. 2, 1996, pp. 171–176.Google Scholar
R.H. Morris and K. Thompson, “UNIX Password Security,” Communications of the ACM, v. 22, n. 11, Nov 1979.
National Bureau of Standards, NBS FIPS PUB 46, “Data Encryption Standard,” National Bureau of Standards, U.S. Department of Commerce, Jan 1977.
National Institute of Standards and Technology, NIST FIPS PUB 180, “Secure Hash Standard,” U.S. Department of Commerce, May 93.
J.-J. Quisquater, Y. Desmedt, and M. Davio, “The Importance of ‘Good’ Key Schemes (How to Make a Secure DES with ≤ 48 Bit Keys?),” Advances in Cryptology—CRYPTO '85 Proceedings, Springer-Verlag, 1986, pp. 537–542.
B. Schneier, Applied Cryptography, Second Edition, John Wiley & Sons, 1996.
Peter Trei, personal communication, 1997.
M. Wiener, “Efficient DES Key Search,” TR-244, School of Computer Science, Carleton Unversity, May 1994.