DFC (cipher)
From Wikipedia, the free encyclopedia
| Designer(s): | ENS |
|---|---|
| First published: | 1998 |
| Key size(s): | 128, 192, or 256 bits |
| Block size(s): | 128 bits |
| Structure: | Feistel network |
| Rounds: | 8 |
In cryptography, DFC (Decorrelated Fast Cipher) is a block cipher which was created in 1998 by a group of researchers at École Normale Supérieure 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 S-box, as well as an affine transformation mod 264+13. DFC can actually use a key of any size up to 256 bits, which it processes using 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".
[edit] References
- H. Gilbert, M. Girault, P. Hoogvorst, F. Noilhan, T. Pornin, G. Poupard, J. Stern, S. Vaudenay. Decorrelated Fast Cipher: an AES candidate. (PDF)
 |
This cryptography-related article is a stub. You can help Wikipedia by expanding it. |
