Abstract
The development process of the Advanced Encryption Standard (AES) was launched in 1997 by the US government through NIST. The Decorrelated Fast Cipher (DFC) was the CNRS proposal for the AES, among 14 other candidates in 1998. It was based on the recent decorrelation theory, to obtain certain security proofs covering linear and differential cryptanalysis. DFC received numerous comments. In particular, Coppersmith discovered a weakness in the key schedule. We address this weakness by a slight modification on DFC. This paper presents the specifications and rationales of DFC version 2, and discusses issues raised during the AES process.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
O. Baudron, H. Gilbert, L. Granboulan, H. Handschuh, A. Joux, P. Nguyen, F. Noilhan, D. Pointcheval, T. Pornin, G. Poupard, J. Stern, S. Vaudenay. Report on the AES Candidates. In Proceedings from the Second Advanced Encryption Standard Candidate Conference, National Institute of Standards and Technology (NIST), Rome, Italy, March1999.
O. Baudron, H. Gilbert, L. Granboulan, H. Handschuh, R. Harley, A. Joux, P. Nguyen, F. Noilhan, D. Pointcheval, T. Pornin, G. Poupard, J. Stern, S. Vaudenay. DFC Update. In Proceedings from the Second Advanced Encryption Standard Candidate Conference, National Institute of Standards and Technology (NIST), Rome, Italy, March1999.
E. Biham, A. Shamir. Difierential Cryptanalysis of the Data Encryption Standard, Springer-Verlag, 1993.
D. Coppersmith. The Data Encryption Standard (DES) and its Strength against Attacks. IBM Journal of Research and Development, vol. 38, pp. 243–250, 1994.
H. Feistel. Cryptography and computer privacy. Scientific American, vol. 228, pp. 15–23, 1973.
H. Gilbert, M. Girault, P. Hoogvorst, F. Noilhan, T. Pornin, G. Poupard, J. Stern, S. Vaudenay. Decorrelated Fast Cipher: an AES Candidate. (Extended Abstract.) In Proceedings from the First Advanced Encryption Standard Candidate Conference, National Institute of Standards and Technology (NIST), Ventura, California, U.S.A., August 1998.
H. Gilbert, M. Girault, P. Hoogvorst, F. Noilhan, T. Pornin, G. Poupard, J. Stern, S. Vaudenay. Decorrelated Fast Cipher: an AES Candidate. Submitted to the Advanced Encryption Standard process. In CD-ROM “AES CD-1: Documentation”, National Institute of Standards and Technology (NIST), August 1998.
L. Granboulan. AES; Timings of the best known implementations. http://www.di.ens.fr/~granboul/recherche/AES/timings.html
L. R. Knudsen. DEAL-A 128-Bit Block Cipher. Submitted to the Advanced Encryption Standard process. In CD-ROM “AES CD-1: Documentation”, National Institute of Standards and Technology (NIST), August 1998.
L. R. Knudsen, V. Rijmen. On the Decorrelated Fast Cipher (DFC) and Its Theory. In Fast Software Encryption, Roma, Italy, Lectures Notes in Computer Science 1636, pp. 81–94, Springer-Verlag, 1999.
X. Lai. On the Design and Security of Block Ciphers, ETH Series in Information Processing, vol. 1, Hartung-Gorre Verlag Konstanz, 1992.
H. Lipmaa. AES Ciphers: speed http://www.tcm.hut.fi/~helger/aes/
M. Matsui. New Structure of Block Ciphers with Provable Security against Difierential and Linear Cryptanalysis. In Fast Software Encryption, Cambridge, United Kingdom, Lectures Notes in Computer Science 1039, pp. 205–218, Springer-Verlag, 1996.
M. Matsui. New Block Encryption Algorithm MISTY. In Fast Software Encryption, Haifa, Israel, Lectures Notes in Computer Science 1267, pp. 54–68, Springer-Verlag, 1997.
F. Noilhan. Software Optimization of Decorrelation Modules. In Selected Areas in Cryptography, Kingston, Ontario, Canada, Lectures Notes in Computer Science 1758, pp. 175–183, Springer-Verlag, 2000.
K. Nyberg, L. R. Knudsen. Provable Security against a Differential Cryptanalysis. Journal of Cryptology, vol. 8, pp. 27–37, 1995.
G. Poupard, S. Vaudenay. Decorrelated Fast Cipher: an AES Candidate well suited for Low Cost Smart Cards Applications. In CARDIS’ 98, Louvain-la-Neuve, Belgium, Lectures Notes in Computer Science 1820, pp. 254–264, Springer-Verlag, 2000.
B. Preneel et al. Comments by the NESSIE Project on the AES Finalists. Submitted to the Advanced Encryption Standard process, round 2 comments. National Institute of Standards and Technology (NIST), May 2000. http://csrc.nist.gov/encryption/aes/round2/comments/20000524-bpreneel.pdf
R.L. Rivest. The RC5 Encryption Algorithm. In Fast Software Encryption, Leuven, Belgium, Lectures Notes in Computer Science 1008, pp. 86–96, Springer-Verlag, 1995.
S. Vaudenay. Provable Security for Block Ciphers by Decorrelation. Invited talk. In STACS 98, Paris, France, Lectures Notes in Computer Science 1373, pp. 249–275, Springer-Verlag, 1998. Full Paper: technical report LIENS-98-8, Ecole Normale Supérieure, 1998. http://ftp://ftp.ens.fr/pub/reports/liens/
S. Vaudenay. Feistel Ciphers with L2-Decorrelation. In Selected Areas in Cryptography, Kingston, Ontario, Canada, Lectures Notes in Computer Science 1556, pp. 1–14, Springer-Verlag, 1999.
S. Vaudenay. Resistance Against General Iterated Attacks. In Advances in Cryptology EUROCRYPT’99, Prague, CzechRepublic, Lectures Notes in Computer Science 1592, pp. 255–271, Springer-Verlag, 1999.
S. Vaudenay. On the Lai-Massey Scheme.
S. Vaudenay. Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness. In Selected Areas in Cryptography, Kingston, Ontario, Canada, Lectures Notes in Computer Science 1758, pp. 49–61, Springer-Verlag, 2000.
S. Vaudenay. On Provable Security for Conventional Cryptography. Invited talk. (To appear in the proceedings of ICISC’ 99, LNCS, Springer-Verlag.)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Granboulan, L., Nguyen, P.Q., Noilhan, F., Vaudenay, S. (2001). DFCv2. In: Stinson, D.R., Tavares, S. (eds) Selected Areas in Cryptography. SAC 2000. Lecture Notes in Computer Science, vol 2012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44983-3_5
Download citation
DOI: https://doi.org/10.1007/3-540-44983-3_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42069-9
Online ISBN: 978-3-540-44983-6
eBook Packages: Springer Book Archive