{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T11:34:46Z","timestamp":1777548886122,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1023\/a:1008306223194","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"195-249","source":"Crossref","is-referenced-by-count":252,"title":["Efficient Arithmetic on Koblitz Curves"],"prefix":"10.1007","volume":"19","author":[{"given":"Jerome A.","family":"Solinas","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"253940_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(89)90001-2","volume":"25","author":"D. W. Ash","year":"1989","unstructured":"D. W. Ash, I. F. Blake, and S. Vanstone, Low complexity normal bases, Discrete Applied Math., Vol. 25 (1989) pp. 191\u2013210.","journal-title":"Discrete Applied Math."},{"key":"253940_CR2","unstructured":"E. Berlekamp, Algebraic Coding Theory, Aegean Park Press (1984)."},{"key":"253940_CR3","unstructured":"R. Gallant, R. Lambert, and S. Vanstone, Improving the parallelized Pollard lambda search on binary anomalous curves, Math. Comp., posted on May 19, 1999, PII: S-0025\u20135718(99)01119\u20139 (to appear in print)."},{"key":"253940_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"D. Gordon","year":"1998","unstructured":"D. Gordon, A survey of fast exponentiation methods, J. Algs., Vol. 27 (1998) pp. 129\u2013146.","journal-title":"J. Algs."},{"key":"253940_CR5","unstructured":"C. G\u00fcnther and A. Stein (to appear)."},{"key":"253940_CR6","unstructured":"Institute of Electrical and Electronics Engineers, IEEE P1363: Standard Specifications for Public-Key Cryptography, Draft 10 (1999)."},{"key":"253940_CR7","first-page":"31","volume":"44","author":"T. Itoh","year":"1986","unstructured":"T. Itoh, O. Teechai, and S. Trojii, A fast algorithm for computing multiplicative inverses in GF(2t), J. Soc. Electron. Comm. (Japan), Vol. 44 (1986) pp. 31\u201336.","journal-title":"J. Soc. Electron. Comm. (Japan)"},{"key":"253940_CR8","unstructured":"D. Johnson and A. Menezes, The Elliptic Curve Digital Signature Algorithm (ECDSA), Univ. of Waterloo (1999) http:\/\/cacr.math.waterloo.ca"},{"key":"253940_CR9","unstructured":"D. E. Knuth, Seminumerical Algorithms, Addison-Wesley (1981)."},{"key":"253940_CR10","doi-asserted-by":"crossref","unstructured":"N. Koblitz. CM curves with good cryptographic properties, Proc. Crypto '91, Springer-Verlag (1992) pp. 279\u2013287.","DOI":"10.1007\/3-540-46766-1_22"},{"key":"253940_CR11","doi-asserted-by":"crossref","unstructured":". N. Koblitz, A Course of Number Theory and Cryptography, 2nd ed., Springer-Verlag (1994).","DOI":"10.1007\/978-1-4419-8592-7"},{"key":"253940_CR12","doi-asserted-by":"crossref","unstructured":"N. Koblitz, An elliptic curve implementation of the Finite Field Digital Signature Algorithm, Proc. Crypto '98, Springer-Verlag (1998) pp. 327\u2013337.","DOI":"10.1007\/BFb0055739"},{"key":"253940_CR13","doi-asserted-by":"crossref","unstructured":"K. Koyama and Y. Tsuruoka, Speeding up elliptic cryptosystems by using a signed binary window method, Proc. Crypto '92, Springer-Verlag (1993) pp. 345\u2013357.","DOI":"10.1007\/3-540-48071-4_25"},{"key":"253940_CR14","unstructured":"J. Lopez, Fast multiplication on elliptic curves over GF(2m) without precomputation (preprint)."},{"key":"253940_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., Vol. 24 (1990) pp. 531\u2013543.","journal-title":"Inform. Theor. Appl."},{"key":"253940_CR16","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A. Menezes","year":"1993","unstructured":"A. Menezes, T. Okamoto and S. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Transactions on Information Theory, Vol. 39 (1993) pp. 1639\u20131646.","journal-title":"IEEE Transactions on Information Theory"},{"key":"253940_CR17","unstructured":"A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press (1997)."},{"key":"253940_CR18","doi-asserted-by":"crossref","unstructured":"W. Meier and O. Staffelbach, Efficient multiplication on certain non-supersingular elliptic curves, Proc. Crypto '92, Springer-Verlag (1993) pp. 333\u2013344.","DOI":"10.1007\/3-540-48071-4_24"},{"key":"253940_CR19","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s001459900045","volume":"11","author":"V. M\u00fcller","year":"1998","unstructured":"V. M\u00fcller, Fast multiplication on elliptic curves over small fields of characteristic two, J. Crypt., Vol. 11 (1998) pp. 219\u2013234.","journal-title":"J. Crypt."},{"key":"253940_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"P. van Oorschot","year":"1999","unstructured":"P. van Oorschot and M. Weiner, Parallel collision search with cryptanalytic applications, J. Crypt., Vol. 12 (1999) pp. 1\u201328.","journal-title":"J. Crypt."},{"key":"253940_CR21","unstructured":"G. Seroussi, Compact representations of elliptic curve points overGF(2n), http:\/\/grouper.ieee.org\/ groups\/1363\/contributions\/hp.ps"},{"key":"253940_CR22","doi-asserted-by":"crossref","unstructured":"J. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag (1986).","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"253940_CR23","unstructured":"I. Stewart and D. Tall, Algebraic Number Theory, 2nd. ed., Chapman and Hall (1987)."},{"key":"253940_CR24","doi-asserted-by":"crossref","unstructured":"M. Weiner and R. Zuccherato, Faster attacks on elliptic curve cryptosystems, Selected Areas in Cryptography, Springer-Verlag (1999) pp. 190\u2013200.","DOI":"10.1007\/3-540-48892-8_15"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008306223194.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008306223194\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008306223194.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:31:51Z","timestamp":1753759911000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008306223194"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":24,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["253940"],"URL":"https:\/\/doi.org\/10.1023\/a:1008306223194","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}