{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:56:24Z","timestamp":1750308984124,"version":"3.41.0"},"reference-count":13,"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>Some public key distribution systems, based on the difficulties in computing logarithms modulo a large prime, have been alleged to be insecure because of a statement that any logarithm modulo a 200 bit prime can be computed within a reasonable time by means of a subexponential algorithm due to Adleman.In this commentary said algorithm is examined from an algebraic and number-theoretical point of view. The scrutiny shows that the algebraic model for the algorithm contains several traps which seem to be hard to circumvent, and also, not least, that the presupposed abundance of so called round numbers will not be at hand in the computationally interesting cases.Hence it is concluded that the algorithm cannot be a serious threat to the mentioned public key distribution systems.<\/jats:p>","DOI":"10.1145\/1008908.1008916","type":"journal-article","created":{"date-parts":[[2004,10,12]],"date-time":"2004-10-12T15:20:46Z","timestamp":1097594446000},"page":"50-55","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On the feasibility of computing discrete logarithms using Adleman's subexponential algorithm"],"prefix":"10.1145","volume":"15","author":[{"given":"Tore","family":"Herlestam","sequence":"first","affiliation":[{"name":"University of Lund, Lund, Sweden"}]}],"member":"320","published-online":{"date-parts":[[1983,1]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"55","volume-title":"MIT\/LCS, 1979. A shortened and slightly altered version appeared in Proc 20th IEEE Symp on Found of Comp Sci","author":"Adleman L.","year":"1979"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01941467"},{"volume-title":"Oxford","year":"1979","author":"Hardy G. H.","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-13.4.242"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1385-7258(51)50008-2"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1385-7258(66)50029-4"},{"key":"e_1_2_1_7_1","first-page":"1","article-title":"On numbers with small prime divisors","volume":"440","author":"Ennola V.","year":"1969","journal-title":"Ann Acad Sci Fennicae (A) I"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-21.1.102"},{"key":"e_1_2_1_9_1","unstructured":"A. G. Konheim: Cryptography A Primer Wiley New York (1981).   A. G. Konheim: Cryptography A Primer Wiley New York (1981)."},{"key":"e_1_2_1_10_1","first-page":"183","article-title":"A method of factoring and the factorization of F7","volume":"29","author":"Morrison M.","year":"1975","journal-title":"Math Comp"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1981-0595059-1"},{"volume-title":"Intelcon 1979 Exp Proc","year":"1979","author":"Burg J. P.","key":"e_1_2_1_12_1"},{"volume-title":"Intelcon 1979 Exp Proc","year":"1979","author":"Hovden D. B.","key":"e_1_2_1_13_1"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008908.1008916","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1008908.1008916","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.1008916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["10.1145\/1008908.1008916"],"URL":"https:\/\/doi.org\/10.1145\/1008908.1008916","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[1983,1]]},"assertion":[{"value":"1983-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}