{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:11:48Z","timestamp":1742379108531},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430100"},{"type":"electronic","value":"9783540453116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45311-3_11","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T19:01:41Z","timestamp":1195066901000},"page":"108-116","source":"Crossref","is-referenced-by-count":11,"title":["A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography"],"prefix":"10.1007","author":[{"given":"Mathieu","family":"Ciet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quisquater","family":"Jean-Jacques","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Sica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,26]]},"reference":[{"issue":"177","key":"11_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.2307\/2007876","volume":"48","author":"D.G. Cantor","year":"1987","unstructured":"D.G. Cantor. Computing in the Jacobian of a Hyperelliptic Curve. Mathematics of Computation, 48(177):95\u2013101, 1987.","journal-title":"Mathematics of Computation"},{"key":"11_CR2","unstructured":"A. Enge and P. Gaudry. A General Framework for Subexponential Discrete Logarithm Algorithms. In LIX\/RR\/00\/04-Laboratoire d\u2019Informatique-Ecole Polytechnique-Palaiseau, to appear in Acta Arithmetica, Available at http:\/\/www.math.uni-augsburg.de\/~enge\/Publikationen.html , June 2000."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF00125200","volume":"2","author":"S. Gao","year":"1992","unstructured":"S. Gao and H.W. Lenstra JR. Optimal Normal Bases. Designs, Codes and Cryptography, 2:315\u2013323, 1992.","journal-title":"Designs, Codes and Cryptography"},{"key":"11_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptography-EUROCRYPT\u2019 2000","author":"P. Gaudry","year":"2000","unstructured":"P. Gaudry. An Algorithm for Solving the Discrete Logarithm Problem on Hyperelliptic Curves. In Springer-Verlag, editor, Advances in Cryptography-EUROCRYPT\u2019 2000, LNCS, 2000."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"P. Gaudry, F. Hess, and N.P. Smart. Constructive and Destructive Facets of Weil Descent on Elliptic Curves. Journal of Cryptology, to appear.","DOI":"10.1007\/s00145-001-0011-x"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"D. M. Gordon","year":"1998","unstructured":"D. M. Gordon. A Survey of Fast Exponentiation Methods. Journal of Algorithms, 27(1):129\u2013146, 1998.","journal-title":"Journal of Algorithms"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"D. Hankerson, J. L. Hernandez, and A. Menezes. Software Implementation of Elliptic Curve Cryptography over Binary Fields. Proceedings of CHES2000, pages 1\u201324, 2000.","DOI":"10.1007\/3-540-44499-8_1"},{"key":"11_CR8","first-page":"209","volume":"225","author":"C. Hooley","year":"1967","unstructured":"C. Hooley. On Artin\u2019s Conjecture. J. Reine Angew. Math., 225:209\u2013220, 1967.","journal-title":"J. Reine Angew. Math"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0890-5401(89)90045-X","volume":"83","author":"B. Ito","year":"1989","unstructured":"B. Ito and S. Tsujii. Structure of a Parallel Multiplier for a Class of Fields GF(2n). Information and Compuers, 83:21\u201340, 1989.","journal-title":"Information and Compuers"},{"issue":"177","key":"11_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"K. Koblitz","year":"1987","unstructured":"K. Koblitz. Elliptic Curve Cryptosystems. Mathematics of Computation, 48(177):203\u2013209, 1987.","journal-title":"Mathematics of Computation"},{"key":"11_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-46766-1_22","volume-title":"Advances in Cryptology-Crypto\u2019 91","author":"N. Koblitz","year":"1991","unstructured":"N. Koblitz. CM-curves with good cryptographic properties. In Joan Feigenbaum, editor, Advances in Cryptology-Crypto\u2019 91, pages 279\u2013287, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science Volume 576."},{"key":"11_CR12","unstructured":"A. Menezes and M. Qu. Analysis of the Weil Descent Attack of Gaudry, Hess and Smart. In Proceedings RSA 2001, 2001."},{"key":"11_CR13","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. Vanstone. Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. IEEE Transactions on Information Theory, 39:1639\u20131646, 1993.","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology, CRYPTO86","author":"V. Miller","year":"1986","unstructured":"V. Miller. Use of Elliptic Curves in Cryptography. In Springer-Verlag, editor, Advances in Cryptology, CRYPTO86, volume 263 of LNCS, pages 417\u2013426, 1986."},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1051\/ita\/1990240605311","volume":"24","author":"F. Morain","year":"1990","unstructured":"F. Morain and J. Olivos. Speeding up the Computations on an Elliptic Curve using Addition-Subtraction Chains. Inform. Theor. Appl., 24:531\u2013543, 1990.","journal-title":"Inform. Theor. Appl"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. Pohlig","year":"1978","unstructured":"S. Pohlig and M. Hellman. An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significants. IEEE Transactions on Infomation Theory, 24:106\u2013110, 1978.","journal-title":"IEEE Transactions on Infomation Theory"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J. Pollard","year":"1978","unstructured":"J. Pollard. Monte Carlo Methods for Index Computation (mod p). Mathematics of Computation, 32:918\u2013924, 1978.","journal-title":"Mathematics of Computation"},{"key":"11_CR18","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":"11_CR19","doi-asserted-by":"publisher","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:353\u2013356, 1998.","journal-title":"Mathematics of Computation"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"D. Shanks. A Theory of Factorization and Genera. In Proc. Symp. Pure Math., 20:415\u2013440, 1971.","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"J. H. Silverman. Fast Multiplication in Finite Fields GF(2n). Proceedings CHES\u2019 99, pages 122\u2013134, 1999.","DOI":"10.1007\/3-540-48059-5_12"},{"issue":"3","key":"11_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 Cryptology, 12(3):193\u2013196, 1999.","journal-title":"Journal of Cryptology"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"N. P. Smart. How Secure are Elliptic Curves over Composite Extension Fields? Proceedings EUROCRYPT 2001, 2045:30\u201339, 2001.","DOI":"10.1007\/3-540-44987-6_3"},{"key":"11_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0052248","volume-title":"Advances in Cryptology, CRYPTO\u2019 97","author":"J. A. Solinas","year":"1997","unstructured":"J. A. Solinas. An Improved Algorithm for Arithmetic on a Family of Elliptic Curves. In Burton S. Kaliski Jr., editor, Advances in Cryptology, CRYPTO\u2019 97, volume 1294 of Lecture Notes in Computer Science, Springer-Verlag, pages 357\u2013371, 1997."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2014 INDOCRYPT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45311-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T12:18:14Z","timestamp":1556972294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45311-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430100","9783540453116"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45311-3_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}