Technical Report CS0817

TR#:CS0817
Class:CS
Title: AN IMPROVEMENT OF DAVIES' ATTACK ON DES.
Authors: E. Biham and A. Biryukov
PDFCS0817.pdf
Abstract:

In this paper we improve Davies' attack [2] on DES to become capable of breaking the full 16-round DES faster than the exhaustive search. Our attack requires 2^{50} complexity of the data collection and 2^{50} the complexity of analysis. An alternative approach finds 24 key bits of DES with 2^{52} known plaintexts and the data analysis requires only several minutes on a SPARC. Therefore, this is the third successful attack on DES, faster than brute force, after differential cryptanalysis [1] and linear cryptanalysis [5]. We also suggest criteria which make the S-boxes immune to this attack.

CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1994/CS/CS0817), rather than to the URL of the PDF or PS files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1994
To the main CS technical reports page

Computer science department, Technion