Decorrelated Fast Cipher: an AES Candidate (1998) [6 citations — 1 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Henri Gilbert and Marc Girault and Philippe Hoogvorst and Fabrice Noilhan and Thomas Pornin and Guillaume Poupard and Jacques Stern and Serge Vaudenay},
title = {Decorrelated Fast Cipher: an AES Candidate},
year = {1998}
}
Bookmarks
OpenURL
Abstract:
. This report presents a response to the call for candidates issued by the National Institute for Standards and Technologies (the Advanced Encryption Standard project). The proposed candidate --- called DFC as for "Decorrelated Fast Cipher" --- is based on Vaudenay's decorrelation technique. This 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. Since the beginning of commercial use of symmetric encryption through block ciphers in the seventies, construction design used to be heuristic-based and security was empiric: a given block cipher was considered to be secure until some researcher published an attack on. The Data Encryption Standard [1] initiated an important open research area, and some important cryptanalysis methods emerged, namely Biham and Shamir's differential cryptanalysis [7] and Matsui 's linear cryptanalysis [13], as well as further gene...
Citations
| 131 | The Security of Cipher Block Chaining – Bellare, Kilian, et al. - 1994 |
| 17 | Strict Evaluation of the Maximum Average of Differential Probability and the Maximum Average of Linear Probability – Aoki, Ohta - 1997 |
