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

[130] R.C. Merkle. One Way Hash Functions and DES. In Advances in Cryptology CRYPTO'89 ,
Santa Barbara, CA, Lecture Notes in Computer Science 435. Springer-Verlag, NY, 1990,
pp. 416-427.
[131] R.C. Merkle. A Certified Digital Signature. In Advances in Cryptology CRYPTO'89 ,
Santa Barbara, CA, Lecture Notes in Computer Science 435. Springer-Verlag, NY, 1990,
218-238.
[132] R.C. Merkle, M. Hellman. Hiding Information and Signatures in Trapdoor Knapsacks.
IEEE Transactions on Information Theory , vol. IT-24, pp. 525-530, 1978.
[133] R.C. Merkle, M. Hellman. On the Security of Multiple Encryption. Communications of
the ACM , vol. 24, pp. 465-467, 1981.
[134] G. Miller. Riemann's Hypothesis and Tests for Primality. Journal of Computer and System
Sciences , vol. 13, pp. 300-317, 1976.
[135] J. Monnerat, S. Vaudenay. Undeniable Signatures Based on Characters: How to Sign with
One Bit. In Public Key Cryptography'04 , Singapore, Lecture Notes in Computer Science
2947. Springer-Verlag, NY, 2004, pp. 69-85.
[136] J. Monnerat, S. Vaudenay. Generic Homomorphic Undeniable Signatures. In Advances in
Cryptology ASIACRYPT'04 , Jeju Island, Korea, Lecture Notes in Computer Science 3329.
Springer-Verlag, NY, 2004, pp. 354-371.
[137] M. Naor, S. Shamir. Visual Cryptography. In Advances in Cryptology EUROCRYPT'94 ,
Perugia, Italy, Lecture Notes in Computer Science 950. Springer-Verlag, NY, 1995, pp. 1-
12.
[138] R.M. Needham, M.D. Schroeder. Using Encryption for Authentication in Large Networks
of Computers. Communications of the ACM , vol. 21, pp. 993-999, 1978.
[139] P.Q. Nguyen, J. Stern. The Two Faces of Lattices in Cryptology. In Proceedings of the
International Conference on Cryptography and Lattices (CaLC'01) , Providence, Rhode
Island, Lecture Notes in Computer Science 2146. Springer-Verlag, NY, 2001, pp. 146-180.
[140] M.A. Nielsen, I.L. Chuang. Quantum Computation and Quantum Information . Cambridge
University Press, Cambridge, 2000.
[141] K.Nyberg, L.R. Knudsen. Provable Security against a Differential Cryptanalysis. Journal
of Cryptology , Journal version of a paper presented at CRYPTO'92, Santa Barbara, CA,
vol. 8, pp. 27-37, 1995.
[142] P. Oechslin. Making a Faster Cryptanalytic Time-Memory Trade-Off. In Advances in
Cryptology CRYPTO'03 , Santa Barbara, CA, Lecture Notes in Computer Science 2729.
Springer-Verlag, NY, 2003, pp. 617-630.
[143] T. Okamoto, S. Uchiyama. A New Public-Key Cryptosystem as Secure as Factoring. In
Advances in Cryptology EUROCRYPT'98 , Espoo, Finland, Lecture Notes in Computer
Science 1403. Springer-Verlag, NY, 1998, pp. 308-318.