How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
A proposal for a new block encryption standard
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
CRYPTO '89 Proceedings on Advances in cryptology
On Probable Security for Conventional Cryptography
ICISC '99 Proceedings of the Second International Conference on Information Security and Cryptology
The Security of Cipher Block Chaining
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
New Block Encryption Algorithm MISTY
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Pseudorandomness of MISTY-Type Transformations and the Block Cipher KASUMI
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Provable Security of KASUMI and 3GPP Encryption Mode f8
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Non-cryptographic Primitive for Pseudorandom Permutation
FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
Non-cryptographic primitive for pseudorandom permutation
Theoretical Computer Science
Luby---Rackoff Revisited: On the Use of Permutations as Inner Functions of a Feistel Scheme
Designs, Codes and Cryptography
Security of the Five-Round KASUMI Type Permutation
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Improving the generalized Feistel
FSE'10 Proceedings of the 17th international conference on Fast software encryption
Generic attacks on misty schemes
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Security of the MISTY structure in the luby-rackoff model: improved results
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Proving the security of AES substitution-permutation network
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Hybrid symmetric encryption using known-plaintext attack-secure components
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
3kf9: enhancing 3GPP-MAC beyond the birthday bound
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Hi-index | 0.00 |
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 and Sakurai et al. 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.