{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T13:31:49Z","timestamp":1773322309295,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540491125","type":"print"},{"value":"9783540491149","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11927587_12","type":"book-chapter","created":{"date-parts":[[2006,11,8]],"date-time":"2006-11-08T00:12:43Z","timestamp":1162944763000},"page":"118-135","source":"Crossref","is-referenced-by-count":8,"title":["A Simpler Sieving Device: Combining\u00a0ECM\u00a0and\u00a0TWIRL"],"prefix":"10.1007","author":[{"given":"Willi","family":"Geiselmann","sequence":"first","affiliation":[]},{"given":"Fabian","family":"Januszewski","sequence":"additional","affiliation":[]},{"given":"Hubert","family":"K\u00f6pfer","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Pelzl","sequence":"additional","affiliation":[]},{"given":"Rainer","family":"Steinwandt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"201","key":"12_CR1","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1090\/S0025-5718-1993-1140645-1","volume":"60","author":"A. Oliver","year":"1993","unstructured":"Oliver, A., Atkin, L., Morain, F.: Finding suitable curves for the elliptic curve method of factorization. Mathematics of Computation\u00a060(201), 399\u2013405 (1993)","journal-title":"Mathematics of Computation"},{"key":"12_CR2","unstructured":"Bernstein, D.J.: Circuits for Integer Factorization: a Proposal (2001), At the time of writing available electronically at: \n                    \n                      http:\/\/cr.yp.to\/papers\/nfscircuit.pdf"},{"key":"12_CR3","unstructured":"Brent, R.P.: Factorization of the tenth and eleventh Fermat Numbers. Computer Science Laboratory, Australian National Univ., Canberra, Report TR-CS-96-02:1\u201325 (1996)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11545262_9","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"J. Franke","year":"2005","unstructured":"Franke, J., Kleinjung, T., Paar, C., Pelzl, J., Priplata, C., Stahlke, C.: SHARK: A Realizable Special Hardware Sieving Device for Factoring 1024-Bit Integers. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 119\u2013130. Springer, Heidelberg (2005)"},{"key":"12_CR5","volume-title":"Proceedings of ITCC 2005 \u2013 Track on Embedded Cryptographic Systems","author":"W. Geiselmann","year":"2005","unstructured":"Geiselmann, W., K\u00f6pfer, H., Steinwandt, R., Tromer, E.: Improved Routing-Based Linear Algebra for the Number Field Sieve. In: Proceedings of ITCC 2005 \u2013 Track on Embedded Cryptographic Systems. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/11545262_10","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"W. Geiselmann","year":"2005","unstructured":"Geiselmann, W., Shamir, A., Steinwandt, R., Tromer, E.: Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol.\u00a03659, pp. 131\u2013146. Springer, Heidelberg (2005)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-36288-6_19","volume-title":"Public Key Cryptography - PKC 2003","author":"W. Geiselmann","year":"2002","unstructured":"Geiselmann, W., Steinwandt, R.: A Dedicated Sieving Hardware. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 254\u2013266. Springer, Heidelberg (2002)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-45238-6_5","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"W. Geiselmann","year":"2003","unstructured":"Geiselmann, W., Steinwandt, R.: Hardware for Solving Sparse Systems of Linear Equations over GF(2). In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 51\u201361. Springer, Heidelberg (2003)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-24660-2_22","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"W. Geiselmann","year":"2004","unstructured":"Geiselmann, W., Steinwandt, R.: Yet Another Sieving Device. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 278\u2013291. Springer, Heidelberg (2004)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/11604938_18","volume-title":"Information Security Applications","author":"T. Izu","year":"2006","unstructured":"Izu, T., Kunihiro, N., Ohta, K., Shimoyama, T.: Analysis on the Clockwise Transposition Routing for Dedicated Factoring Devices. In: Song, J.-S., Kwon, T., Yung, M. (eds.) WISA 2005. LNCS, vol.\u00a03786, pp. 232\u2013242. Springer, Heidelberg (2006)"},{"key":"12_CR11","unstructured":"Januszewski, F.: Ein dedizierter Faktorisierungsalgorithmus auf Basis elliptischer Kurven. Diplomarbeit, Universit\u00e4t Karlsruhe (Germany), Fakult\u00e4t f\u00fcr Informatik, Institut f\u00fcr Algorithmen und Kognitive Systeme (2005)"},{"key":"12_CR12","unstructured":"RSA Laboratories. The RSA Challenge Numbers, \n                    \n                      http:\/\/www.rsasecurity.com\/rsalabs\/node.asp?id=2093"},{"key":"12_CR13","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, Heidelberg (1993)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36178-2_1","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"A.K. Lenstra","year":"2002","unstructured":"Lenstra, A.K., Shamir, A., Tomlinson, J., Tromer, E.: Analysis of Bernstein\u2019s Factorization Circuit. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 1\u201326. Springer, Heidelberg (2002)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-40061-5_4","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"A.K. Lenstra","year":"2003","unstructured":"Lenstra, A.K., Tromer, E., Shamir, A., Kortsmit, W., Dodson, B., Hughes, J., Leyland, P.C.: Factoring Estimates for a 1024-Bit RSA Modulus. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 55\u201374. Springer, Heidelberg (2003)"},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra","year":"1987","unstructured":"Lenstra, H.W.: Factoring Integers with Elliptic Curves. Annals of Mathematics\u00a0126(2), 649\u2013673 (1987)","journal-title":"Annals of Mathematics"},{"key":"12_CR17","volume-title":"Handbook of Applied Cryptography","author":"A.J. Menezes","year":"1997","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)"},{"issue":"170","key":"12_CR18","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular Multiplication without Trial Division. Mathematics of Computation\u00a044(170), 519\u2013521 (1985)","journal-title":"Mathematics of Computation"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"P.L. Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding up the Pollard and elliptic curve methods of factorization. Mathematics of Computation\u00a048, 243\u2013264 (1987)","journal-title":"Mathematics of Computation"},{"issue":"1","key":"12_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1049\/ip-ifs:20055018","volume":"152","author":"J. Pelzl","year":"2005","unstructured":"Pelzl, J., \u0160imka, M., Kleinjung, T., Franke, J., Priplata, C., Stahlke, C., Drutarovsk\u00fd, M., Fischer, V., Paar, C.: Area-Time Efficient Hardware Architecture for Factoring Integers with the Elliptic Curve Method. IEE Proceedings Information Security\u00a0152(1), 67\u201378 (2005)","journal-title":"IEE Proceedings Information Security"},{"key":"12_CR21","first-page":"331","volume":"15","author":"J.M. Pollard","year":"1975","unstructured":"Pollard, J.M.: A Monte Carlo Method for Factorization. Nordisk Tidskrift for Informationsbehandlung (BIT)\u00a015, 331\u2013334 (1975)","journal-title":"Nordisk Tidskrift for Informationsbehandlung (BIT)"},{"key":"12_CR22","unstructured":"Pomerance, C.: A Tale of Two Sieves. Notices of the ACM, 1473\u20131485 (December 1996)"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45146-4_1","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"A. Shamir","year":"2003","unstructured":"Shamir, A., Tromer, E.: Factoring Large Numbers with the TWIRL Device. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 1\u201326. Springer, Heidelberg (2003)"},{"issue":"9","key":"12_CR24","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1109\/TC.2003.1228516","volume":"52","author":"A.F. Tenca","year":"2003","unstructured":"Tenca, A.F., Ko\u00e7, \u00c7.K.: A Scalable Architecture for Modular Multiplication Based on Montgomery\u2019s Algorithm. IEEE Trans. Comput.\u00a052(9), 1215\u20131221 (2003)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11927587_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:46:44Z","timestamp":1619495204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11927587_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540491125","9783540491149"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11927587_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}