Attacking Triple Encryption


Lucks, Stefan


URL: http://dx.doi.org/10.1007/3-540-69710-1_16
Document Type: Conference or workshop publication
Year of publication: 1998
Book title: Fast software encryption : 5th international workshop, FSE'98, Paris, France, March 23 - 25, 1998; proceedings
The title of a journal, publication series: Lecture Notes in Computer Science
Volume: 1372
Page range: 239-253
Author/Publisher of the book
(only the first ones mentioned)
:
Vaudenay, Serge
Place of publication: Berlin [u.a.]
Publishing house: Springer
ISBN: 3-540-64265-X
Publication language: English
Institution: School of Business Informatics and Mathematics > Theoretische Informatik (Krause)
Subject: 004 Computer science, internet
Abstract: The standard technique to attack triple encryption is the meet-in-the-middle attack. In this paper, more efficient attacks are presented. Compared to meet-in-the-middle, our attacks either greatly reduce the number of single encryptions to be done, or somewhat reduce the overall number of steps. Especially, about $2^{108}$ steps of computation are sufficient to break three-key triple DES. If one concentrates on the number of single DES operations and assumes the other operations to be much faster, $2^{90}$ of these are enough. We use this to compare the security of triple DES and DESX.

Dieser Eintrag ist Teil der Universitätsbibliographie.




+ Citation Example and Export

Lucks, Stefan Attacking Triple Encryption. Vaudenay, Serge Lecture Notes in Computer Science 1372 239-253 In: Fast software encryption : 5th international workshop, FSE'98, Paris, France, March 23 - 25, 1998; proceedings (1998) Berlin [u.a.] [Conference or workshop publication]


+ Search Authors in

BASE: Lucks, Stefan

Google Scholar: Lucks, Stefan

+ Page Views

Hits per month over past year

Detailed information



You have found an error? Please let us know about your desired correction here: E-Mail


Actions (login required)

Show item Show item