DFC (cipher)
From Wikipedia, the free encyclopedia
Designer(s): | Jacques Stern, Serge Vaudenay, et al |
---|---|
First published: | 1998 |
Related to: | COCONUT98 |
Key size(s): | 128, 192, or 256 bits |
Block size(s): | 128 bits |
Structure: | Feistel network |
Rounds: | 8 |
Best public cryptanalysis: | |
Knudsen and Rijmen's differential attack breaks 6 rounds | |
In cryptography, DFC (Decorrelated Fast Cipher) is a block cipher which was created in 1998 by a group of researchers from École Normale Supérieure, CNRS, and France Télécom (including Jacques Stern and Serge Vaudenay) and submitted to the AES competition.
Like other AES candidates, DFC operates on blocks of 128 bits, using a key of 128, 192, or 256 bits. It uses an 8-round Feistel network. The round function uses a single 6×32-bit S-box, as well as an affine transformation mod 264+13. DFC can actually use a key of any size up to 256 bits; the key schedule uses another 4-round Feistel network to generate a 1024-bit "expanded key". The arbitrary constants, including all entries of the S-box, are derived using the binary expansion of e as a source of "nothing up my sleeve numbers".
Although DFC was designed using Vaudenay's decorrelation theory to be provably secure against ordinary differential and linear cryptanalysis, in 1999 Lars Knudsen and Vincent Rijmen presented a differential chosen-ciphertext attack that breaks 6 rounds faster than exhaustive search.
In 2000, Vaudenay, et al. presented an updated version of the algorithm, called DFCv2. This variant allows for more choice in the cipher's parameters, and uses a modified key schedule to eliminate certain weak keys discovered by Don Coppersmith.
[edit] References
- H. Gilbert, M. Girault, P. Hoogvorst, F. Noilhan, T. Pornin, G. Poupard, J. Stern, S. Vaudenay (1998-05-19). "Decorrelated Fast Cipher: an AES candidate" (PDF/PostScript). Retrieved on 2007-02-08.
- Lars Knudsen, Vincent Rijmen (1999-03). "On the Decorrelated Fast Cipher (DFC) and Its Theory" (PostScript). 6th International Workshop on Fast Software Encryption (FSE '99): 81-94, Rome: Springer-Verlag. Retrieved on 2007-02-14.
- Louis Granboulan, Phong Q. Nguyen, Fabrice Noilhan, Serge Vaudenay (2000). "DFCv2" (PDF/PostScript). Selected Areas in Cryptography (SAC 2000): 57-71, Waterloo, Ontario: Springer-Verlag. Retrieved on 2007-02-15.