The full cost of cryptanalytic attacks

Journal of Cryptology

Volumn 17, Issue 2, 2004, Pages 105-124

  Wiener, Michael J ^a  

^a NONE   (Canada)

Author keywords

Cryptanalysis; Discrete logarithm; Double encryption; Factoring; Hash collision; Meet in the middle attack; Number field sieve; Parallel collision search; Triple encryption

Indexed keywords

CRYPTANALYSIS; DISCRETE LOGARITHM; FACTORING; NUMBER FIELD SIEVE; PARALLEL COLLISION SEARCH;

ALGORITHMS; COMMUNICATION SYSTEMS; COMPUTER HARDWARE; COSTS; DATA STORAGE EQUIPMENT; LOGIC GATES; PERSONAL COMPUTERS;

CRYPTOGRAPHY;

EID: 4344660706     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-003-0213-5     Document Type: Article

References (23)

1. H.R. Amirazizi and M.E. Hellman, Time-Memory-Processor Trade-Offs, IEEE Transactions on Information Theory, vol. IT-34, no. 3 (1988), pp. 505-512.
2. D. Bernstein, Circuits for Integer Factorization: A Proposal, Manuscript, Nov. 2001, available at http://cr.yp.to/nfscircuit.ps.
3. D. Coppersmith, Solving Homogeneous Linear Equations over GF(2) via Block Wiedemann Algorithm, Mathematics of Computation, vol. 62, no. 205 (Jan. 1994), pp. 333-350.
4. W. Diffie and M. Hellman, Exhaustive Cryptanalysis of the NBS Data Encryption Standard, Computer, vol. 10, no. 6 (June 1977), pp. 74-84.
5. H. Handschuh and B. Preneel, On the Security of Double and 2-Key Triple Modes of Operation, Fast Software Encryption '99, 6th International Workshop (LNCS 1636), Springer-Verlag, Berlin, 1999, pp. 215-230.
6. M.E. Hellman, A Cryptanalytic Time-Memory Trade-Off, IEEE Transactions on Information Theory, vol. IT-26 (1980), pp. 401-406.
7. D.E. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching, second edition, Addison-Wesley, Reading, MA, 1998.
8. A.K. Lenstra and H.W. Lenstra, Jr. (eds.), The Development of the Number Field Sieve (Lecture Notes in Mathematics 1554), Springer-Verlag, Berlin, 1993.
9. A.K. Lenstra, A. Shamir, J. Tomlinson, and E. Tromer, Analysis of Bernstein's Factorization Circuit, Advances in Cryptology - Asiacrypt 2002 (LNCS 2501), Springer-Verlag, Berlin, 2002, pp. 1-26.
10. S. Lucks, Attacking Triple Encryption, Fast Software Encryption '98, 5th International Workshop (LNCS 1372), Springer-Verlag, Berlin, 1998, pp. 239-253.
11. A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton, FL, 1997.
12. R. Merkle and M. Hellman, On the Security of Multiple Encryption, Communications of the ACM, vol. 24, no. 7 (July 1981), pp. 465-467. See also Communications of the ACM, vol. 24, no. 11 (Nov. 1981), p. 776.
13. R. Merkle and M. Hellman, On the Security of Multiple Encryption, Communications of the ACM, vol. 24, no. 7 (July 1981), pp. 465-467. See also Communications of the ACM, vol. 24, no. 11 (Nov. 1981), p. 776.
14. P.L. Montgomery, A Block Lanczos Algorithm for Finding Dependencies over GF(2), Advances in Cryptohgy - Eurocrypt'95 (LNCS 925), Springer-Verlag, Berlin, 1995, pp. 106-120.
15. S.C. Pohlig and M.E. Hellman, An Improved Algorithm for Computing Discrete Logarithms over GF(p) and Its Cryptographic Significance, IEEE Transactions on Information Theory, vol. IT-24 (1978), pp. 106-110.
16. J.M. Pollard, Monte Carlo Methods for Index Computation (mod p), Mathematics of Computation, vol. 32, no. 143 (July 1978), pp. 918-924.
17. A.L. Rosenberg, Three-Dimensional VLSI: A Case Study, Journal of the ACM, vol. 30 (1983), pp. 397-416.
18. V. Shoup, Lower Bounds for Discrete Logarithms and Related Problems, Advances in Cryptology - Eurocrypt '97 (LNCS 1233), Springer-Verlag, Berlin, 1997, pp. 256-266.
19. E. Teske, Speeding Up Pollard's Rho Method for Computing Discrete Logarithms, Algorithmic Number Theory Symposium III (LNCS 1423), Springer-Verlag, Berlin, 1998, pp. 541-554.
20. E. Tromer, Personal communication.
21. P.C. van Oorschot and M.J. Wiener, A Known-Plaintext Attack on Two-Key Triple Encryption, Advances in Cryptology - Eurocrypt'90 (LNCS 473), Springer-Verlag, Berlin, 1990, pp. 318-325.
22. P.C. van Oorschot and M.J. Wiener, Parallel Collision Search with Cryptanalytic Applications, Journal of Cryptology, vol. 12, no. 1 (1999), pp. 1-28.
23. P.M.B. Vitányi, Locality, Communication and Interconnect Length in Multicomputers, SIAM Journal on Computing, vol. 17 (1988), pp. 659-672.