<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05722001</id>
  <dt>j</dt>
  <an>05722001</an>
  <augroup>
    <au>Ma, Daegun</au>
    <au>Hong, Jin</au>
  </augroup>
  <ti>Success probability of the Hellman trade-off.</ti>
  <so>Inf. Process. Lett. 109, No. 7, 347-351 (2009).</so>
  <py>2009</py>
  <pu>Elsevier Sciences Publishers (North-Holland), Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>analysis of algorithms</ut>
    <ut>cryptography</ut>
    <ut>time memory trade-off</ut>
    <ut>Hellman table</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.ipl.2008.12.002</li>
  </ligroup>
  <abgroup>
    <ab>Summary: 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.</ab>
    <rv></rv>
  </abgroup>
</item>