A Comparison of Perfect Table Cryptanalytic Tradeoff Algorithms

@article{Lee2012ACO,
  title={A Comparison of Perfect Table Cryptanalytic Tradeoff Algorithms},
  author={Ga Won Lee and Jin Hong},
  journal={IACR Cryptology ePrint Archive},
  year={2012},
  volume={2012},
  pages={540}
}
Analyses of three major time memory tradeoff algorithms were presented by a recent paper in such a way that facilitates comparisons of the algorithm performances at arbitrary choices of the algorithm parameters. The algorithms considered there were the classical Hellman tradeoff and the non-perfect table versions of the distinguished point method and the rainbow table method. This paper adds the perfect table versions of the distinguished point method and the rainbow table method to the list… CONTINUE READING
9 Extracted Citations
19 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 19 references

The cost of false alarms in Hellman and rainbow tradeoffs

  • J. Hong
  • Des. Codes Cryptogr
  • 2010
Highly Influential
8 Excerpts

Block Ciphers: Design, Analysis, and Side-Channel Analysis

  • J. Borst
  • Ph.D. Thesis,
  • 2001
Highly Influential
8 Excerpts

On the time-memory tradeoff between exhaustive key search and table precomputation

  • J. Borst, B. Preneel, J. Vandewalle
  • Proceedings of the 19th Symposium on Information…
  • 1998
Highly Influential
7 Excerpts

Analysis of the parallel distinguished point tradeoff , in Progress in Cryptology — INDOCRYPT 2011

  • G. W. Lee J. Hong, D. Ma
  • LNCS
  • 2010

Similar Papers

Loading similar papers…