| TR#: | CS0890 |
| Class: | CS |
| Title: | Cryptanalysis of Ladder-DES |
| Authors: | Eli Biham |
| CS0890.pdf | |
| Abstract: | Feistel ciphers are very common and very important in the design and
analysis of blockciphers, especially due to four reasons:
(1)~Many (DES-like) ciphers are based on Feistel's construction.
(2)~Luby and Rackoff proved the security of a four-round Feistel
construction when the round functions are random.
(3)~Recently several provably secure ciphers were suggested, which use
other (assumed secure) ciphers as the round function.
(4)~Other such ciphers use this construction as attempts to improve the
security of other ciphers (e.g., to improve the security of DES).
In this paper we cryptanalyze Ladder-DES, a four-rounds Feistel cipher using DES in the round function, and show that its security is smaller than expected. |
| Copyright | The 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/1997/CS/CS0890), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1997
To the main CS technical reports page