- DFC (cipher)
-
This article is about the block cipher. For other uses, see DFC (disambiguation).
DFC General Designers Jacques Stern, Serge Vaudenay, et al. First published 1998 Related to COCONUT98 Cipher detail Key sizes 128, 192, or 256 bits Block sizes 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".
Soon after DFC's publication, Ian Harvey raised the concern that reduction modulo a 65-bit number was beyond the native capabilities of most platforms, and that careful implementation would be required to protect against side-channel attacks, especially timing attacks. 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.
References
- H. Gilbert, M. Girault, P. Hoogvorst, F. Noilhan, T. Pornin, G. Poupard, J. Stern, S. Vaudenay (19 May 1998) (PDF/PostScript). Decorrelated Fast Cipher: an AES candidate. http://citeseer.ist.psu.edu/gilbert98decorrelated.html. Retrieved 8 February 2007.
- Harvey, Ian (March 1999). "The DFC Cipher: An Attack on Careless Implementations" (PDF). Second AES Candidate Conference. doi:10.1.1.42.3196. http://csrc.nist.gov/archive/aes/round1/conf2/papers/harvey.pdf. Retrieved 21 January 2009.
- Lars Knudsen, Vincent Rijmen (March 1999). "On the Decorrelated Fast Cipher (DFC) and Its Theory" (PostScript). 6th International Workshop on Fast Software Encryption (FSE '99). Rome: Springer-Verlag. pp. 81–94. http://www.cosic.esat.kuleuven.be/publications/article-367.ps. Retrieved 14 February 2007.
- Louis Granboulan, Phong Q. Nguyen, Fabrice Noilhan, Serge Vaudenay (2000). "DFCv2" (PDF/PostScript). Selected Areas in Cryptography (SAC 2000). Waterloo, Ontario: Springer-Verlag. pp. 57–71. http://citeseer.ist.psu.edu/granboulan00dfcv.html. Retrieved 15 February 2007.
External links
Categories:- Block ciphers
- Feistel ciphers
- Cryptography stubs
Wikimedia Foundation. 2010.
Look at other dictionaries:
DFC — may refer to: Dfc is one of four symbols for the subarctic climate under the Köppen climate classification system David Fickling Comic (The DFC, a British weekly children s anthology comic) decorrelated fast cipher Democratic Front of Cabinda,… … Wikipedia
DFC — Шифрование Расшифрование Эта статья включает описание термина «DFC»; о значении Dfc см. Субарктический климат. DFC (Decorrelated Fast Cipher) блочный симметричный криптоалгоритм, созданный в 1998 году совместно криптографами … Википедия
Cipher security summary — This article summarizes publicly known attacks against ciphers. Note that not all entries may be up to date. Table color key No known successful attacks Theoretical break Attack demonstrated in practice The Best attack column lists the complexity … Wikipedia
Hasty Pudding cipher — Infobox block cipher name = Hasty Pudding Cipher caption = designers = Richard Schroeppel publish date = 1998 ndash;06 derived from = derived to = related to = certification = key size = Variable block size = Variable structure = rounds =… … Wikipedia
Block cipher modes of operation — This article is about cryptography. For method of operating , see modus operandi. In cryptography, modes of operation is the procedure of enabling the repeated and secure use of a block cipher under a single key.[1][2] A block cipher by itself… … Wikipedia
Block cipher — In cryptography, a block cipher is a symmetric key cipher operating on fixed length groups of bits, called blocks, with an unvarying transformation. A block cipher encryption algorithm might take (for example) a 128 bit block of plaintext as… … Wikipedia
Cryptomeria cipher — The Feistel function of the Cryptomeria cipher. General Designers 4C Entity First published … Wikipedia
Mercy (cipher) — This article is about the block cipher. For other uses, see Mercy (disambiguation). Mercy General Designers Paul Crowley First published April 2000[1] Derived from WAKE … Wikipedia
Crab (cipher) — This article is about the block cipher. For other uses, see Crab (disambiguation). Crab General Designers Burt Kaliski, Matt Robshaw First published 1993 Derived from MD5 Related to SHACAL … Wikipedia
Nimbus (cipher) — This article is about the block cipher. For other uses, see Nimbus (disambiguation). Nimbus General Designers Alexis Machado First published 2000 Cipher detail Key sizes 128 bits Block sizes … Wikipedia