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

8191 1021 t matsumoto and h imai a class of asymmetric

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: –325. 833. J. Kilian and T. Leighton, “Failsafe Key Escrow,” MIT/LCS/TR–636, MIT Laboratory for Computer Science, Aug 1994. 834. K. Kim, “Construction of DES–Like S–Boxes Based on Boolean Functions Satisfying the SAC,” Advances in Cryptology—ASIACRYPT ’91 Proceedings, Springer–Verlag, 1993, pp. 59–72. 835. K. Kim, S. Lee, and S. Park, “Necessary Conditions to Strengthen DES S–Boxes Against Linear Cryptanalysis,” Proceedings of the 1994 Symposium on Cryptography and Information Security (SCIS 94), Lake Biwa, Japan, 27–29 Jan 1994, pp. 15D.1–9. 836. K. Kim, S. Lee, and S. Park, “How to Strengthen DES against Differential Attack,” unpublished manuscript, 1994. 837. K. Kim, S. Lee, S. Park, and D. Lee, “DES Can Be Immune to Differential Cryptanalysis,” Workshop on Selected Areas in Cryptography—Workshop Record, Kingston, Ontario, 5–6 May 1994, pp. 70–81. 838. K. Kim, S. Park, and S. Lee, “How to Strengthen DES against Two Robust Attacks,” Proceedings of the 1995 Japan–Korea Workshop on Information Security and Cryptography, Inuyama, Japan, 24–27 Jan 1995, 173–182. 839. K. Kim, S. Park, and S. Lee, “Reconstruction of s2DES S–Boxes and their Immunity to Differential Cryptanalysis,” Proceedings of the 1993 Korea–Japan Workshop on Information Security and Cryptography, Seoul, Korea, 24–26 Oct 1993, pp. 282–291. 840. S. Kim and B.S. Um, “A Multipurpose Membership Proof System Based on Discrete Logarithm,” Proceedings of the 1993 Korea–Japan Workshop on Information Security and Cryptography, Seoul, Korea, 24–26 Oct 1993, pp. 177–183. 841. P. Kinnucan, “Data Encryption Gurus: Tuchman and Meyer,” Cryptologia, v. 2, n. 4, Oct 1978. 842. A. Klapper, “The Vulnerability of Geometric Sequences Based on Fields of Odd Characteristic,” Journal of Cryptology, v. 7, n. 1, 1994, pp. 33–52. 843. A. Klapper, “Feedback with Carry Shift Registers over Finite Fields,” K.U. Leuven Workshop on Cryptographic Algorithms, Springer–Verlag, 1995, to appear. 844. A. K...
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