Success probability of the Hellman trade-off

  • Authors:
  • Daegun Ma;Jin Hong

  • Affiliations:
  • Department of Mathematical Sciences and ISaC-RIM, Seoul National University, Seoul 151-747, Republic of Korea;Department of Mathematical Sciences and ISaC-RIM, Seoul National University, Seoul 151-747, Republic of Korea

  • Venue:
  • Information Processing Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.89

Visualization

Abstract

Cryptanalytic time memory trade-off is a probabilistic algorithm for inverting a generic one-way function. Since its first introduction by Hellman, many variants and their analysis results have appeared. We present a new estimate for the success probability of the original Hellman trade-off, that is more accurate than the lower bound that is widely being used today.