How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
On Weaknesses of Non–surjective Round Functions
Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms - Design and Analysis
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Generalized Birthday Arracks on Unbalanced Feistel Networks
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Generic Attacks on Feistel Schemes
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Unbalanced Feistel Networks and Block Cipher Design
Proceedings of the Third International Workshop on Fast Software Encryption
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Luby---Rackoff Revisited: On the Use of Permutations as Inner Functions of a Feistel Scheme
Designs, Codes and Cryptography
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Generic attacks on unbalanced feistel schemes with contracting functions
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Generic attacks on misty schemes
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Increasing block sizes using feistel networks: the example of the AES
Cryptography and Security
Square reflection cryptanalysis of 5-round Feistel networks with permutations
Information Processing Letters
| Hi-index | 0.00 |
In this paper, we describe generic attacks on Feistel networks with internal permutations, instead of Feistel networks with internal functions as designed originally. By generic attacks, we mean that in these attacks the internal permutations are supposed to be random. Despite the fact that some real Feistel ciphers actually use internal permutations like Twofish, Camellia, or DEAL, these ciphers have not been studied much. We will see that they do not always behave like the original Feistel networks with round functions. More precisely, we will see that the attacks (known plaintext attacks or chosen plaintext attacks) are often less efficient, namely on all 3i rounds, i *** ****. For a plaintext of size 2n bits, the complexity of the attacks will be strictly less than 22n when the number of rounds is less than or equal to 5. When the number k of rounds is greater, we also describe some attacks enabling to distinguish a k -round Feistel network generator from a random permutation generator.