{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:49:28Z","timestamp":1762004968194,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,12,16]],"date-time":"2017-12-16T00:00:00Z","timestamp":1513382400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10444-017-9581-5","type":"journal-article","created":{"date-parts":[[2017,12,15]],"date-time":"2017-12-15T21:06:20Z","timestamp":1513371980000},"page":"1275-1293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7906-0430","authenticated-orcid":false,"given":"Denis","family":"Khleborodov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,16]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Avanzi, R., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press (2005)","key":"9581_CR1","DOI":"10.1201\/9781420034981"},{"unstructured":"ANSI X9.62:2005, Public Key Cryptography for the Financial Services Industry, The Elliptic Curve Digital Signature Algorithm (ECDSA), Accredited Standards Committee on Financial Services, X9 (2005)","key":"9581_CR2"},{"doi-asserted-by":"crossref","unstructured":"Billet, O., Joye, M.: Fast Point Multiplication on Elliptic Curves through Isogenies, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, LNCS vol. 2643, pp. 43\u201350. Springer-Verlag (2003)","key":"9581_CR3","DOI":"10.1007\/3-540-44828-4_6"},{"key":"9581_CR4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.5802\/jtnb.301","volume":"13","author":"W Bosma","year":"2001","unstructured":"Bosma, W.: Signed bits and fast exponentiation. J. Theor. Nombres Bordeaux 13, 27\u201341 (2001)","journal-title":"J. Theor. Nombres Bordeaux"},{"doi-asserted-by":"crossref","unstructured":"Brown, M., Hankerson, D., Lopez, J., Menezes, A.: Software Implementation of the NIST elliptic curves over prime fields. In: Progress in Cryptology CT-RSA 2001 , LNCS vol. 2020, pp. 250\u2013265. Springer-Verlag (2001)","key":"9581_CR5","DOI":"10.1007\/3-540-45353-9_19"},{"key":"9581_CR6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"D Chudnovsky","year":"1986","unstructured":"Chudnovsky, D., Chudnovsky, G.: Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Adv. Appl. Math. 7, 385\u2013434 (1986)","journal-title":"Adv. Appl. Math."},{"issue":"2","key":"9581_CR7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10623-005-3299-y","volume":"39","author":"M Ciet","year":"2006","unstructured":"Ciet, M., Joye, M., Lauter, K., Montgomery, P.: Trading inversions for multiplications in elliptic curve cryptography, Designs. Codes Cryptog. 39(2), 189\u2013206 (2006)","journal-title":"Codes Cryptog."},{"doi-asserted-by":"crossref","unstructured":"Cohen, H., Miyaji, A., Ono, T.: Efficient Elliptic Curve Exponentiation using Mixed Coordinates, Advances in Cryptology \u2013 ASIACRYPT \u201998, Vol. 1514 of Lecture Notes in Computer Science, pp. 51\u201365. Springer-Verlag (1998)","key":"9581_CR8","DOI":"10.1007\/3-540-49649-1_6"},{"key":"9581_CR9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/11593447_4","volume":"3788","author":"V Dimitrov","year":"2005","unstructured":"Dimitrov, V., Imbert, L., Mishra, P.K.: Efficient and secure elliptic curve point multiplication using double-base chains, Advances in Cryptology \u2013 ASIACRYPT\u201905. Lect. Notes Comput. Sci. 3788, 59\u201378 (2005)","journal-title":"Lect. Notes Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Eisentra\u0307ger, K., Lauter, K., Montgomery, P.: Fast elliptic curve arithmetic and improved Weil pairing evaluation, Topics in CryptographyCT-RSA 2003, vol. 2612, Lecture Notes in Computer Science, no. 230, pp. 343354 (2003)","key":"9581_CR10","DOI":"10.1007\/3-540-36563-X_24"},{"unstructured":"Fay, B.: Double-and-add with relative Jacobian coordinates (2014). http:\/\/eprint.iacr.org\/2014\/1014.pdf","key":"9581_CR11"},{"unstructured":"FIPS PUB 186-2. Digital Signature Standard (DSS). \u2014 National Institute of Standards and Technology (NIST), pp. 70 (2000)","key":"9581_CR12"},{"key":"9581_CR13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"DM Gordon","year":"1998","unstructured":"Gordon, D.M.: A survey of fast exponentiation method. J. Algor. 27, 129\u2013146 (1998)","journal-title":"J. Algor."},{"unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer-Verlag (2004)","key":"9581_CR14"},{"unstructured":"P. IEEE Std 1363-2000. IEEE Standard Specifications for Public-Key Cryptography. The Institute of Electrical and Electronics Engineers (IEEE) (2000)","key":"9581_CR15"},{"unstructured":"Knuth, D.: The Art of Computer Programming, Semi numerical Algorithms, 3 edn. Addison-Wesley (1998)","key":"9581_CR16"},{"key":"9581_CR17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48, 203\u2013209 (1987)","journal-title":"Math. Comput."},{"doi-asserted-by":"publisher","unstructured":"Longa, P., Miri, A.: Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields, to appear in IEEE Transactions on Computers (2007). Also available at https:\/\/doi.org\/10.1109\/TC.2007.70815","key":"9581_CR18","DOI":"10.1109\/TC.2007.70815"},{"unstructured":"Longa, P.: Accelerating the Scalar Multiplication on Elliptic Curve Cryptosystems over Prime Fields (2008)","key":"9581_CR19"},{"unstructured":"Longa, P.: New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields (2008)","key":"9581_CR20"},{"unstructured":"Meloni, N.: Fast and Secure Elliptic Curve Scalar Multiplication over Prime Fields using Special Addition Chains, Cryptology ePrint Archive Report 2006\/216 (2006)","key":"9581_CR21"},{"doi-asserted-by":"crossref","unstructured":"Miller, V.: Use of Elliptic-Curves in Cryptography, Advances in Cryptology \u2013 Crypto \u201985, LNCS, vol. 218, pp. 417\u2013426. Springer (1986)","key":"9581_CR22","DOI":"10.1007\/3-540-39799-X_31"},{"unstructured":"NIST PUB 800-57. Recommendation for Key Management Part 1: General (Revision 3). \u2014 National Institute of Standards and Technology (NIST), pp. 142 (2012)","key":"9581_CR23"},{"issue":"2004","key":"9581_CR24","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-540-28628-8_8","volume":"3152","author":"K Okeya","year":"2004","unstructured":"Okeya, K., Schmidt-Samoa, K., Spahn, C., Takagi, T.: Signed binary representations revisited, Advances in Cryptology - CRYPTO. Lect. Notes Comput. Sci 3152(2004), 123\u2013139 (2004)","journal-title":"Lect. Notes Comput. Sci"},{"unstructured":"SEC 1: Elliptic Curve Cryptography. Standards for Efficient Cryptography, Certicom Corp., (2009)","key":"9581_CR25"},{"unstructured":"Sullivan, N.T.: Fast Algorithms for Arithmetic on Elliptic Curves Over Prime Fields (2008)","key":"9581_CR26"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-017-9581-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-017-9581-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-017-9581-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T23:34:01Z","timestamp":1570491241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-017-9581-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,16]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["9581"],"URL":"https:\/\/doi.org\/10.1007\/s10444-017-9581-5","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"type":"print","value":"1019-7168"},{"type":"electronic","value":"1572-9044"}],"subject":[],"published":{"date-parts":[[2017,12,16]]}}}