{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,4]],"date-time":"2022-10-04T07:56:56Z","timestamp":1664870216946},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425212","type":"print"},{"value":"9783540447092","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44709-1_13","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T14:04:18Z","timestamp":1186841058000},"page":"142-158","source":"Crossref","is-referenced-by-count":8,"title":["Generating Elliptic Curves of Prime Order"],"prefix":"10.1007","author":[{"given":"Erkay","family":"Sava\u015f","sequence":"first","affiliation":[]},{"given":"Thomas A.","family":"Schmidt","sequence":"additional","affiliation":[]},{"given":"\u00c7etin K.","family":"Ko\u00e7","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"A. O. L. Atkin and F. Morain. Elliptic curves and primality proving. Mathematics of Computation, 61(203):29\u201368, July 1993.","DOI":"10.1090\/S0025-5718-1993-1199989-X"},{"key":"13_CR2","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1997","unstructured":"H. Cohen. A Course in Computational Algebraic Number Theory. Springer, Berlin, Germany, 1997."},{"key":"13_CR3","volume-title":"Advanced Number Theory","author":"H. Cohn","year":"1980","unstructured":"H. Cohn. Advanced Number Theory. Dover Publications, New York, NY, 1980."},{"key":"13_CR4","volume-title":"Primes of the Form x2+ ny2: Fermat, Class Field Theory and Complex Multiplication","author":"D. A. Cox","year":"1989","unstructured":"D. A. Cox. Primes of the Form x2 + ny2: Fermat, Class Field Theory and Complex Multiplication. John Wiley & Sons, New York, NY, 1989."},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1216\/rmjm\/1022008986","volume":"30","author":"R. Gross","year":"2000","unstructured":"R. Gross and J. H. Smith. A generalization of a conjecture of hardy and littlewood to algebraic number fields. Rocky Mountain J. Math, 30(1):195\u2013215, 2000.","journal-title":"Rocky Mountain J. Math"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02403921","volume":"44","author":"G. H. Hardy","year":"1922","unstructured":"G. H. Hardy and J. E. Littlewood. Some problems of\u2019 partitio numerorum\u2019 iii: On the expression of a number as a sum of primes. Acta. MAth, 44:1\u201370, 1922.","journal-title":"Acta. MAth"},{"key":"13_CR7","unstructured":"IEEE. P1363: Standard specifications for public-key cryptography. Draft Version 13, November 12, 1999."},{"issue":"1","key":"13_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.2140\/pjm.1988.131.157","volume":"131","author":"N. Koblitz","year":"1988","unstructured":"N. Koblitz. Primality of the number of points on an elliptic curve over a finite field. Pacific J. Math., 131(1):157\u2013165, 1988.","journal-title":"Pacific J. Math."},{"issue":"2\u20133","key":"13_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1008354106356","volume":"19","author":"N. Koblitz","year":"2000","unstructured":"N. Koblitz, A. Menezes, and S. Vanstone. The state of elliptic curve cryptography, towards a quarter-century of public key cryptography. Designs, Codes and Cryptography, 19(2\u20133):173\u2013193, 2000.","journal-title":"Designs, Codes and Cryptography"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"G.-H. Lay and H. G. Zimmer. Constructing elliptic curves with given group order over large finite fields. Algorithmic number theory (Ithaca, NY, 1994), pages 157\u2013165, 1994.","DOI":"10.1007\/3-540-58691-1_64"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"A. K. Lenstra. Efficient identity based parameter selection for elliptic curve cryp-tosystems. Information Security and Privacy\u2014ACISP\u2019 99 (Wollongong), pages 294\u2013302, 1999.","DOI":"10.1007\/3-540-48970-3_24"},{"issue":"3","key":"13_CR12","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. Annals of Mathematics, 126(3):649\u2013673, 1987.","journal-title":"Annals of Mathematics"},{"key":"13_CR13","series-title":"Lect Notes Comput Sci","first-page":"492","volume-title":"Advances in Cryptology-AUSCRYPT 92","author":"A. Miyaji","year":"1992","unstructured":"A. Miyaji. Elliptic curves over F p suitable for cryptosystems. In J. Seberry and Y. Zheng, editors, Advances in Cryptology-AUSCRYPT 92, Lecture Notes in Computer Science, No. 718, pages 492\u2013504. Springer, Berlin, Germany, 1992."},{"key":"13_CR14","first-page":"81","volume":"47","author":"T. Satoh","year":"1998","unstructured":"T. Satoh and K. Araki. Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves. Commentarii Math. Univ. St. Pauli, 47:81\u201392, 1998.","journal-title":"Commentarii Math. Univ. St. Pauli"},{"key":"13_CR15","unstructured":"M. Scott. A C++ implementation of the complex cultiplication (CM) elliptic curve generation algorithm from Annex A. http:\/\/grouper.ieee.org\/groups\/1363\/P1363\/implementations.html March 14, 2000."},{"issue":"221","key":"13_CR16","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1090\/S0025-5718-98-00887-4","volume":"67","author":"I. A. Semaev","year":"1998","unstructured":"I. A. Semaev. Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p. Mathematics of Computation, 67(221):353\u2013356, January 1998.","journal-title":"Mathematics of Computation"},{"key":"13_CR17","unstructured":"V. Shoup. NTL: A Library for doing Number Theory (version 5.0c). http:\/\/shoup.net\/ntl\/ , 2001."},{"key":"13_CR18","doi-asserted-by":"crossref","volume-title":"The Arithmetic of Elliptic Curves","author":"J. H. Silverman","year":"1986","unstructured":"J. H. Silverman. The Arithmetic of Elliptic Curves. Springer, Berlin, Germany, 1986.","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"13_CR19","first-page":"193","volume":"12","author":"N.P. Smart","year":"1999","unstructured":"N.P. Smart. The discrete logarithm problem on elliptic curves of trace one. Journal of Cryptography, 12:193\u2013196, 1999.","journal-title":"Journal of Cryptography"}],"container-title":["Cryptographic Hardware and Embedded Systems \u2014 CHES 2001","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44709-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:25:08Z","timestamp":1556753108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44709-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425212","9783540447092"],"references-count":19,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-44709-1_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2001]]}}}