On the necessity of cryptanalytic exhaustive search

  • Authors:
  • Martin E. Hellman;Ehud D. Karnin;Justin Reyneri

  • Affiliations:
  • Stanford University, Stanford, California;Stanford University, Stanford, California;Stanford University, Stanford, California

  • Venue:
  • ACM SIGACT News - A special issue on cryptography
  • Year:
  • 1983

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is shown that the amount of computation required for a general cryptanalytic method is equivalent to an exhaustive search over the key space. In particular, any general time-memory tradeoff must do an exhaustive search as a part of the pre- or post-computation.