{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T11:38:00Z","timestamp":1777030680003,"version":"3.51.4"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[1983,1]]},"abstract":"<jats:p>It is shown that the amount of computation required for a general cryptanalytic method is equivalent to an exhaustive search over the key space. In particular, any general time-memory tradeoff must do an exhaustive search as a part of the pre- or post-computation.<\/jats:p>","DOI":"10.1145\/1008908.1008914","type":"journal-article","created":{"date-parts":[[2004,10,12]],"date-time":"2004-10-12T15:20:46Z","timestamp":1097594446000},"page":"40-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["On the necessity of cryptanalytic exhaustive search"],"prefix":"10.1145","volume":"15","author":[{"given":"Martin E.","family":"Hellman","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, California"}]},{"given":"Ehud D.","family":"Karnin","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, California"}]},{"given":"Justin","family":"Reyneri","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, California"}]}],"member":"320","published-online":{"date-parts":[[1983,1]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"26","article-title":"A Cryptanalytic Time-Memory Tradeoff","author":"Hellman M. E.","year":"1980","journal-title":"IEEE Trans. Inform. Theory"},{"key":"e_1_2_1_2_1","unstructured":"W. Feller An Introduction to Probability Theory and Its Applications 3rd ed. New York: Wiley 1968.  W. Feller An Introduction to Probability Theory and Its Applications 3rd ed. New York: Wiley 1968."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1979.11256"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"e_1_2_1_5_1","first-page":"23","article-title":"An Extension to the Shannon Theory Approach to Cryptography","author":"Hellman M. E.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"e_1_2_1_6_1","first-page":"16","article-title":"On the Difficulty of Computations","author":"Chaitin G.","year":"1970","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008908.1008914","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1008908.1008914","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:41:08Z","timestamp":1750282868000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008908.1008914"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["10.1145\/1008908.1008914"],"URL":"https:\/\/doi.org\/10.1145\/1008908.1008914","relation":{},"ISSN":["0163-5700"],"issn-type":[{"value":"0163-5700","type":"print"}],"subject":[],"published":{"date-parts":[[1983,1]]},"assertion":[{"value":"1983-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}