How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
CRYPTO '89 Proceedings on Advances in cryptology
Differential cryptanalysis of the data encryption standard
Differential cryptanalysis of the data encryption standard
On Probable Security for Conventional Cryptography
ICISC '99 Proceedings of the Second International Conference on Information Security and Cryptology
Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Software Optimization of Decorrelation Module
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Provable Security for Block Ciphers by Decorrelation
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
The First Experimental Cryptanalysis of the Data Encryption Standard
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Tweakable Pseudorandom Permutation from Generalized Feistel Structure
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Impossible Boomerang Attack for Block Cipher Structures
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
Improving the generalized Feistel
FSE'10 Proceedings of the 17th international conference on Fast software encryption
On generalized Feistel networks
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Pseudorandomness analysis of the (extended) Lai-Massey scheme
Information Processing Letters
On the diffusion of generalized Feistel structures regarding differential and linear cryptanalysis
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
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
Security analysis of the GF-NLFSR structure and four-cell block cipher
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Improved cryptanalysis of the FOX block cipher
INTRUST'09 Proceedings of the First international conference on Trusted Systems
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
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
Generalized Feistel networks revisited
Designs, Codes and Cryptography
A unified method for finding impossible differentials of block cipher structures
Information Sciences: an International Journal
| Hi-index | 0.00 |
Block ciphers are usually basedon one top-level scheme into which we plug "roundf unctions". To analyze security, it is important to study the intrinsic security provided by the top-level scheme from the viewpoint of randomness: given a block cipher in which we replaced the lower-level schemes by idealized oracles, we measure the security (in terms of best advantage for a distinguisher) depending on the number of rounds and the number of chosen plaintexts. We then extrapolate a sufficient number of secure rounds given the regular bounds provided by decorrelation theory. This approach allows the comparison of several generalizations of the Feistel schemes and others. In particular, we compare the randomness provided by the schemes used by the AES candidates. In addition we provide a general paradigm for analyzing the security provided by the interaction between the different levels of the block cipher structure.