{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T23:58:27Z","timestamp":1740095907029,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642054433"},{"type":"electronic","value":"9783642054457"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05445-7_11","type":"book-chapter","created":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T10:03:23Z","timestamp":1257242603000},"page":"170-181","source":"Crossref","is-referenced-by-count":2,"title":["Optimization Strategies for Hardware-Based Cofactorization"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Loebenberger","sequence":"first","affiliation":[]},{"given":"Jens","family":"Putzka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Text (1957)"},{"key":"11_CR2","volume-title":"A course in computational algebraic number theory","author":"H. Cohen","year":"1997","unstructured":"Cohen, H.: A course in computational algebraic number theory. Springer, Berlin (1997)"},{"key":"11_CR3","unstructured":"Franke, J., Kleinjung, T.: RSA 640 (2005), \n                    \n                      http:\/\/www.crypto-world.com\/announcements\/rsa640.txt"},{"key":"11_CR4","unstructured":"Franke, J., Kleinjung, T.: Continued Fractions and Lattice Sieving (Unpublished) (2006), \n                    \n                      http:\/\/www.math.uni-bonn.de\/people\/thor\/confrac.ps"},{"key":"11_CR5","unstructured":"von zur Gathen, J., G\u00fcneysu, T., Kargl, A., Loebenberger, D., Paar, C., Putzka, J.: Faktorisierung gro\u00dfer Zahlen: Hardware f\u00fcr Elliptische Kurven Faktorisierung. Technical report, HGI Bochum, b-it Bonn & Siemens AG M\u00fcnchen (2007)"},{"key":"11_CR6","unstructured":"Kleinjung, T.: Cofactorisation Strategies for the Number Field Sieve and an Estimate for the Sieving Step for Factoring 1024-bit Integers (Unpublished) (2004), \n                    \n                      http:\/\/www.math.uni-bonn.de\/people\/thor\/cof.ps"},{"issue":"256","key":"11_CR7","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1090\/S0025-5718-06-01870-9","volume":"75","author":"T. Kleinjung","year":"2006","unstructured":"Kleinjung, T.: On Polynomial Selection for the General Number Field Sieve. Mathematics of Computation\u00a075(256), 2037\u20132047 (2006), \n                    \n                      http:\/\/dx.doi.org\/10.1090\/S0025-5718-06-01870-9","journal-title":"Mathematics of Computation"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/11894063_9","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"S. Kumar","year":"2006","unstructured":"Kumar, S., Paar, C., Pelzl, J., Pfeiffer, G., Schimmler, M.: Breaking ciphers with COPACOBANA \u2013A Cost-Optimized Parallel Code Breaker. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol.\u00a04249, pp. 101\u2013118. Springer, Heidelberg (2006), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/11894063_9"},{"key":"11_CR9","series-title":"Lecture Notes in Mathematics","volume-title":"The development of the number field sieve","year":"1993","unstructured":"Lenstra, A.K., Lenstra Jr., H.W. (eds.): The development of the number field sieve. Lecture Notes in Mathematics, vol.\u00a01554. Springer, Berlin (1993)"},{"key":"11_CR10","doi-asserted-by":"crossref","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra","year":"1987","unstructured":"Lenstra Jr., H.W.: Factoring integers with elliptic curves. Annals of Mathematics\u00a0126, 649\u2013673 (1987)","journal-title":"Annals of Mathematics"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1017\/S0305004100049252","volume":"76","author":"J.M. Pollard","year":"1974","unstructured":"Pollard, J.M.: Theorems on factorization and primality testing. Proceedings of the Cambridge Philosophical Society\u00a076, 521\u2013528 (1974)","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"11_CR12","unstructured":"RSA Laboratories. The RSA Challenge Numbers (2007)"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05445-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T11:35:28Z","timestamp":1580297728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05445-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642054433","9783642054457"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05445-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}