On the pseudorandomness of top-level schemes of block ciphers

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

Volumn 1976, Issue , 2000, Pages 289-302

  Moriai, Shiho ^a   Vaudenay, Serge ^b  

^a NTT CORPORATION   (Japan)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

LYAPUNOV METHODS; RANDOM PROCESSES; SECURITY OF DATA;

BLOCK CIPHER STRUCTURES; BLOCK CIPHERS; CHOSEN PLAINTEXTS; DE CORRELATIONS; DISTINGUISHERS; FEISTEL SCHEME; LEVEL SCHEMES; PSEUDORANDOMNESS;

CRYPTOGRAPHY;

EID: 84937409797     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44448-3_22     Document Type: Conference Paper

References (17)

1. E. Biham, A. Shamir. Differential Cryptanalysis of the Data Encryption Standard, Springer-Verlag, 1993.
2. L. Carter, M. Wegman. Universal Classes of Hash Functions. Journal of Computer and System Sciences, vol.18, pp.143–154, 1979.
3. J. Daemen, V. Rijmen. AES Proposal: Rijndael. URL: http://www.esat.kuleuven.ac.be/~rijmen/rijndael/
4. H. Feistel. Cryptography andCom puter Privacy. Scientific American, vol. 228, pp. 15–23, 1973.
5. H. Gilbert, M. Girault, P. Hoogvorst, F. Noilhan, T. Pornin, G. Poupard, J. Stern, S. Vaudenay. Decorrelated Fast Cipher: an AES Candidate. (Extended Abstract.) In Proceedings from the First Advanced Encryption Standard Candidate Conference, National Institute of Standards and Technology (NIST), August 1998.
6. H. Gilbert, H. Handschuh, A. Joux, S. Vaudenay. A Statistical Attack on RC 6. To appear in the proceedings of FSE00.
7. L. Granboulan, P. Nguyen, F. Noilhan, S. Vaudenay. DFCv 2. To appear in the proceedings of SAC00.
8. T. Iwata, K. Kurosawa. On the Pseudorandomness of AES Finalists — RC6, Serpent, MARS and Two fish. To appear in the proceedings of FSE00.
9. M. Luby, C. Rackoff. How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAMJournal on Computing, vol. 17, pp. 373–386, 1988.
10. 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.
11. F. Noilhan. Software Optimization of Decorrelation Module. In Selected Areas in Cryptography, Kingston, Ontario, Canada, Lectures Notes in Computer Science 1758, pp. 175–183, Springer-Verlag, 2000.
12. J. Patarin. Etude des Générateurs de Permutations Bas´es sur le Schéma du D.E.S., Thèse de Doctorat de l’Universit´e de Paris 6, 1991.
13. S. Vaudenay. Provable Security for Block Ciphers by Decorrelation. In STACS 98, Paris, France, Lectures Notes in Computer Science 1373, pp. 249–275, Springer- Verlag, 1998.
14. S. Vaudenay. On the Lai-Massey Scheme. Advances in Cryptology — ASIACRYPT’ 99, Singapore, Lecture Notes in Computer Science 1716, pp.8–19, Springer-Verlag, 1999.
15. S. Vaudenay. Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness. Technical report LIENS-99-2, Ecole Normale Supérieure, 1999. In Selected Areas in Cryptography, Kingston, Ontario, Canada, Lectures Notes in Computer Science 1758, pp. 49–61, Springer-Verlag, 2000.
16. S. Vaudenay. On Provable Security for Conventional Cryptography. Invited talk. To appear in the proceedings of ICISC’ 99, LNCS, Springer-Verlag.
17. Y. Zheng, T. Matsumoto, H. Imai. On the Construction of Block Ciphers Provably Secure andN ot Relying on Any Unproved Hypotheses (ExtendedA bstract). Advances in Cryptology — CRYPTO’89, Santa Barbara, California, U.S.A., Lecture Notes in Computer Science 435, pp.461–480, Springer-Verlag, 1990