CS-CIPHER

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1372, Issue , 1998, Pages 189-204

  Stern, Jacques ^a   Vaudenay, Serge ^a  

^a Ecole Normale Supérieure CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FAST FOURIER TRANSFORMS;

BLOCK CIPHERS; DIFFUSION NETWORKS; HARDWARE IMPLEMENTATIONS; STATE OF THE ART;

CRYPTOGRAPHY;

EID: 84947912053     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69710-1_13     Document Type: Conference Paper

References (31)

1. Data Encryption Standard. Federal Information Processing Standard Publication 46, U. S. National Bureau of Standards, 1977.
2. DES Modes of Operation. Federal Information Processing Standard Publication 81, U. S. National Bureau of Standards, 1980.
3. K. Aoki, K. Ohta. Strict evaluation of the maximum average of diérential probability and the maximum average of linear probability. IEICE Transactions on Fundamentals, vol. E80-A, pp. 1-8, 1997.
4. E. Biham. A fast new DES implementation in software. In Fast Software Encryption, Haifa, Israel, Lectures Notes in Computer Science 1267, pp. 260-272, Springer-Verlag, 1997.
5. E. Biham, A. Shamir. Diérential cryptanalysis of the full 16-round DES. In Advances in Cryptology CRYPTO'92, Santa Barbara, California, U.S.A., Lectures Notes in Computer Science 740, pp. 487-496, Springer-Verlag, 1993.
6. E. Biham, A. Shamir. Diérential Cryptanalysis of the Data Encryption Standard, Springer-Verlag, 1993.
7. F. Chabaud, S. Vaudenay. Links between diérential and linear cryptanalysis. In Advances in Cryptology EUROCRYPT'94, Perugia, Italy, Lectures Notes in Computer Science 950, pp. 356-365, Springer-Verlag, 1995.
8. H. Dobbertin. Almost Perfect nonlinear power functions on GF(2n). IEEE Trans. Inf. Theory, submitted.
9. H. Feistel. Cryptography and computer privacy. Scientific american, vol. 228, pp. 15-23, 1973.
10. H. Gilbert. Cryptanalyse Statistique des Algorithmes de Chirement et Sécurité des Schémas d'Authentication, Thése de Doctorat de l'Université de Paris 11, 1997.
11. H. Gilbert, G. Chassé. A statistical attack of the FEAL-8 cryptosystem. In Advances in Cryptology CRYPTO'90, Santa Barbara, California, U.S.A., Lectures Notes in Computer Science 537, pp. 22-33, Springer-Verlag, 1991.
12. H. M. Heys, S. E. Tavares. Substitution-Permutation Networks resistant to diérential and linear cryptanalysis. Journal of Cryptology, vol. 9, pp. 1-19, 1996.
13. J. L. Massey. SAFER K-64: a byte-oriented block-ciphering algorithm. In Fast Software Encryption, Cambridge, United Kingdom, Lectures Notes in Computer Science 809, pp. 1-17, Springer-Verlag, 1994.
14. J. L. Massey. SAFER K-64: one year later. In Fast Software Encryption, Cambridge, United Kingdom, Lectures Notes in Computer Science 809, pp. 212-241, Springer-Verlag, 1994.
15. M. Matsui. Linear cryptanalysis methods for DES cipher. In Advances in Cryptology EUROCRYPT'93, Lofthus, Norway, Lectures Notes in Computer Science 765, pp. 386-397, Springer-Verlag, 1994.
16. M. Matsui. The first experimental cryptanalysis of the Data Encryption Standard. In Advances in Cryptology CRYPTO'94, Santa Barbara, California, U.S.A., Lectures Notes in Computer Science 839, pp. 1-11, Springer-Verlag, 1994.
17. M. Matsui. New structure of block ciphers with provable security against diérential and linear cryptanalysis. In Fast Software Encryption, Cambridge, United Kingdom, Lectures Notes in Computer Science 1039, pp. 205-218, Springer-Verlag, 1996.
18. M. Matsui. New block encryption algorithm MISTY. In Fast Software Encryption, Haifa, Israel, Lectures Notes in Computer Science 1267, pp. 54-68, Springer-Verlag, 1997.
19. K. Nyberg. Perfect nonlinear S-boxes. In Advances in Cryptology EUROCRYPT' 91, Brighton, United Kingdom, Lectures Notes in Computer Science 547, pp. 378-385, Springer-Verlag, 1991.
20. K. Nyberg, L. R. Knudsen. Provable security against a diérential cryptanalysis. Journal of Cryptology, vol. 8, pp. 27-37, 1995.
21. Organisation for Economic Co-operation and Development Cryptography Policy Guidelines, 27 March, 1997.
22. C. P. Schnorr. FFT-Hashing: an efficient cryptographic hash function. Présentéa CRYPTO'91. Non publié.
23. C. P. Schnorr. FFT-Hash II, efficient cryptographic hashing. In Advances in Cryptology EUROCRYPT'92, Balatonfured, Hungary, Lectures Notes in Computer Science 658, pp. 45-54, Springer-Verlag, 1993.
24. C.-P. Schnorr, S. Vaudenay. Parallel FFT-hashing. In Fast Software Encryption, Cambridge, United Kingdom, Lectures Notes in Computer Science 809, pp. 149-156, Springer-Verlag, 1994.
25. C.-P. Schnorr, S. Vaudenay. Black box cryptanalysis of hash networks based on multipermutations. In Advances in Cryptology EUROCRYPT'94, Perugia, Italy, Lectures Notes in Computer Science 950, pp. 47-57, Springer-Verlag, 1995.
26. C. P. Schnorr, S. Vaudenay. Black box cryptanalysis of cryptographic primitives. Submitted. Early version available as LIENS Report 95-28, Laboratoire d'Informatique de l'Ecole Normale Supérieure, 1995. ftp://ftp.ens.fr/pub/reports/liens/liens-95-28.A4.ps.Z
27. C. E. Shannon. Communication theory of secrecy systems. Bell system technical journal, vol. 28, pp. 656-715, 1949.
28. A. Tardy-Corfdir, H. Gilbert. A known plaintext attack of FEAL-4 and FEAL- 6. In Advances in Cryptology CRYPTO'91, Santa Barbara, California, U.S.A., Lectures Notes in Computer Science 576, pp. 172-181, Springer-Verlag, 1992.
29. S. Vaudenay. On the need for multipermutations: cryptanalysis of MD4 and SAFER. In Fast Software Encryption, Leuven, Belgium, Lectures Notes in Computer Science 1008, pp. 286-297, Springer-Verlag, 1995.
30. S. Vaudenay. La Sécurité des Primitives Cryptographiques, Thése de Doctorat de l'Université de Paris 7, Technical Report LIENS-95-10 of the Laboratoire d'Informatique de l'Ecole Normale Supérieure, 1995.
31. Rocke Verser. Strong cryptography makes the world a safer place. http://www.frii.com/_rcv/deschall.htm