Resistance against general iterated attacks

We study the resistance of a block cipher against a class of general attacks which we call “iterated attacks”. This class includes some elementary versions of differential and linear cryptanalysis. We prove that we can upper bound the complexity of the attack by using decorrelation techniques. Our main theorem enables us to prove the security against these attacks (in our model) of some recently proposed block ciphers COCONUT98 and PEANUT98, as well as the AES candidate DFC. We outline that decorrelation to the order 2d is required for proving security against iterated attacks of order d


Published in:
International Conference on the Theory and Applications of Cryptographic Techniques, Advances in Cryptology - EUROCRYPT '99, 1592, 255-271
Presented at:
International Conference on the Theory and Applications of Cryptographic Techniques, Advances in Cryptology - EUROCRYPT '99, Prague, Czech Republic, May 2-6, 1999
Year:
1999
Laboratories:




 Record created 2007-01-18, last modified 2018-03-17

n/a:
Download fulltextPS
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)