{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:56:37Z","timestamp":1725490597054},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540004097"},{"type":"electronic","value":"9783540364009"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36400-5_25","type":"book-chapter","created":{"date-parts":[[2007,9,2]],"date-time":"2007-09-02T19:59:37Z","timestamp":1188763177000},"page":"333-348","source":"Crossref","is-referenced-by-count":10,"title":["On the Efficient Generation of Elliptic Curves over Prime Fields"],"prefix":"10.1007","author":[{"given":"Elisavet","family":"Konstantinou","sequence":"first","affiliation":[]},{"given":"Yiannis C.","family":"Stamatiou","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Zaroliagis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.2307\/2152935","volume":"61","author":"A. O. L. Atkin","year":"1993","unstructured":"A. O. L. Atkin, F. Morain, Elliptic curves and primality proving, Mathematics of Computation 61(1993), pp. 29\u201367.","journal-title":"Mathematics of Computation"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"713","DOI":"10.2307\/2004849","volume":"24","author":"E. R. Berlekamp","year":"1970","unstructured":"E. R. Berlekamp, Factoring polynomials over large finite fields, Mathematics of Computation 24(1970), pp. 713\u2013735.","journal-title":"Mathematics of Computation"},{"unstructured":"H. Baier, and J. Buchmann, Efficient construction of cryptographically strong elliptic curves, in Progress in Cryptology-INDOCRYPT 2000, Lecture Notes in Computer Science Vol. 1977 (Springer-Verlag, 2000), pp. 191\u2013202.","key":"25_CR3"},{"doi-asserted-by":"crossref","unstructured":"Ian Blake, Gadiel Seroussi, and Nigel Smart, Elliptic curves in cryptography, London Mathematical Society Lecture Note Series 265, Cambridge University Press, 1999.","key":"25_CR4","DOI":"10.1017\/CBO9781107360211"},{"unstructured":"D. Burton, Elementary Number Theory, McGraw Hill, 4th edition, 1998.","key":"25_CR5"},{"unstructured":"G. Cornacchia, Su di un metodo per la risoluzione in numeri interi dell' equazione \u2211n h=0 Chxn.hyh = P, Giornale di Matematiche di Battaglini 46 (1908), pp. 33\u201390.","key":"25_CR6"},{"unstructured":"GNU multiple precision library, edition 3.1.1, September 2000. Available at: http:\/\/www.swox.com\/gmp .","key":"25_CR7"},{"unstructured":"IEEE P1363\/D13, Standard Specifications for Public-Key Cryptography, ballot draft, 1999. http:\/\/grouper.ieee.org\/groups\/1363\/tradPK\/draft.html .","key":"25_CR8"},{"unstructured":"Implementations of Portions of the P1363 Draft. http:\/\/grouper.ieee.org\/groups\/1363\/P1363\/implementations.html .","key":"25_CR9"},{"unstructured":"LiDIA. A library for computational number theory, Technical University of Darmstadt. Available from http:\/\/www.informatik.tu-darmstadt.de\/TI\/LiDIA\/Welcome.html .","key":"25_CR10"},{"key":"25_CR11","series-title":"Lect Notes Comput Sci","volume-title":"A Software Library for Elliptic Curve Cryptography","author":"E. Konstantinou","year":"2002","unstructured":"E. Konstantinou, Y. Stamatiou, and C. Zaroliagis, A Software Library for Elliptic Curve Cryptography, in Proc. 10th European Symposium on Algorithms-ESA 2002 (Engineering and Applications Track), Lecture Notes in Computer Science (Springer-Verlag, 2002), to appear."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A. J. Menezes","year":"1993","unstructured":"A. J. Menezes, T. Okamoto and S. A. Vanstone, Reducing elliptic curve logarithms to a finite field, IEEE Trans. Info. Theory, 39(1993), pp. 1639\u20131646.","journal-title":"IEEE Trans. Info. Theory"},{"unstructured":"Multiprecision Integer and Rational Arithmetic C\/C++ Library, http:\/\/indigo.ie\/mscott\/ .","key":"25_CR13"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"G. C. Pohlig","year":"1978","unstructured":"G. C. Pohlig and M. E. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. Info. Theory, 24 (1978), pp. 106\u2013110.","journal-title":"IEEE Trans. Info. Theory"},{"key":"25_CR15","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, Comm. Math. Univ. Sancti Pauli, 47(1998), pp. 81\u201391.","journal-title":"Comm. Math. Univ. Sancti Pauli"},{"key":"25_CR16","series-title":"Lect Notes Comput Sci","first-page":"145","volume-title":"Cryptographic Hardware and Embedded Systems-CHES 2001","author":"E. Savas","year":"2001","unstructured":"Erkay Savas, Thomas A. Schmidt, and Cetin K. Koc, Generating Elliptic Curves of Prime Order, in Cryptographic Hardware and Embedded Systems-CHES 2001, Lecture Notes in Computer Science Vol. 2162 (Springer-Verlag, 2001), pp. 145\u2013161."},{"key":"25_CR17","doi-asserted-by":"crossref","first-page":"219","DOI":"10.5802\/jtnb.142","volume":"7","author":"R. Schoof","year":"1995","unstructured":"R. Schoof, Counting points on elliptic curves over finite fields, J. Theorie des Nombres de Bordeaux, 7(1995), pp. 219\u2013254.","journal-title":"J. Theorie des Nombres de Bordeaux"},{"unstructured":"M. Scott, A C++ Implementation of the Complex Multiplication (CM) Elliptic Curve Generation Algorithm from Annex A, in Implementations of Portions of the P1363 Draft. http:\/\/grouper.ieee.org\/groups\/1363\/P1363\/implementations.html .","key":"25_CR18"},{"unstructured":"V. Shoup, NTL: A Library for doing Number Theory, URL: http:\/\/shoup.net\/ntl\/ .","key":"25_CR19"},{"doi-asserted-by":"crossref","unstructured":"I. A. Semaev, Evaluation of discrete logarithms on some elliptic curves, Mathematics of Computation, 67(1998), pp. 353-356.","key":"25_CR20","DOI":"10.1090\/S0025-5718-98-00887-4"},{"doi-asserted-by":"crossref","unstructured":"J. H. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, GTM 106, 1986.","key":"25_CR21","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s001459900052","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(1999), pp. 193\u2013196.","journal-title":"Journal of Cryptography"},{"unstructured":"Thomas Valente, A distributed approach to proving large numbers prime, Rensselaer Polytechnic Institute Troy, New York, Thesis, August 1992.","key":"25_CR23"},{"unstructured":"Pate Williams. Available at: http:\/\/www.mindspring.com\/~pate .","key":"25_CR24"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36400-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T15:40:08Z","timestamp":1556811608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36400-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540004097","9783540364009"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-36400-5_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}