New Proposal and Comparison of Closure Tests : More Efficient than the CRYPTO'92 Test for DES (Special Section on Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• The well-known closure tests, the cycling closure test (CCT) and the meet-in-the-middle closure test (MCT), were introduced by Kaliski, Rivest and Sherman to analyze the algebraic properties of cryptosystems, and CCT indicates that DES [3] is not closed [4]. Though Coppersmith presented that DES can be proved not to be closed by a particular way [2], the closure tests can check various kinds of cryptosystems generally. Thus, successors to MCT and CCT have been proposed at CRYPTO [6],[1]. This paper expands the MCT successor, the switching closure test (SCT) [6], to apply to the DES-like cryptosystems, and shows that this SCT variant is more efficient than the closure test proposed at CRYPTO'92 [1], because the SCT variant establishes a better relationship between the computation cost and the probability of error (the evaluation index). The MCT successors are more important than the CCTs, because the MCTs can directly break closed cryptosystems. Therefore, if you want to detect the closure property of cryptosystems generally, the SCT variant is better.

• 社団法人電子情報通信学会の論文
• 1994-01-25

著者

• Morita Hikaru

  Ntt Network Information Systems Laboratories

• Ohta Kazuo

  NTT Network Information Systems Laboratories

関連論文

• New Proposal and Comparison of Closure Tests : More Efficient than the CRYPTO'92 Test for DES (Special Section on Cryptography and Information Security)
• Message Authentication Codes and Differential Attack (Special Section on Cryptography and Information Security)
• Interactive Bi-proof Systems and Undeniable Signature Schemes
• A Modular-Multiplication Algorithm Using Lookahead Determination (Special Section on Cryptography and Information Security)

スポンサーリンク