{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:27Z","timestamp":1772283567579,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540004097","type":"print"},{"value":"9783540364009","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003]]},"DOI":"10.1007\/3-540-36400-5_41","type":"book-chapter","created":{"date-parts":[[2007,9,2]],"date-time":"2007-09-02T19:59:37Z","timestamp":1188763177000},"page":"564-578","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Fast Multi-scalar Multiplication Methods on Elliptic Curves with Precomputation Strategy Using Montgomery Trick"],"prefix":"10.1007","author":[{"given":"Katsuyuki","family":"Okeya","sequence":"first","affiliation":[]},{"given":"Kouichi","family":"Sakurai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Akishita, T., Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form, Eighth Annual Workshop on Selected Area in Cryptography (SAC2001), (2001).","DOI":"10.1007\/3-540-45537-X_20"},{"key":"41_CR2","unstructured":"ANSI X9.62, Public Key Cryptography for the Financial Services Industry, The Elliptic Curve Digital Signature Algorithm (ECDSA), (1998)."},{"key":"41_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45353-9_19","volume-title":"Topics in Cryptology-CT-RSA 2001","author":"M. Brown","year":"2001","unstructured":"Brown, M., Hankerson, D., L\u00f3pez, J., Menezes, A., Software Implementation of the NIST Elliptic Curves over Prime Fields, Topics in Cryptology-CT-RSA 2001, LNCS2020, (2001), 250\u2013265."},{"key":"41_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/BFb0055748","volume-title":"Advances in Cryptology-CRYPTO\u201998","author":"D.V. Bailey","year":"1998","unstructured":"Bailey, D.V., Paar, C., Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms, Advances in Cryptology-CRYPTO\u201998, LNCS1462, (1998), 472\u2013485."},{"key":"41_CR5","unstructured":"Bailey, D.V., Paar, C., Inversion in Optimal Extension Fields, Conference on The Mathematics of Public Key Cryptography, (1999)."},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P., Elliptic Curves in Cryptography, Cambridge University Press,(1999).","DOI":"10.1017\/CBO9781107360211"},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"D. Chunnovsky","year":"1987","unstructured":"Chunnovsky, D., Chundovsky, G., Sequences of numbers generated by addition in formal groups and new primality and factoring tests, Advances in Applied Mathematics, 7 (1987), 385\u2013434.","journal-title":"Advances in Applied Mathematics"},{"key":"41_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","volume-title":"Advances in Cryptology-ASIACRYPT\u2019 98","author":"H. Cohen","year":"1998","unstructured":"Cohen, H., Miyaji, A., Ono, T., Efficient Elliptic Curve Exponentiation Using Mixed Coordinates, Advances in Cryptology-ASIACRYPT\u2019 98, LNCS1514, (1998), 51\u201365."},{"key":"41_CR9","volume-title":"GTM138","author":"H. Cohen","year":"1993","unstructured":"Cohen, H., A course in computational algebraic number theory, GTM138, Springer-Verlag, New York, (1993)."},{"key":"41_CR10","unstructured":"[DSA] National Institute of Standards and Technology (NIST), Digital Signature Standard (DSS), FIPS PUB 186-2, (2000)."},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T., A public-key cryptosystem and a signature scheme based on discrete logarithm, IEEE Transactions on Information Theory 31 (1985), 469\u2013472.","journal-title":"IEEE Transactions on Information Theory"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Enge, A., Elliptic Curves and their applications to Cryptography, Kluwer Academic publishers,(1999).","DOI":"10.1007\/978-1-4615-5207-9"},{"key":"41_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology-CRYPTO 2001","author":"R.P. Gallant","year":"2001","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A., Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms, Advances in Cryptology-CRYPTO 2001, LNCS2139, (2001), 190\u2013200."},{"key":"41_CR14","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Cryptographic Hardware and Embedded Systems (CHES2000)","author":"D. Hankerson","year":"2000","unstructured":"Hankerson, D., Hernandez, J.L., Menezes, A., Software Implementation of Elliptic Curve Cryptography over Binary Fields, Cryptographic Hardware and Embedded Systems (CHES2000), LNCS1965, (2000), 1\u201324."},{"key":"41_CR15","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N., Elliptic curve cryptosystems, Math. Comp. 48, (1987), 203\u2013209.","journal-title":"Math. Comp"},{"key":"41_CR16","unstructured":"Knuth, D.E., The Art of Computer Programming, 2-Semi-numerical Algorithms, Addison-Wesley, 2nd edition, (1981)."},{"key":"41_CR17","series-title":"Lect Notes Comput Sci","first-page":"405","volume-title":"Fast implementation of Elliptic Curve Arithmetic in GF(pm)","author":"C.H. Lim","year":"1996","unstructured":"Lim, C.H., Hwang, H.S., Fast implementation of Elliptic Curve Arithmetic in GF(pm), Proc. PKC\u201900 LNCS1751, (2000), 405\u2013421."},{"key":"41_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology-CRYPTO\u2019 94","author":"C.H. Lim","year":"1994","unstructured":"Lim, C.H., Lee, P.J., More Flexible Exponentiation with Precomputation, Advances in Cryptology-CRYPTO\u2019 94, LNCS839, (1994), 95\u2013107."},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Menezes, A.J., Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, (1993).","DOI":"10.1007\/978-1-4615-3198-2"},{"key":"41_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology-CRYPTO\u2019 85","author":"V.S. Miller","year":"1986","unstructured":"Miller, V.S., Use of elliptic curves in cryptography, Advances in Cryptology-CRYPTO\u2019 85, LNCS218,(1986),417\u2013426."},{"issue":"6","key":"41_CR21","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1051\/ita\/1990240605311","volume":"24","author":"F. Morain","year":"1990","unstructured":"Morain, F., Olivos, J., Speeding up the computations on an elliptic curve using addition-subtraction chains, Theoretical Informatics and Applications 24 No.6, (1990), 531\u2013544.","journal-title":"Theoretical Informatics and Applications"},{"key":"41_CR22","unstructured":"M\u00f6ller, B., Algorithm for multi-exponentiation, Eighth AnnualWorkshop on Selected Area in Cryptography (SAC2001), (2001), 179\u2013194."},{"key":"41_CR23","doi-asserted-by":"publisher","first-page":"243","DOI":"10.2307\/2007888","volume":"48","author":"P.L. Montgomery","year":"1987","unstructured":"Montgomery, P.L., Speeding the Pollard and Elliptic Curve Methods of Factorizations, Math. Comp. 48, (1987), 243\u2013264","journal-title":"Math. Comp"},{"issue":"2","key":"41_CR24","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L., A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, Vol.21, No.2, (1978), 120\u2013126.","journal-title":"Communications of the ACM"},{"key":"41_CR25","volume-title":"GMT106","author":"J.H. Silverman","year":"1986","unstructured":"Silverman, J.H., The Arithmetic of Elliptic Curves, GMT106, Springer-Verlag, New York, (1986)."}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2002"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36400-5_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T21:25:53Z","timestamp":1558473953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36400-5_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540004097","9783540364009"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-36400-5_41","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"17 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}