The Full Cost of Cryptanalytic Attacks

  title={The Full Cost of Cryptanalytic Attacks},
  author={Michael J. Wiener},
  journal={Journal of Cryptology},
An open question about the asymptotic cost of connecting many processors to a large memory using three dimensions for wiring is answered, and this result is used to find the full cost of several cryptanalytic attacks. In many cases this full cost is higher than the accepted complexity of a given algorithm based on the number of processor steps. The full costs of several cryptanalytic attacks are determined, including Shanks’ method for computing discrete logarithms in cyclic groups of prime… CONTINUE READING
Highly Cited
This paper has 41 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 26 extracted citations


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

Circuits for Integer Factorization: A Proposal, Manuscript, Nov. 2001, available at

  • D. Bernstein
  • 2001
Highly Influential
7 Excerpts

Hellman, Time-Memory-Processor Trade-Offs

  • M.E.H.R. Amirazizi
  • IEEE Transactions on Information Theory, vol. IT…
  • 1988
Highly Influential
11 Excerpts

Similar Papers

Loading similar papers…