The Twofish encryption algorithm: a 128-bit block cipher
The Twofish encryption algorithm: a 128-bit block cipher
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
A Revised Version of Crypton - Crypton V1.0
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Miss in the Middle Attacks on IDEA and Khufu
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Attack on Six Rounds of Crypton
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Improved Cryptanalysis of Rijndael
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Concrete Security Analysis of CTR-OFB and CTR-CFB Modes of Operation
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Square-like Attacks on Reduced Rounds of IDEA
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Saturation Attacks on Reduced Round Skipjack
FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
On the Security of CAMELLIA against the Square Attack
FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
Survey and benchmark of block ciphers for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
A Framework for Describing Block Cipher Cryptanalysis
IEEE Transactions on Computers
Extending commutative diagram cryptanalysis to slide, boomerang, rectangle and square attacks
Computer Standards & Interfaces
On the design of error-correcting ciphers
EURASIP Journal on Wireless Communications and Networking
Bit-Pattern Based Integral Attack
Fast Software Encryption
Higher Order Differential Attacks on Reduced-Round MISTY1
Information Security and Cryptology --- ICISC 2008
Saturation Attack on the Block Cipher HIGHT
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Cryptanalysis of reduced versions of the HIGHT block cipher from CHES 2006
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Square attack on reduced-round Zodiac cipher
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Cryptanalysis of a generalized unbalanced feistel network structure
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Integral cryptanalysis of ARIA
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
Enciphering with arbitrary small finite domains
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
New multiset attacks on rijndael with large blocks
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
New combined attacks on block ciphers
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
HIGHT: a new block cipher suitable for low-resource device
CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
EPCBC: a block cipher suitable for electronic product code encryption
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
Integral and multidimensional linear distinguishers with correlation zero
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 0.00 |
This paper introduces the notion of a "saturation attack". Consider a permutation p over w-bit words. If p is applied to all 2w disjoint words, the set of outputs is exactly the same as the set of inputs. A saturation attack exploits this fact. The current paper applies saturation attacks on reduced-round variants of the Twofish block cipher with up to seven rounds with full whitening or eight rounds without whitening at the end (i.e., half of the cipher). The attacks take up to 2127 chosen plaintexts (half of the codebook) and are 2-4 times faster than exhaustive search. The attacks are based on key-independent distinguishers for up to six rounds of Twofish, making extensive use of saturation properties.