On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys

Authors:
Paul Onions
Affiliations:
-
Venue:
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Year:
2001

Citing 4
Cited 1

How to Protect DES Against Exhaustive Key Search

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Description of a New Variable-Length Key, 64-bit Block Cipher (Blowfish)

Fast Software Encryption, Cambridge Security Workshop
Slide Attacks

FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Advanced slide attacks

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Advanced slide attacks revisited: realigning slide on DES

Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent work by Biryukov and Wagner on developing the slide attack technique has revealed it to be a powerful tool in the analysis of block cipher designs. In this paper the technique is used to analyze a particular construction of balanced Feistel block cipher that features identically keyed round functions but with independent pre- and post-whitening keys. It is shown that for an n-bit block size this class of cipher can be broken using n2n/2+1 chosen plaintexts in O(n2n/2) time and space, and that this is irrespective of both the size of the key and the number of rounds of the algorithm. Comparisons are then drawn against the DESX and Even-Mansour constructions.