Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?
Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur GraphSearch.
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
Andrea Felice Caforio, Subhadeep Banik
Serge Vaudenay, Subhadeep Banik, Fatma Betül Durak, Khashayar Barooti