{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:44:05Z","timestamp":1725486245672},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438632"},{"type":"electronic","value":"9783540454557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45455-1_37","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T01:07:47Z","timestamp":1181610467000},"page":"475-490","source":"Crossref","is-referenced-by-count":2,"title":["Factoring N = pq 2 with the Elliptic Curve Method"],"prefix":"10.1007","author":[{"given":"Peter","family":"Ebinger","sequence":"first","affiliation":[]},{"given":"Edlyn","family":"Teske","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"1701","DOI":"10.1090\/S0025-5718-96-00775-2","volume":"65","author":"E. Bach","year":"1996","unstructured":"E. Bach and R. Peralta. Asymptotic semismoothness probabilities. Mathematics of Computation, 65:1701\u20131715, 1996.","journal-title":"Mathematics of Computation"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01933190","volume":"20","author":"R. P. Brent","year":"1980","unstructured":"R. P. Brent. An improved Monte Carlo factorization algorithm. BIT, 20:176\u2013184, 1980.","journal-title":"BIT"},{"key":"37_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1993","unstructured":"H. Cohen. A Course in Computational Algebraic Number Theory. Springer-Verlag, Berlin, 1993."},{"key":"37_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9316-0","volume-title":"Prime Numbers. A Computational Perspective","author":"R. Crandall","year":"2001","unstructured":"R. Crandall and C. Pomerance. Prime Numbers. A Computational Perspective. Springer-Verlag New York, 2001."},{"key":"37_CR5","unstructured":"E. Fujisaki, T. Kobayashi, H. Morita, H. Oguro, T. Okamoto, S. Okazaki, D. Pointcheval, and S. Uchiyama. EPOC \u2014 efficient probabilistic public-key encryption. Submission to NESSIE, 2000. https:\/\/www.cosic.esat.-kuleuven.ac.be\/nessie\/workshop\/submissions.html ."},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1214\/aoms\/1177705677","volume":"31","author":"B. Harris","year":"1960","unstructured":"B. Harris. Probability distributions related to random mappings. Annals of Math. Statistics, 31:1045\u20131062, 1960.","journal-title":"Annals of Math. Statistics"},{"key":"37_CR7","volume-title":"Technical Report TI-3\/00","author":"D. H\u00fchnlein","year":"2000","unstructured":"D. H\u00fchnlein. Quadratic orders for NESSIE \u2014 overview and parameter sizes of three public key families. Technical Report TI-3\/00, TU Darmstadt, Germany, 2000. http:\/\/www.informatik.tu-darmstadt.de\/TI\/-Veroeffentlichung\/TR\/Welcome.html ."},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H. W. Lenstra Jr.","year":"1987","unstructured":"H. W. Lenstra, Jr. Factoring integers with elliptic curves. Ann. of Math., 126:649\u2013673, 1987.","journal-title":"Ann. of Math."},{"key":"37_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45682-1_5","volume-title":"Advances in Cryptology-ASIACRYPT 2001","author":"A. K. Lenstra","year":"2001","unstructured":"A. K. Lenstra. Unbelievable security. Matching AES security using public key cryptosystems. In Advances in Cryptology-ASIACRYPT 2001, volume 2248 of Lecture Notes in Computer Science. Springer-Verlag, 2001."},{"key":"37_CR10","unstructured":"LiDIA Group, Technische Universit\u00e4t Darmstadt, Darmstadt, Germany. LiDIA-A library for computational number theory, Version 2.0, 2000."},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1006\/jsco.1998.0226","volume":"26","author":"S. M. Eikenberry","year":"1998","unstructured":"S. Meyer Eikenberry and J. P. Sorenson. Efficient algorithms for computing the Jacobi symbol. Journal of Symbolic Computation, 26:509\u2013523, 1998.","journal-title":"Journal of Symbolic Computation"},{"key":"37_CR12","volume-title":"An FFT extension of the elliptic curve method of factorization","author":"P. Montgomery","year":"1992","unstructured":"P. Montgomery. An FFT extension of the elliptic curve method of factorization. PhD thesis, University of California, Los Angeles, 1992."},{"key":"37_CR13","volume-title":"Master\u2019s thesis","author":"A. M\u00fcller","year":"1995","unstructured":"A. M\u00fcller. Eine FFT-Continuation f\u00fcr die elliptische Kurvenmethode. Master\u2019s thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany, 1995. Diplomarbeit."},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"A. Menezes, P. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.","DOI":"10.1201\/9781439821916"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"R. Peralta. Elliptic curve factorization using a \u201cpartially oblivious\u201d function. In K.-Y. Lam, I. Shparlinski, H. Wang, and C. Xing, editors, Cryptography and Computational Number Theory: Workshop in Singapore 1999, volume 20 of Progress in Computer Science and Applied Logic, pages 123\u2013128. Birkh\u00e4user, 2001.","DOI":"10.1007\/978-3-0348-8295-8_11"},{"key":"37_CR16","unstructured":"R. Peralta and E. Okamoto. Faster factoring of integers of a special form. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, E79-A(4), 1996."},{"key":"37_CR17","unstructured":"Pol. J. M. Pollard. Private communication, February 2002."},{"issue":"3","key":"37_CR18","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"J. M. Pollard","year":"1975","unstructured":"J. M. Pollard. A Monte Carlo method for factorization. BIT, 15(3):331\u2013335, 1975.","journal-title":"BIT"},{"issue":"143","key":"37_CR19","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J. M. Pollard","year":"1978","unstructured":"J. M. Pollard. Monte Carlo methods for index computation (mod p). Mathematics of Computation, 32(143):918\u2013924, 1978.","journal-title":"Mathematics of Computation"},{"key":"37_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/BFb0055738","volume-title":"Advances in Cryptology-CRYPTO\u2019 98","author":"T. Takagi","year":"1998","unstructured":"T. Takagi. Fast RSA-type cryptosystem modulo p k q. In Advances in Cryptology-CRYPTO\u2019 98, volume 1462 of Lecture Notes in Computer Science, pages 318\u2013326. Springer-Verlag, 1998."},{"key":"37_CR21","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1090\/S0025-5718-98-00968-5","volume":"67","author":"E. Teske","year":"1998","unstructured":"E. Teske. A space efficient algorithm for group structure computation. Mathematics of Computation, 67:1637\u20131663, 1998.","journal-title":"Mathematics of Computation"},{"key":"37_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/BFb0054891","volume-title":"Algorithmic Number Theory Seminar ANTS-III","author":"E. Teske","year":"1998","unstructured":"E. Teske. Speeding up Pollard\u2019s rho method for computing discrete logarithms. In Algorithmic Number Theory Seminar ANTS-III, volume 1423 of Lecture Notes in Computer Science, pages 541\u2013554. Springer-Verlag, 1998."},{"key":"37_CR23","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1090\/S0025-5718-00-01213-8","volume":"70","author":"E. Teske","year":"2001","unstructured":"E. Teske. On random walks for Pollard\u2019s rho method. Mathematics of Computation, 70:809\u2013825, 2001.","journal-title":"Mathematics of Computation"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45455-1_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T21:29:10Z","timestamp":1556486950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45455-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438632","9783540454557"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45455-1_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}