Product Style Approximation Cryptanalysis of DES
-
- TERASHIMA Akihisa
- Department of Electrical Engineering, Science University of Tokyo
-
- KANEKO Toshinobu
- Department of Electrical Engineering, Science University of Tokyo
Bibliographic Information
- Other Title
-
- DES暗号の積近似解読法
Search this article
Abstract
The linear cryptanalysis proposed by Matsui is a powerful known-plaintext attack against DES. We propose a cryptanalytic method for DES where the approximation is extended to product style. The number of known-plaintexts required of the analysis algorithm in this paper depend on the number of unknown key-bits in a product approximation and the effectiveness of it. If unknown key-bits are relatively fewer, this method is more effective than the linear cryptanalysis. For example, 8-round DES is breakable with 1.66×10^6 known-plaintexts. Required known-plaintexts are reduced to around 3/4 of that for the linear cryptanalysis.
Journal
-
- Technical report of IEICE. ISEC
-
Technical report of IEICE. ISEC 96 (237), 67-77, 1996-09-06
The Institute of Electronics, Information and Communication Engineers
- Tweet
Details 詳細情報について
-
- CRID
- 1570009752433291904
-
- NII Article ID
- 110003296910
-
- NII Book ID
- AN10060811
-
- Text Lang
- ja
-
- Data Source
-
- CiNii Articles
