Analysis of 3-line generalized Feistel networks with double SD-functions
Highlights
► Double SD-structures as F-functions for 3-line GFNs. ► Lower bounds on the number of active S-boxes in such 3-line GFNs. ► Tightness of these bounds for MDS matrices. ► 8-round impossible differentials for 3-line GFNs. ► 3-line GFNs are up to 14% more efficient than 4-line GFNs for double SD.
References (20)
- et al.
Cryptanalysis of skipjack reduced to 31 rounds using impossible differentials
- et al.
Two attacks on reduced IDEA
- et al.
Differential cryptanalysis of DES-like cryptosystems
J. Cryptology
(1991) - et al.
Attacks on hash functions based on generalized Feistel application to reduced-round Lesamnta and SHAvite-3512
- et al.
Impossible boomerang attack for block cipher structures
- S. Hirose, H. Kuwakado, SHA-3 Proposal: Lesamnta, submission to NIST,...
Linear cryptanalysis of the data encryption standard
- et al.
On the construction of block ciphers provably secure and not relying on any unproved hypotheses
- et al.
The Design of Rijndael: AES—The Advanced Encryption Standard
(2002) - et al.
Security on generalized Feistel scheme with SP round function
Int. J. Netw. Secur.
(2006)
There are more references available in the full text version of this article.
Cited by (0)
- 1
Both authors made equal contributions to this work.
Copyright © 2011 Elsevier B.V. All rights reserved.