Decorrelated Fast cipher : An AES candidate well suited for low cost smart cards applications
Guillaume Poupard, Serge Vaudenay · 2000
. In response to the call for candidates issued by the National Institute for Standards and Technologies (the Advanced Encryption Standard project) we propose a candidate called DFC as for "Decorrelated Fast Cipher", based on Vaudenay's decorrelation technique that provides provable security against several classes of attacks which include 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 processor based computers. In this paper, we describe the implementation we made of DFC on a very low cost smart card. The performances we obtain proves that DFC is also well suited for low cost devices applications. This paper appears in CARDIS '98, LNCS ????, Springer Verlag, p.???-???, 1998 Since the beginning of commercial use of symmetric encryption through block ciphers in the seventies, construction design used to be heuristic-b...