Digraphs with walks of equal length between vertices
Graph theory with applications to algorithms and computer science
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
OCB: a block-cipher mode of operation for efficient authenticated encryption
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
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
On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Differential Cryptanalysis of DES-like Cryptosystems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Indistinguishability of Random Systems
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
On the Pseudorandomness of Top-Level Schemes of Block Ciphers
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Mercy: A Fast Large Block Cipher for Disk Sector Encryption
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
New Results on the Pseudorandomness of Some Blockcipher Constructions
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Round Security and Super-Pseudorandomness of MISTY Type Structure
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
PRESENT: An Ultra-Lightweight Block Cipher
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Tweakable Pseudorandom Permutation from Generalized Feistel Structure
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Revisiting the IDEA Philosophy
Fast Software Encryption
Cryptanalysis of Skipjack reduced to 31 rounds using impossible differentials
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Tweakable enciphering schemes from hash-sum-expansion
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
HIGHT: a new block cipher suitable for low-resource device
CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
The 128-bit blockcipher CLEFIA
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
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
LBlock: a lightweight block cipher
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
On maximum differential probability of generalized Feistel
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Double SP-functions: enhanced generalized feistel networks
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Piccolo: an ultra-lightweight blockcipher
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
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
| Hi-index | 0.03 |
The generalized Feistel structure (GFS) is a generalized form of the classical Feistel cipher. A popular version of GFS, called Type-II, divides a message into k 2 sub blocks and applies a (classical) Feistel transformation for every two sub blocks, and then performs a cyclic shift of k sub blocks. Type-II GFS has many desirable features for implementation. A drawback, however, is its low diffusion property with a large k. This weakness can be exploited by some attacks, such as impossible differential attack. To protect from them, Type-II GFS generally needs a large number of rounds. In this paper, we improve the Type-II GFS's diffusion property by replacing the cyclic shift with a different permutation. Our proposal enables to reduce the number of rounds to attain a sufficient level of security. Thus, we improve the security-efficiency treading off of Type-II GFS. In particular, when k is a power of two, we obtain a significant improvement using a highly effective permutation based on the de Bruijn graph.