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

[159] B. Schneier. Applied Cryptography . John Wiley & Sons, NY, 1996. French version: Cryp-
tographie Appliquee . Vuibert, Paris, 1996.
[160] C.P. Schnorr. Efficient Identification and Signature for Smart Cards. In Advances in
Cryptology CRYPTO'89 , Santa Barbara, CA, Lecture Notes in Computer Science 435.
Springer-Verlag, NY, 1990, 235-251.
[161] C.P. Schnorr. Efficient Identification and Signature for Smart Cards. Journal of Cryptology ,
vol. 4, pp. 161-174, 1991.
[162] C.P. Schnorr, S. Vaudenay. Black Box Cryptanalysis of Hash Networks Based on Multi-
permutations. In Advances in Cryptology EUROCRYPT'94 , Perugia, Italy, Lecture Notes
in Computer Science 950. Springer-Verlag, NY, 1995, pp. 47-57.
[163] A. Shamir. How to Share a Secret. Communications of the ACM , vol. 22, pp. 612-613,
1979.
[164] A. Shamir. A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryp-
tosystem. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Sci-
ence , Chicago, IL. IEEE, 1982, pp. 145-152.
[165] A. Shamir. On the Security of DES. In Advances in Cryptology CRYPTO'85 , Santa
Barbara, CA, Lecture Notes in Computer Science 218. Springer-Verlag, NY, 1986, pp. 280-
281.
[166] A. Shamir. IP = PSPACE. In Proceedings of the 22nd ACM Symposium on Theory of Com-
puting , Baltimore, MD. ACM Press, NY, 1990, pp. 11-15.
[167] C.E. Shannon. Communication Theory of Secrecy Systems. Bell SystemTechnical Journal ,
vol. 28, pp. 656-715, 1969. Re-edited in ClaudeElwood Shannon—CollectedPapers. IEEE
Press, New York, 1993.
[168] R. Shirey. Internet Security Glossary. RFC 2828, The Internet Society, 2000.
[169] V. Shoup. OAEP Reconsidered. In Advances in Cryptology CRYPTO'01 , Santa Barbara,
CA, Lecture Notes in Computer Science 2139. Springer-Verlag, NY, 2001, pp. 239-259.
[170] V. Shoup. A Computational Introduction to Number Theory and Algebra . Online textbook,
2004. Available at http://shoup.net/ntb .
[171] J.H. Silverman. The Arithmetic of Elliptic Curves. Graduate Texts in Mathematics 106.
Springer-Verlag, NY, 1986.
[172] G.J. Simmons. A “Weak” Privacy Protocol Using the RSA Crypto Algorithm. Cryptologia ,
vol. 7, pp. 180-182, 1983.
[173] S. Singh. The Code Book . Fourth Estate, London, 1999.
[174] R. Solovay, V. Strassen. A Fast Monte-Carlo Test for Primality. SIAM Journal on Comput-
ing , vol. 6, pp. 84-86, 1977.