Abstract
In this paper, we describe new results on the security, in the Luby-Rackoff paradigm, of two modified Feistel constructions, namely the L-scheme, a construction used at various levels of the MISTY block-cipher which allows to derive a 2n-bit permutation from several n-bit permutations, and a slightly different construction named the R-scheme. We obtain pseudorandomness and super-pseudorandomness proofs for L-schemes and R-schemes with a sufficient number of rounds, which extend the pseudorandomness and non superpseudorandomness results on the 4-round L-scheme previously established by Sugita [Su96] and Sakurai et al. [Sa97]. In particular, we show that unlike the 3-round L-scheme, the 3-round R-scheme is pseudorandom, and that both the 5-round L scheme and the 5-round R scheme are super pseudorandom (whereas the 4 round versions of both schemes are not super pseudorandom). The security bounds obtained here are close to those established by Luby and Rackoff for the three round version of the original Feistel scheme.
Chapter PDF
References
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.
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.
Specification of the 3GPP confidentiality and Integrity algorithm KASUMI. Documentation available on http://www.etsi.org/
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.
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.
M. Luby, C. Rackoff, “How to Construct Pseudorandom Permutations from Pseudorandom Function”. In Siam Journal on Computing, vol. 17, p. 373, 1988.
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.
M. Matsui, “New Block Encryption Algorithm MISTY”, In Fast Software Encryption-FSE’97, LNCS 1267, p. 54, Springer Verlag, Haifa, Israel, 1997.
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.
K. Sakurai, Y. Zheng, “On Non-Pseudorandomness from Block Ciphers with Provable Immunity Against Linear Cryptanalysis, In IEICE Trans. Fundamentals, vol. E80-A, n. 1, January 1997.
M. Sugita, “Pseudorandomness of a Block Cipher MISTY”, Technical Reporrt of IEICE, ISEC96-9.
M. Sugita, “Pseudorandomness of a Block Cipher with Recursive Structures”, Technical Report of IEICE, ISEC97-9.
S. Vaudenay, “On Provable Security for Conventional Cryptography”, In ICISC’99, invited lecture.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gilbert, H., Minier, M. (2002). New Results on the Pseudorandomness of Some Blockcipher Constructions. In: Matsui, M. (eds) Fast Software Encryption. FSE 2001. Lecture Notes in Computer Science, vol 2355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45473-X_21
Download citation
DOI: https://doi.org/10.1007/3-540-45473-X_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43869-4
Online ISBN: 978-3-540-45473-1
eBook Packages: Springer Book Archive