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

40 n 1 sep 1985 pp 90107 906 m kurosaki t matsumoto

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: S Data Encryption Standard,” Technical Report SEL 76–042, Information Systems Lab, Department of Electrical Engineering, Stanford University, 1976. 722. M.E. Hellman and S.C. Pohlig, “Exponentiation Cryptographic Apparatus and Method,” U.S. Patent #4,424,414, 3 Jan 1984. 723. M.E. Hellman and J.M. Reyneri, “Distribution of Drainage in the DES,” Advances in Cryptology: Proceedings of Crypto 82, Plenum Press, 1983, pp. 129–131. 724. F. Hendessi and M.R. Aref, “A Successful Attack Against the DES,” Third Canadian Workshop on Information Theory and Applications, Springer–Verlag, 1994, pp. 78–90. 725. T. Herlestam, “Critical Remarks on Some Public–Key Cryptosystems,” BIT, v. 18, 1978, pp. 493–496. 726. T. Herlestam, “On Functions of Linear Shift Register Sequences”, Advances in Cryptology—EUROCRYPT ’85, Springer–Verlag, 1986, pp. 119–129. 727. T. Herlestam and R. Johannesson, “On Computing Logarithms over GF(2p),” BIT, v. 21, 1981, pp. 326–334. 728. H.M. Heys and S.E. Tavares, “On the Security of the CAST Encryption Algorithm,” Proceedings of the Canadian Conference on Electrical and Computer Engineering, Halifax, Nova Scotia, Sep 1994, pp. 332–335. 729. H.M. Heys and S.E. Tavares, “The Design of Substitution–Permutation Networks Resistant to Differential and Linear Cryptanalysis,” Proceedings of the 2nd Annual ACM Conference on Computer and Communications Security, ACM Press, 1994, pp. 148–155. 730. E. Heyst and T.P. Pederson, “How to Make Fail–Stop Signatures,” Advances in Cryptology—EUROCRYPT ’92 Proceedings, Springer–Verlag, 1993, pp. 366–377. 731. E. Heyst, T.P. Pederson, and B. Pfitzmann, “New Construction of Fail–Stop Signatures and Lower Bounds,” Advances in Cryptology—CRYPTO ’92 Proceedings, Springer–Verlag, 1993, pp. 15–30. 732. L.S. Hill, “Cryptography in an Algebraic Alphabet,” American Mathematical Monthly, v. 36, Jun–Jul 1929, pp. 306–312. 733. P.J.M. Hin, “Channel–Error–Correcting Privacy Cryptosystems,” Ph.D. dissertation, Delft University of...
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