Bibliography - A Classical Introduction to Cryptography: Applications for Communications Security - page 315

[84] S. Haber, W.S. Stornetta. How to Time-Stamp a Digital Document. Journal of Cryptology ,
vol. 3, pp. 99-111, 1991.

[85] N. Haller. The S/KEY One-Time Password System. RFC 1760, 1995.

[86] N. Haller, C. Metz, P. Nesser, M. Straw. A One-Time Password System. Internet Standard.
RFC 2289, The Internet Society, 1998.

[87] J. Hastad. Solving Simultaneous Modular Equations of Low Degree. SIAM Journal on
Computing , vol. 17, pp. 376-404, 1988.

[88] M.E. Hellman. A Cryptanalysis Time-Memory Trade-Off. IEEE Transactions on Infor-
mation Theory , vol. IT-26, pp. 401-406, 1980.

[89] M.E. Hellman, R. Merkle, R. Schroeppel, L. Washington, W. Diffie, S. Pohlig,
P. Schweitzer. Results of an Initial Attempt to Cryptanalyze the NBS Data Encryption
Standard . Stanford University, September 1976.

[90] H.M. Heys. A Tutorial on Linear and Differential Cryptanalysis. Technical Report
CORR 2001-17, Centre for Applied Cryptographic Research, Department of Combi-
natorics and Optimization, University of Waterloo, 2001. (Also appears in Cryptologia ,
vol. 26, pp. 189-221, 2002.)

[91] F.H. Hinsley, A. Stripp. Code Breakers . Oxford University Press, NY, 1993.

[92] J.E. Hopcroft, J.D. Ullman. Introduction to Automata Theory, Languages, and Computa-
tion . Addison Wesley, London, 1979.

[93] R. Housley, W. Ford, W. Polk, D. Solo. Internet X.509 Public Key Infrastructure Certificate
and CRL Profile. Internet Standard. RFC 2459, The Internet Society, 1999.

[94] T. Iwata, K. Kurosawa. OMAC: One-Key CBC MAC. In Fast Software Encryption'03 ,
Lund, Sweden, Lecture Notes in Computer Science 2887. Springer-Verlag, NY, 2003,
pp. 137-161.

[95] T. Jakobsen, L.R. Knudsen. The Interpolation Attack on Block Ciphers. In Fast Software
Encryption'97 , Haifa, Israel, Lecture Notes in Computer Science 1267. Springer-Verlag,
NY, 1997, pp. 28-40.

[96] P. Junod, S. Vaudenay. FOX Specifications Version 1.1. Technical Report

EPFL/IC/2004/75, EPFL, 2004.

[97] P. Junod, S. Vaudenay. FOX: A New Family of Block Ciphers. In Selected Areas in Cryp-
tography'04 , Watterloo, ON, Canada, Lecture Notes in Computer Science 3357. Springer-
Verlag, NY, 2005, pp. 114-129.

[98] D. Kahn. The Codebreakers . Scriber, 1996.

[99] R.M. Karp. Reducibility among Combinatorial Problems. In Complexity of Computer
Computations , Plenum Press, New York, 1972. pp. 85-103.