Achieving Higher Success Probability in Time-Memory Trade-Off Cryptanalysis without Increasing Memory Size (Special Section on Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• The time-memory trade-off cryptanalysis for block ciphers with a search space of size 2^N (N: key length) cannot achieve a success probability exceeding 63%. This is caused by some unavoidable overlapping of keys in the space. For elavating the success probability of finding the correct key, a larger search space is necessary. That is, the increase of time complexity for precomputation would be inevitable. This paper theoretically shows, however, no further price is required for the size of look-up tables for the number of encryptions for searching for the key that matches the given ciphertext - plaintext pairs. This theory is confirmed by some empilical results.

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

著者

• Matsumoto Tsutomu

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

• Kim I‐j

  Division Of Electrical And Computer Engineering Yokohama National University

• Kim Il-Jun

  Division of Electrical and Computer Engineering, Yokohama National University

• Kim Il-jun

  Division Of Electrical And Computer Engineering Yokohama National University

• Matsumoto Tsutomu

  Division Of Artificial Environment And Systems 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

スポンサーリンク