How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
The Design of Rijndael
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
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
Provable Security Against Differential Cryptanalysis
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
New Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis
Proceedings of the Third International Workshop on Fast Software Encryption
Proceedings of the Third International Workshop on Fast Software Encryption
Unbalanced Feistel Networks and Block Cipher Design
Proceedings of the Third International Workshop on Fast Software Encryption
Improved Upper Bounds of Differential and Linear Characteristic Probability for Camellia
FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
Impossible Differential Cryptanalysis of CLEFIA
Fast Software Encryption
On Generalized Feistel Structures Using the Diffusion Switching Mechanism
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
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
Double SP-functions: enhanced generalized feistel networks
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
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
PICARO: a block cipher allowing efficient higher-order side-channel resistance
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
The 128-bit blockcipher CLEFIA
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
Generalized Feistel networks revisited
Designs, Codes and Cryptography
| Hi-index | 0.00 |
We study a recently proposed design approach of Feistel structure which employs diffusion matrices in a switching way. At ASIACRYPT 2004, Shirai and Preneel have proved that large numbers of S-boxes are guaranteed to be active if a diffusion matrix used in a round function is selected among multiple matrices. However the optimality of matrices required by the proofs sometimes pose restriction to find matrices suitable for actual blockciphers. In this paper, we extend their theory by replacing the condition of optimal mappings with general-type mappings, consequently the restriction is eliminated. Moreover, by combining known lower bounds for usual Feistel structure, we establish a method to estimate the guaranteed number of active S-boxes for arbitrary round numbers. We also demonstrate how the generalization enables us to mount wide variety of diffusion mappings by showing concrete examples.