New results on the pseudorandomness of some blockcipher constructions

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

Volumn 2355, Issue , 2002, Pages 248-266

  Gilbert, Henri ^a   Minier, Marine ^a  

^a ORANGE LABS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

BIT PERMUTATION; FEISTEL CONSTRUCTIONS; FEISTEL SCHEME; NEW RESULTS; PSEUDO RANDOM; PSEUDORANDOMNESS; SAKURAI;

RANDOM PROCESSES;

EID: 84958958728     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45473-X_21     Document Type: Conference Paper

References (14)

1. W. Aiello, R. Venkatesan, “Foiling Birthday Attacks in Length-Doubling Transformations”. In Advances in Cryptology - Eurocrypt’96, LNCS 1070, p. 307, Springer Verlag, Saragossa, Spain, May 1996.
2. M. Bellare, J. Kilian, P. Rogaway, “The Security of Cipher Block Chaining”. In Advances in Cryptology - CRYPTO’94, LNCS 839, p. 341, Springer-Verlag, Santa Barbara, U.S.A., 1994.
3. Specification of the 3GPP confidentiality and Integrity algorithm KASUMI. Documentation available on http://www.etsi.org/
4. Y. Kaneko, F. Sano, K. Sakurai, “On Provable Security against Differential and Linear Cryptanalysis in Generalized Feistel Ciphers with Multiple Random Functions”. In Selected Areas in Cryptography - SAC’97, Ottawa, Canada, August 1997.
5. X. Lai, J.L. Massey, “A Proposal for a New Block Encryption Standard”. In Advances in Cryptology - Eurocrypt’90, LNCS 473, p. 389, Springer Verlag, Aarhus, Denemark, 1991.
6. M. Luby, C. Rackoff, “How to Construct Pseudorandom Permutations from Pseudorandom Function”. In Siam Journal on Computing, vol. 17, p. 373, 1988.
7. U. Maurer, “A Simplified and generalised treatment of Luby-Rackoff Pseudorandom Permutation Generators”, In Advances in Cryptology - Eurocrypt’92, LNCS 658, p. 239, Springer Verlag, New York, USA, 1992.
8. M. Matsui, “New Block Encryption Algorithm MISTY”, In Fast Software Encryption - FSE’97, LNCS 1267, p. 54, Springer Verlag, Haifa, Israel, 1997.
9. J. Patarin, “Etude de Générateurs de Permutation Basés sur le Schéma du D.E.S.”, Phd. Thesis, University of Paris VI, 1991.
10. K. Sakurai, Y. Zheng, “On Non-Pseudorandomness from Block Ciphers with Provable Immunity Against Linear Cryptanalysis, In IEICE Trans. Fundamentals, vol. 80, n. 1, January 1997.
11. M. Sugita, “Pseudorandomness of a Block Cipher MISTY”, Technical Reporrt of IEICE, ISEC96-9.
12. M. Sugita, “Pseudorandomness of a Block Cipher with Recursive Structures”, Technical Report of IEICE, ISEC97-9.
13. S. Vaudenay, “On Provable Security for Conventional Cryptography”, In ICISC’99, invited lecture.
14. Y. Zheng, T. Matsumoto, H. Imai, “On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses”. In Advances in Cryptology - CRYPTO’89, LNCS 435, p. 461, Springer-Verlag, Santa Barbara, U.S.A., 1990.