A Cryptanalytic Time—Memory Trade-Off

IEEE Transactions on Information Theory

Volumn 26, Issue 4, 1980, Pages 401-406

  Hellman, Martin E ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOSYSTEMS;

DATA PROCESSING;

EID: 0019038335     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1980.1056220     Document Type: Article

References (8)

1. R. C. Merkle and M. E. Hellman “Hiding information and signatures in trapdoor knapsacks,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 525–530, Sept. 1978.
2. S. C. Pohlig and M. E. Hellman “An improved algorithm for Computing logarithms over GF(p) and its cryptographic significance,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 106–110, Jan. 1978.
3. W. Diffie and M. E. Hellman “New directions in cryptography,” IEEE Trans. Inform Theory, vol. IT-22, pp. 644–654, Nov. 1976.
4. D. E. Knuth, The Art of Computer Programming, Vol. III: Sorting and Searching. Reading, MA: Addison-Wesley, 1973.
5. W. Diffie and M. E. Hellman “Exhaustive cryptanalysis of the NBS data encryption standard,” Comput., vol. 10, pp. 74–84, June 1977.
6. W. Feller, An Introduction to Probability Theory and Its Applications, 3rd ed. New York: Wiley, 1968.
7. W. Diffie and M. E. Hellman “Privacy and authentication: An introduction to cryptography,” Proc. IEEE, vol. 67, pp. 397–427, Mar. 1979.
8. H. Feistel “Cryptography and computer privacy,” Sci. Amer., vol. 228, pp. 15–23, May 1973.