applied cryptography - protocols, algorithms, and source code in c

Applied cryptography second edition protocols

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Hellman Cryptosystem,” IEEE Transactions on Information Theory, v. IT–30, n. 5, Sep 1984, pp. 699–704. 1422. A. Shamir, “Identity–Based Cryptosystems and Signature Schemes,” Advances in Cryptology: Proceedings of CRYPTO 84, Springer–Verlag, 1985, pp. 47–53. 1423. A. Shamir, “On the Security of DES,” Advances in Cryptology—CRYPTO ’85 Proceedings, Springer–Verlag, 1986, pp. 280–281. 1424. A. Shamir, lecture at SECURICOM ’89. 1425. A. Shamir, “Efficient Signature Schemes Based on Birational Permutations,” Advances in Cryptology—CRYPTO ’93 Proceedings, Springer–Verlag, 1994, pp. 1–12. 1426. A. Shamir, personal communication, 1993. 1427. A. Shamir and A. Fiat, “Method, Apparatus and Article for Identification and Signature,” U.S. Patent #4,748,668, 31 May 1988. 1428. A. Shamir and R. Zippel, “On the Security of the Merkle–Hellman Cryptographic Scheme,” IEEE Transactions on Information Theory, v. 26, n. 3, May 1980, pp. 339–340. 1429. M. Shand, P. Bertin, and J. Vuillemin, “Hardware Speedups in Long Integer Multiplication,” Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990, pp. 138–145. 1430. D. Shanks, Solved and Unsolved Problems in Number Theory, Washington D.C.: Spartan, 1962. 1431. C.E. Shannon, “A Mathematical Theory of Communication,” Bell System Technical Journal, v. 27, n. 4, 1948, pp. 379–423, 623–656. 1432. C.E. Shannon, “Communication Theory of Secrecy Systems,” Bell System Technical Journal, v. 28, n. 4, 1949, pp. 656–715. 1433. C.E. Shannon, Collected Papers: Claude Elmwood Shannon, N.J.A. Sloane and A.D. Wyner, eds., New York: IEEE Press, 1993. 1434. C.E. Shannon, “Predication and Entropy in Printed English,” Bell System Technical Journal, v. 30, n. 1, 1951, pp. 50–64. 1435. A. Shimizu and S. Miyaguchi, “Fast Data Encipherment Algorithm FEAL,” Transactions of IEICE of Japan, v. J70–D, n. 7, Jul 87, pp. 1413–1423. (In Japanese.) 1436. A. Shimizu and S. Miyaguchi, “Fast Data Encipherment Algorithm FEAL,” Advances in Cryptology—EUROCRYPT ’87 Proceedings, Springer–Verlag, 1988, pp. 267–278. 1437. A. Shimizu and S. Miyaguchi, “FEAL—Fast Data Encipherment Algorithm,” Systems and Computers in Japan, v. 19, n. 7, 1988, pp. 20–34, 104–106...
View Full Document

This note was uploaded on 10/18/2010 for the course MATH CS 301 taught by Professor Aliulger during the Fall '10 term at Koç University.

Ask a homework question - tutors are online