Resistance against general iterated attacks

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

Volumn 1592, Issue , 1999, Pages 255-271

  Vaudenay, Serge ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

BLOCK CIPHERS; DE CORRELATIONS; DECORRELATION TECHNIQUE; LINEAR CRYPTANALYSIS; ORDER 2; UPPER BOUND;

CRYPTOGRAPHY;

EID: 84957641836     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48910-X_18     Document Type: Conference Paper

References (25)

1. Data Encryption Standard. Federal Information Processing Standard Publication 46, U. S. National Bureau of Standards, 1977.
2. M. Bellare, P. Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, U.S.A., pp. 62-73, ACM Press, 1993.
3. E. Biham, A. Shamir. Diffierential Cryptanalysis of the Data Encryption Standard, Springer-Verlag, 1993.
4. D. Bleichenbacher. Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS#1. In Advances in Cryptology CRYPTO'98, Santa Barbara, California, U.S.A., Lectures Notes in Computer Science 1462, pp. 1-12, Springer-Verlag, 1998.
5. L. Carter, M. Wegman. Universal Classes of Hash Functions. Journal of Computer and System Sciences, vol. 18, pp. 143-154, 1979.
6. H. Feistel. Cryptography and Computer Privacy. Scientiffic American, vol. 228, pp. 15-23, 1973.
7. H. Gilbert, M. Girault, P. Hoogvorst, F. Noilhan, T. Pornin, G. Poupard, J. Stern, S. Vaudenay. Decorrelated Fast Cipher: An AES Candidate. Submitted to the Advanced Encryption Standard process. In CD-ROM “AES CD-1: Documentation",National Institute of Standards and Technology (NIST), August 1998.
8. O. Goldreich, S. Goldwasser, S. Micali. How to Construct Random Functions. In Proceedings of the 25th IEEE Symposium on Foundations of Computer Science, Singer Island, U.S.A., pp. 464-479, IEEE, 1984.
9. S. Halevi, H. Krawczyk. MMH: Software Message Authentication in the Gbit/Second Rates. In Fast Software Encryption, Haifa, Israel, Lectures Notes in Computer Science 1267, pp. 172-189, Springer-Verlag, 1997.
10. T. Jakobsen, L. R. Knudsen. The Interpolation Attack on Block Ciphers. In Fast Software Encryption, Haifa, Israel, Lectures Notes in Computer Science 1267, pp. 28-40, Springer-Verlag, 1997.
11. J. Pieprzyk. How to Construct Pseudorandom Permutations from a Single Pseudorandom Functions. In Advances in Cryptology EUROCRYPT'90, Aarhus, Denemark, Lectures Notes in Computer Science 473, pp. 140-150, Springer-Verlag, 1991.
12. J. Patarin. Etude des Générateurs de Permutations Basés sur le Schéma du D.E.S., Thése de Doctorat de l'Universitéde Paris 6, 1991.
13. J. Patarin. How to Construct Pseudorandom and Super Pseudorandom Permutations from One Single Pseudorandom Function. In Advances in Cryptology EURO- CRYPT'92, Balatonfred, Hungary, Lectures Notes in Computer Science 658, pp. 256-266, Springer-Verlag, 1993.
14. J. Patarin. About Feistel Schemes with Six (or More) Rounds. In Fast Software Encryption, Paris, France, Lectures Notes in Computer Science 1372, pp. 103-121, Springer-Verlag, 1998.
15. R. L. Rivest, A. Shamir and L. M. Adleman. A Method for Obtaining Digital Signatures and Public-key Cryptosystem. In Communications of the ACM, vol. 21, pp. 120-126, 1978.
16. C. E. Shannon. Communication Theory of Secrecy Systems. Bell system technical journal, vol. 28, pp. 656-715, 1949.
17. V. Shoup. Lower Bounds for Discrete Logarithms and Related Problems. In Ad- vances in Cryptology EUROCRYPT'97, Konstanz, Germany, Lectures Notes in Computer Science 1233, pp. 256-266, Springer-Verlag, 1997.
18. S. Vaudenay. An Experiment on DES - Statistical Cryptanalysis. In 3rd ACM Conference on Computer and Communications Security, New Delhi, India, pp. 139-147, ACM Press, 1996.
19. 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.
20. S. Vaudenay. Provable Security for Block Ciphers by Decorrelation. (Full Paper.) Submitted. Preliminary version available on URL:ftp://ftp.ens.fr/pub/reports/liens/liens-98-8.A4.ps.Z
21. S. Vaudenay. Feistel Ciphers with L2-Decorrelation. To appear in SAC'98, LNCS.
22. S. Vaudenay. The Decorrelation Technique Home-Page. URL:http://www.dmi.ens.fr/~vaudenay/decorrelation.html
23. G. S. Vernam. Cipher Printing Telegraph Systems for Secret Wire and Radio Telegraphic Communications. Journal of the American Institute of Electrical Engi- neers, vol. 45, pp. 109-115, 1926.
24. D. Wagner. The Boomerang Attack. Personal communication.
25. M. N. Wegman, J. L. Carter. New Hash Functions and their Use in Authentication and Set Equality. Journal of Computer and System Sciences, vol. 22, pp. 265-279, 1981.