De-correlated Fast Cipher: Difference between revisions
imported>Sandy Harris (link to cipher home page) |
John Leach (talk | contribs) m (Text replacement - "{{subpages}}" to "{{PropDel}}<br><br>{{subpages}}") |
||
| Line 1: | Line 1: | ||
{{subpages}} | {{PropDel}}<br><br>{{subpages}} | ||
'''DFC''' or '''De-correlated Fast Cipher''' | '''DFC''' or '''De-correlated Fast Cipher''' | ||
Latest revision as of 04:48, 8 April 2024
| This article may be deleted soon. | ||
|---|---|---|
 DFC or De-correlated Fast Cipher [1] [2] [3] is a block cipher developed by a French team as a candidate for the AES competition; it did not make it into the finals. Like all AES candidates, it uses 128-bit blocks and supports key sizes of 128, 192 or 256 bits. It is a six-round Feistel cipher using a single 6 by 32 S-box. This cipher was based on Serge Vaudenay's theoretical work on decorrelation theory. That theory gives methods of constructing ciphers which are provably immune to differential cryptanalysis, linear cryptanalysis, and any other attacks that meet some fairly broad assumptions. However, some attacks on DFC were found by going outside those assumptions, timing attacks on some implementations [4] and a more general attack using a variant of differential analysis [5]. References
|
||
