Feistel ciphers with L2-decorrelation

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

Volumn 1556, Issue , 1999, Pages 1-14

  Vaudenay, Serge ^a  

^a Ecole Normale Supérieure CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

LYAPUNOV METHODS; SECURITY OF DATA;

BLOCK CIPHERS; DE CORRELATIONS; DECORRELATION TECHNIQUE; FEISTEL CIPHERS; L2-NORM; LINEAR CRYPTANALYSIS;

CRYPTOGRAPHY;

EID: 84949235395     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48892-8_1     Document Type: Conference Paper

References (17)

1. 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.
2. E. Biham, A. Shamir. Differential Cryptanalysis of the Data Encryption Standard, Springer-Verlag, 1993.
3. L. Carter, M. Wegman. Universal Classes of Hash Functions. Journal of Computer and System Sciences, vol. 18, pp. 143-154, 1979.
4. H. Feistel. Cryptography and Computer Privacy. Scientific American, vol. 228, pp. 15-23, 1973.
5. H. Gilbert, M. Girault, P. Hoogvorst, F. Noilhan, T. Pornin, G. Poupard, J. Stern,. Vaudenay. Decorrelated Fast Cipher: an AES Candidate. Advanced Encryption Standard Submissions, US Department of Commerce, 1998.
6. M. Luby, C. Rackoff. How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM Journal on Computing, vol. 17, pp. 373-386, 1988.
7. 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.
8. M. Matsui. New Structure of Block Ciphers with Provable Security Against Differential and Linear Cryptanalysis. In Fast Software Encryption, Cambridge, United Kingdom, Lectures Notes in Computer Science 1039, pp. 205-218, Springer-Verlag, 996.
9. G. Poupard, S. Vaudenay. Decorrelated Fast Cipher: an AES Candidate Well Suited for Low Cost Smart Cards Applications. Submitted to CARDIS'98.
10. C. E. Shannon. Communication Theory of Secrecy Systems. Bell system technical journal, vol. 28, pp. 656-715, 1949.
11. A. Shamir. How to Photofinish a Cryptosystem? Presented at the Rump Session of Crypto'97.
12. S. Vaudenay. A Cheap Paradigm for Block Cipher Security Strengthening. Technical Report LIENS-97-3, Ecole Normale Superieure, 1997.
13. S. Vaudenay. Provable Security for Block Ciphers by Decorrelation. In STACS 98, Paris, France, Lectures Notes in Computer Science 1373, pp. 249-275, SpringerVerlag, 1998.
14. S. Vaudenay. Provable Security for Block Ciphers by Decorrelation. (Journal Version.) Submitted.
15. S. Vaudenay. The Decorrelation Technique Home-Page. URL:http://www.dmi. ens.fr/~vaudenay/decorrelation.html
16. G. S. Vernam. Cipher Printing Telegraph Systems for Secret Wire and Radio Telegraphic communications. Journal of the American Institute of Electrical Engineers, vol. 45, pp. 109-115, 1926.
17. 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.