{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:11Z","timestamp":1725486071280},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003243"},{"type":"electronic","value":"9783540362883"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36288-6_19","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T16:45:01Z","timestamp":1180889101000},"page":"254-266","source":"Crossref","is-referenced-by-count":12,"title":["A Dedicated Sieving Hardware"],"prefix":"10.1007","author":[{"given":"Willi","family":"Geiselmann","sequence":"first","affiliation":[]},{"given":"Rainer","family":"Steinwandt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"19_CR1","unstructured":"Daniel J. Bernstein. Circuits for Integer Factorization: a Proposal. At the time of writing available electronically at http:\/\/cr.yp.to\/papers.html#nfscircuit , 2001. 254, 256, 257"},{"key":"19_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45539-6_1","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"S. Cavallar","year":"2000","unstructured":"Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter Lioen, Peter L. Montgomery, Brian Murphy, Hermante Riele, Karen Aardal, Je. Gilchrist, G\u00e9rard Guillerm, Paul Leyland, Jo\u00ebl Marchand, Fran\u00e7ois Morain, Alec Muffet, Chris Putnam, Craig Putnam, and Paul Zimmermann. Factorization of a 512-bit RSA Modulus. In Bart Preneel, editor, Advances in Cryptology \u2014 EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 1\u201318. Springer, 2000. 255, 262"},{"issue":"3","key":"19_CR3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/10586458.1996.10504590","volume":"5","author":"M. Elkenbracht-Huizing","year":"1996","unstructured":"Marije Elkenbracht-Huizing. An Implementation of the Number Field Sieve. Experimental Mathematics, 5(3):231\u2013253, 1996. 256","journal-title":"Experimental Mathematics"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Arjen K. Lenstra and Jr. Hendrik W. Lenstra, editors. The development of the number field sieve, volume 1554 of Lecture Notes in Mathematics. Springer, 1993. 255","DOI":"10.1007\/BFb0091534"},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-45539-6_3","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"A. K. Lenstra","year":"2000","unstructured":"Arjen K. Lenstra and Adi Shamir. Analysis and Optimization of the TWINKLE Factoring Device. In Bart Preneel, editor, Advances in Cryptology \u2014 EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 35\u201352. Springer, 2000. 254, 255, 256, 261"},{"key":"19_CR6","unstructured":"Arjen K. Lenstra, Adi Shamir, Jim Tomlinson, and Eran Tromer. Analysis of Bernstein\u2019s Factorization Circuit. At the time of writing available electronically at http:\/\/www.cryptosavvy.com\/mesh.pdf , 2002. 254, 255, 261"},{"issue":"12","key":"19_CR7","first-page":"1473","volume":"43","author":"C. Pomerance","year":"1996","unstructured":"Carl Pomerance. A Tale of Two Sieves. Notices of the AMS, 43(12):1473\u20131485, 1996. 254","journal-title":"Notices of the AMS"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/0217023","volume":"17","author":"C. Pomerance","year":"1988","unstructured":"Carl Pomerance, J. W. Smith, and Randy Tuler. A pipeline architecture for factoring large integers with the quadratic sieve algorithm. SIAM Journal on Computing, 17:387\u2013403, 1988. 254","journal-title":"SIAM Journal on Computing"},{"key":"19_CR9","series-title":"Technical Report","volume-title":"Fast sorting on the instruction systolic array","author":"M. Schimmler","year":"1987","unstructured":"Manfred Schimmler. Fast sorting on the instruction systolic array. Technical Report 8709, Christian Albrecht Universit\u00e4t Kiel, Germany, 1987. 256"},{"key":"19_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-48059-5_2","volume-title":"Cryptographic Hardware and Embedded Systems","author":"A. Shamir","year":"1999","unstructured":"Adi Shamir. Factoring Large Numbers with the TWINKLE Device. In \u00c7etin K. Ko\u00e7 and Christof Paar, editors, Cryptographic Hardware and Embedded Systems. First International Workshop, CHES\u201999, volume 1717 of Lecture Notes in Computer Science, pages 2\u201312. Springer, 1999. 254"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2014 PKC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36288-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T12:56:08Z","timestamp":1556456168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36288-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,18]]},"ISBN":["9783540003243","9783540362883"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-36288-6_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002,12,18]]}}}