{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:53Z","timestamp":1750307933712,"version":"3.41.0"},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"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":[[2007,6]]},"DOI":"10.1145\/1272729.1272735","type":"journal-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T13:44:55Z","timestamp":1189777495000},"page":"16-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Review of \"Complexity and Cryptography: An Introduction by John Talbot and Dominic Welsh\", Cambridge University Press, 2006, 292 pages"],"prefix":"10.1145","volume":"38","author":[{"given":"J\u00f6rg","family":"Rothe","sequence":"first","affiliation":[{"name":"Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf, D\u00fcsseldorf, Germany"}]}],"member":"320","published-online":{"date-parts":[[2007,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/519078"},{"key":"e_1_2_1_2_1","volume-title":"The Complexity Theory Companion. EATCS Texts in Theoretical Computer Science","author":"Hemaspaandra L.","year":"2002","unstructured":"{HO02} L. Hemaspaandra and M. Ogihara . The Complexity Theory Companion. EATCS Texts in Theoretical Computer Science . Springer-Verlag , Berlin, Heidelberg , New York, 2002 . {HO02} L. Hemaspaandra and M. Ogihara. The Complexity Theory Companion. EATCS Texts in Theoretical Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2002."},{"key":"e_1_2_1_3_1","first-page":"213","volume-title":"Advances in Cryptology --- CRYPTO '04","author":"May A.","year":"2004","unstructured":"{May04} A. May . Computing the RSA secret key is deterministic polynomial time equivalent to factoring . In Advances in Cryptology --- CRYPTO '04 , pages 213 -- 219 . Springer-Verlag Lecture Notes in Computer Science #3152, 2004 . {May04} A. May. Computing the RSA secret key is deterministic polynomial time equivalent to factoring. In Advances in Cryptology --- CRYPTO '04, pages 213--219. Springer-Verlag Lecture Notes in Computer Science #3152, 2004."},{"key":"e_1_2_1_4_1","volume-title":"Computational Complexity","author":"Papadimitriou C.","year":"1994","unstructured":"{Pap94} C. Papadimitriou . Computational Complexity . Addison-Wesley , 1994 . {Pap94} C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994."},{"key":"e_1_2_1_5_1","volume-title":"Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoretical Computer Science","author":"Rothe J.","year":"2005","unstructured":"{Rot05} J. Rothe . Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoretical Computer Science . Springer-Verlag , Berlin, Heidelberg , New York, 2005 . {Rot05} J. Rothe. Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoretical Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2005."},{"key":"e_1_2_1_6_1","volume-title":"Applied Cryptography: Protocols, Algorithms, and Source Code in C","author":"Schneier B.","year":"1996","unstructured":"{Sch96} B. Schneier . Applied Cryptography: Protocols, Algorithms, and Source Code in C . John Wiley and Sons , New York , second edition, 1996 . {Sch96} B. Schneier. Applied Cryptography: Protocols, Algorithms, and Source Code in C. John Wiley and Sons, New York, second edition, 1996."},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","DOI":"10.1201\/9781420057133","volume-title":"Cryptography: Theory and Practice","author":"Stinson D.","year":"2005","unstructured":"{Sti05} D. Stinson . Cryptography: Theory and Practice . CRC Press , Boca Raton , third edition, 2005 . {Sti05} D. Stinson. Cryptography: Theory and Practice. CRC Press, Boca Raton, third edition, 2005."}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1272729.1272735","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1272729.1272735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:03Z","timestamp":1750258323000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1272729.1272735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["10.1145\/1272729.1272735"],"URL":"https:\/\/doi.org\/10.1145\/1272729.1272735","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2007,6]]},"assertion":[{"value":"2007-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}