Resistance Against General Iterated Attacks (1998)
| Venue: | In Advances in Cryptology EUROCRYPT'99, Prague, Czech Republic, Lectures Notes in Computer Science 1592 |
| Citations: | 8 - 2 self |
BibTeX
@INPROCEEDINGS{Vaudenay98resistanceagainst,
author = {Serge Vaudenay},
title = {Resistance Against General Iterated Attacks},
booktitle = {In Advances in Cryptology EUROCRYPT'99, Prague, Czech Republic, Lectures Notes in Computer Science 1592},
year = {1998},
pages = {255--271},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. In this paper we study the resistance of a block cipher against any general iterated attack. This class of attacks includes differential and linear cryptanalysis. We prove that we can upper bound the complexity of the attack by using Vaudenay's decorrelation technique. Our main theorem enables to prove the security of some recently proposed block ciphers COCONUT98 and PEANUT98. Since public-key cryptography has been discovered in the late 70s, proving the security of cryptographic protocols has been a challenging problem. Recently, the random oracle model and the generic algorithm techniques have introduced new tools for validating cryptographic algorithms. Although much older, the area of symmetric cryptography did not get so many tools. In the early 90s, Biham and Shamir [2] introduced the notion of differential cryptanalysis and Matsui [7, 8] introduced the notion of linear cryptanalysis, which was a quite general model of attack. Since then many authors tried to formalize these a...
