Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
New Results on Pseudorandom Permutation Generators Based on the DES Scheme
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Generalized Birthday Arracks on Unbalanced Feistel Networks
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Unbalanced Feistel Networks and Block Cipher Design
Proceedings of the Third International Workshop on Fast Software Encryption
Two Practical and Provably Secure Block Ciphers: BEARS and LION
Proceedings of the Third International Workshop on Fast Software Encryption
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
Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
On generalized Feistel networks
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Generic attacks on misty schemes
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
On Lai---Massey and quasi-Feistel ciphers
Designs, Codes and Cryptography
On unbalanced Feistel networks with contracting MDS diffusion
Designs, Codes and Cryptography
On permutation layer of type 1, source-heavy, and target-heavy generalized feistel structures
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
| Hi-index | 0.00 |
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k - 1)n bits. At each round, all the bits except n bits are changed by using a function that depends only on these n bits. Jutla [6] investigated such schemes, which he denotes by Fkd, where d is the number of rounds. In this paper, we describe novel Known Plaintext Attacks (KPA) and Non-Adaptive Chosen Plaintext Attacks (CPA-1) against these schemes. With these attacks we will often be able to improve the results of Jutla.