| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428710 | Information Processing Letters | 2009 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
