Decorrelated fast cipher: An AES candidate well suited for low cost smart cards applications

N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Poupard, G., & Vaudenay, S. (2000). Decorrelated fast cipher: An AES candidate well suited for low cost smart cards applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1820, pp. 254–264). Springer Verlag. https://doi.org/10.1007/10721064_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free