This document includes:

1. Documents on DFC (list of our documents about DFC)
2. Best Implementations so Far (list of best known implementations of DFC)
3. Original Implementations (our original implementations)
4. Other Related Sites (list of related sites on AES)
5. The AES Candidates (list of the AES candidates)

Documents on DFC

the DFC annoucement (HTML, Aug 12th, 1998) (Check the Errata Page.)

Link to The Decorrelation Technique Home Page. (HTML) All material on the decorrelation theory on which DFC is based can be found from there.

Errata Page. (HTML)

Decorrelated Fast Cipher: an AES Candidate. (PS, Aug 20th, 1998)(Check the Errata Page.) (Extended abstract on DFC published in the proceedings of the first AES workshop.)
This paper gives all materials to define DFC.

Decorrelated Fast Cipher: an AES Candidate. (PS, Aug 20th, 1998)(Check the Errata Page.) (Full report published in the AES CD-ROM 1.)

Decorrelated Fast Cipher: an AES Candidate well suited for low cost smart cards applications. (PS, Sep 14th, 1998) (Draft paper to be published in CARDIS'98.)
Description of the implementation we made of DFC on a very low cost smart card.

Report from Asiacrypt'98. (HTML, Oct 28th, 1998)
This report responses to several criticisms emitted against DFC. It also clearify some implementation problems and achievements.

(External link) Link to the INPI (French National Institute for Industrial Property) (extenal link)
Information on the patent appliance WO9820643 on decorrelation can be found there. The patent has been applied on 04/11/1996 and is being extended through PCT.

Abstract. The invention concerns a method for the cryptography of data recorded on a medium useable by a computing unit in which said computing unit processes an input information x using a key for supplying an information encoded F(x) by a function F. The invention is characterised in that the function F uses a decorrelation module MK such that F(x) = [F'(MK)](x), in which K is a random key and F' a cryptographic function.

Testimony for DFC. (TXT, Jan 26th, 1999)
This (controversial) document has been kindly posted by Robert Harley on the sci.crypt Usenet NewsGroup. (thanks Rob!)

Report on the AES Candidates. (PS, Mar 22nd, 1999) (Paper published in the proceedings of the second AES workshop.)
This paper gives arguments against the AES candidates.

DFC Update. (PS, Mar 23rd, 1999) (Paper published in the proceedings of the second AES workshop.)
This paper reports on the advances about DFC (new implementations, design criteria, next extensions annoucement).

Comparison of the Randomness Provided by Some AES Candidates. (PS, Apr 15th, 1999) (Paper sent to NIST as an official comment for the AES process.)
Compare of several generalized Feistel constructions in term of pseudorandomness and decorrelation. In particular we compare the number of rounds for regular Feistel, Cast256-like and Mars-like schemes.

On Decorrelation and Provable Security (PS, Apr 15th, 1999) (Paper sent to NIST as an official comment for the AES process.)
Feedback on several attacks against decorrelation.

Update of DFC Implementations (PS, Apr 15th, 1999) (Package sent to NIST as an official comment for the AES process.)
This package contains high improvements of the official DFC implementations in CD2.

DFCv2 (To appear in SAC'00.)
This updated version of DFC includes a new key schedule and scalable parameters (round number, block size).

Best Implementations so Far

Original Implementations

External Links

• Ecole Normale Supérieure
• France Telecom R&D
• NIST's AES home page
• Caesar Project (by the UCL Crypto Group)
• The AES Block Cipher Lounge (by Lars Knudsen and Vincent Rijmen)
• Louis Granboulan's tests and benchmarks
• Yiannis Tsioumi's AES booking service (humour)

The AES Candidates

• CAST-256 by Entrust Technologies, Inc. (represented by Carlisle Adams)
• CRYPTON by Future Systems, Inc. (represented by Chae Hoon Lim)
• DEAL by Richard Outerbridge, Lars Knudsen
• DFC by CNRS - Centre National pour la Recherche Scientifique - Ecole Normale Supérieure (represented by Serge Vaudenay)
• E2 by NTT - Nippon Telegraph and Telephone Corporation (represented by Masayuki Kanda)
• FROG by TecApro Internacional S.A. (represented by Dianelos Georgoudis)
• HPC by Rich Schroeppel
• LOKI97 by Lawrie Brown, Josef Pieprzyk, Jennifer Seberry
• MAGENTA by Deutsche Telekom AG (represented by Dr. Klaus Huber)
• MARS by IBM (represented by Nevenko Zunic)
• RC6 by RSA Laboratories (represnted by Matthew Robshaw)
• RIJNDAEL by Joan Daemen, Vincent Rijmen
• SAFER+ by Cylink Corporation (represented by Dr. Lily Chen)
• SERPENT by Ross Anderson, Eli Biham, Lars Knudsen
• TWOFISH by Bruce Schneier, John Kelsey, Doug Whiting, David Wagner, Chris Hall, Niels Ferguson