Abstract
In response to the call for candidates issued by the National Institute for Standards and Technologies (the Advanced Encryption Standard project) the Ecole Normale Supérieure proposed a candidate called DFC as for “Decorrelated Fast Cipher”, based on the decorrelation technique that provides provable security against several classes of attacks (in particular the basic version of Biham and Shamir’s Differential Cryptanalysis as well as Matsui’s Linear Cryptanalysis). From a practical point of view, this algorithm is naturally very efficient when it is implemented on 64-bit processors. In this paper, we describe the implementation we made of DFC on a very low cost smart card based on the Motorola 6805 processor. The performances we obtain prove that DFC is also well suited for low cost devices applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Data Encryption Standard. Federal Information Processing Standard Publication 46, U. S. National Bureau of Standards (1977)
DES Modes of Operation. Federal Information Processing Standard Publication 81, U. S. National Bureau of Standards (1980)
Aoki, K., Ohta, K.: Strict evaluation of the maximum average of differential probability and the maximum average of linear probability. IEICE Transactions on Fundamentals E80-A, 1–8 (1997)
Biham, E., Shamir, A.: Differential Cryptanalysis of the Data Encryption Standard. Springer, Heidelberg (1993)
Feistel, H.: Cryptography and computer privacy. Scientific American 228, 15–23 (1973)
Gilbert, H., Girault, M., Hoogvorst, P., Noilhan, F., Pornin, T., Poupard, G., Stern, J., Vaudenay, S.: Decorrelated Fast Cipher: an AES Candidate. Submitted to the call for candidate for the Advanced Encryption Standard issued by the National Institute of Standards and Technology
Baudron, O., Gilbert, H., Granboulan, L., Handschuh, H., Harley, R., Joux, A., Nguyen, P., Noilhan, F., Pointcheval, D., Pornin, T., Poupard, G., Stern, J., Vaudenay, S.: DFC Update. In: Proceedings from the Second Advanced Encryption Standard Candidate Conference, National Institute of Standards and Technology (1999)
Jakobsen, T., Knudsen, L.R.: The interpolation attack on block ciphers. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 28–40. Springer, Heidelberg (1997)
Kocher, P.C.: Timing attacks on implementations of diffie-hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104–113. Springer, Heidelberg (1996)
Knudsen, L.R., Preneel, B.: Fast and secure hashing based on codes. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 485–498. Springer, Heidelberg (1997)
Matsui, M.: The first experimental cryptanalysis of the data encryption standard. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 1–11. Springer, Heidelberg (1994)
Matsui, M.: New structure of block ciphers with provable security against differential and linear cryptanalysis. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 205–218. Springer, Heidelberg (1996)
Matsui, M.: New block encryption algorithm MISTY. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 54–68. Springer, Heidelberg (1997)
Nyberg, K., Knudsen, L.R.: Provable security against a differential cryptanalysis. Journal of Cryptology 8, 27–37 (1995)
Vaudenay, S.: Provable security for block ciphers by decorrelation. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 249–275. Springer, Heidelberg (1998)
Vaudenay, S.: The decorrelation technique home-page, http://www.dmi.ens.fr/~vaudenay/decorrelation.html
Vaudenay, S.: Adaptive-Attack Norm for Decorrelation and Super- Pseudorandomness. Tech. report LIENS-99-2, Ecole Normale Supérieure (1999)
Vaudenay, S.: On the Lai-Massey Scheme. Tech. report LIENS-99-3, Ecole Normale Supérieure (1999)
Vaudenay, S.: Resistance against general iterated attacks. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 255. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poupard, G., Vaudenay, S. (2000). Decorrelated Fast Cipher: An AES Candidate Well Suited for Low Cost Smart Cards Applications. In: Quisquater, JJ., Schneier, B. (eds) Smart Card Research and Applications. CARDIS 1998. Lecture Notes in Computer Science, vol 1820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10721064_24
Download citation
DOI: https://doi.org/10.1007/10721064_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67923-3
Online ISBN: 978-3-540-44534-0
eBook Packages: Springer Book Archive