{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:33:50Z","timestamp":1776846830033,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540633846","type":"print"},{"value":"9783540695288","type":"electronic"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0052248","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T14:37:31Z","timestamp":1155825451000},"page":"357-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":105,"title":["An improved algorithm for arithmetic on a family of elliptic curves"],"prefix":"10.1007","author":[{"given":"Jerome A.","family":"Solinas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,17]]},"reference":[{"key":"25_CR1","unstructured":"D. Gordon, \u201cA survey of fast exponentiation methods\u201d (to appear)."},{"key":"25_CR2","unstructured":"D. E. Knuth, Seminumerical Algorithms, Addison-Wesley, 1981, p. 272."},{"key":"25_CR3","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, \u201cSpeeding up the computations on an elliptic curve using addition-subtraction chains\u201d, Inform. Theor. Appl.\n                24 (1990), pp. 531\u2013543.","journal-title":"Inform. Theor. Appl."},{"key":"25_CR4","unstructured":"A. Menezes, T. Okamoto and S. Vanstone, \u201cReducing elliptic curve logarithms to logarithms in a finite field\u201d, Proc. 23rd Annual ACM Symp. on Theory of Computing (1991), pp. 80\u201389."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"N. Koblitz, \u201cCM curves with good cryptographic properties\u201d, Proc. Crypto '91, Springer-Verlag, 1992, pp. 279\u2013287.","DOI":"10.1007\/3-540-46766-1_22"},{"key":"25_CR6","doi-asserted-by":"publisher","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, \u201cLow complexity normal bases\u201d, Discrete Applied Math.\n                25 (1989), pp. 191\u2013210.","journal-title":"Discrete Applied Math."},{"key":"25_CR7","first-page":"31","volume":"44","author":"T. Itoh","year":"1986","unstructured":"T. Itoh, O Teechai, and S. Trojii, \u201cA fast algorithm for computing multiplicative inverses in GF(2t)\u201d, J. Soc. Electron. Comm. (Japan) 44 (1986), pp. 31\u201336.","journal-title":"J. Soc. Electron. Comm. (Japan)"},{"key":"25_CR8","unstructured":"E. Berlekamp, Algebraic Coding Theory, Aegean Park Press, 1984, pp. 36\u201344."},{"key":"25_CR9","unstructured":"A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997, pp. 107\u2013109."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"W. Meier and O. Staffelbach, \u201cEfficient multiplication on certain non-supersingular elliptic curves\u201d, Proc. Crypto '92, Springer-Verlag, 1993, pp. 333\u2013344.","DOI":"10.1007\/3-540-48071-4_24"},{"key":"25_CR11","unstructured":"R. Reiter and J. Solinas, \u201cFast elliptic arithmetic on special curves\u201d, NSA\/R21 Informal Tech. Report, 1997."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"K. Koyama and Y. Tsuruoka, \u201cSpeeding up elliptic cryptosystems by using a signed binary window method\u201d, Proc. Crypto '92, Springer-Verlag, 1993, pp. 345\u2013357.","DOI":"10.1007\/3-540-48071-4_25"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"R. Schroeppel, H. Orman, S. O'Malley, and O. Spatscheck, \u201cFast key exchange with elliptic curve systems\u201d, Proc. Crypto '95, Springer-Verlag, 1995, pp. 43\u201356.","DOI":"10.1007\/3-540-44750-4_4"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"R. Schroeppel, H. Orman, S. O'Malley, and O. Spatscheck, \u201cFast key exchange with elliptic curve systems\u201d, Univ. of Arizona. Comp. Sci. Tech. Report 95-03, 1995.","DOI":"10.1007\/3-540-44750-4_4"},{"key":"25_CR15","unstructured":"F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier, 1977, pp. 277\u2013279."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO '97"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052248","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T22:27:19Z","timestamp":1580336839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633846","9783540695288"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0052248","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"17 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}