An Experimental Study of Time-Memory Trade-Off Cryptanalysis with Hashing

スポンサーリンク

概要

• 論文の詳細を見る

• We examine the key-searching phase of the time-memory trade-off cryptanalysis. We propose some methods using open hashing or closed hashing and evaluate their properties by experiments of time-memory trade-off cryptanalysis with success probability 80% for DES with 56-bit keys and for DES with 40-bit keys. Based on the experiments we have seen that key-searching with precomputed look-up tables can be done within one day with around 500 PCs for DES with 56-bit keys and ten minutes with one PC for DES with 40-bit keys. We also have seen that the open hashing requires smaller RAM size and longer key-searching time. In particular, the smallest RAM size for breaking 56-bit DES can be achieved with open hashing with loading factor a=1 and the shortest key-searching time can be achieved in the closed hashing with loading factor a≈2^<-2>, where the loading factor a is defined as m/n with m : the number of data and n : the number of indices in each hash table.

• 社団法人電子情報通信学会の論文
• 1998-12-12

著者

• Matsumoto Tsutomu

  Division Of Artificial Environment And Systems : Division Of Electrical And Computer Engineering Yok

• Kim Il-Jun

  Division of Electrical and Computer Engineering, Yokohama National University

• Kim Il-jun

  Division Of Electrical And Computer Engineering Yokohama National University

関連論文

• Anonymity Achieved by Group Communication
• Achieving Higher Success Probability in Time-Memory Trade-Off Cryptanalysis without Increasing Memory Size (Special Section on Cryptography and Information Security)
• An Experimental Study of Time-Memory Trade-Off Cryptanalysis with Hashing
• Evaluating Security of a Simple Interactive Human Identification Scheme
• FOREWORD

スポンサーリンク