{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T04:45:09Z","timestamp":1648961109418},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,5,28]],"date-time":"2016-05-28T00:00:00Z","timestamp":1464393600000},"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":["J Cryptogr Eng"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s13389-016-0131-8","type":"journal-article","created":{"date-parts":[[2016,5,28]],"date-time":"2016-05-28T10:58:03Z","timestamp":1464433083000},"page":"187-199","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Inversion-free arithmetic on elliptic curves through isomorphisms"],"prefix":"10.1007","volume":"6","author":[{"given":"Raveen R.","family":"Goundar","sequence":"first","affiliation":[]},{"given":"Marc","family":"Joye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,28]]},"reference":[{"key":"131_CR1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-540-68164-9_26","volume-title":"Progress in Cryptology\u2013AFRICACRYPT 2008","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted Edwards curves. In: Vaudenay, S. (ed.) Progress in Cryptology\u2013AFRICACRYPT 2008. LNCS, vol. 5023, pp. 389\u2013405. Springer, Heidelberg (2008)"},{"key":"131_CR2","unstructured":"Bernstein, D.J., Lange, T.: Explicit-formulas database. http:\/\/www.hyperelliptic.org\/EFD\/"},{"key":"131_CR3","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-3-540-76900-2_3","volume-title":"Advances in Cryptology\u2013 ASIACRYPT 2007","author":"DJ Bernstein","year":"2007","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Kurosawa, K. (ed.) Advances in Cryptology\u2013 ASIACRYPT 2007. LNCS, vol. 4833, pp. 29\u201350. Springer, Heidelberg (2007)"},{"issue":"4","key":"131_CR4","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"DV Chudnovsky","year":"1986","unstructured":"Chudnovsky, D.V., Chudnovsky, G.V.: Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Adv. Appl. Math. 7(4), 385\u2013434 (1986)","journal-title":"Adv. Appl. Math."},{"issue":"1","key":"131_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s00145-004-0218-8","volume":"18","author":"H Cohen","year":"2005","unstructured":"Cohen, H.: Analysis of the sliding window powering algorithm. J. Cryptol. 18(1), 63\u201376 (2005)","journal-title":"J. Cryptol."},{"key":"131_CR6","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","year":"2005","unstructured":"Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., Vercauteren, F. (eds.): Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton (2005)"},{"key":"131_CR7","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/BFb0054867","volume-title":"Algorithmic Number Theory (ANTS-III)","author":"E Win De","year":"1998","unstructured":"De Win, E., Mister, S., Preneel, B., Wiener, M.J.: On the performance of signature schemes based on elliptic curves. In: Buhler, J. (ed.) Algorithmic Number Theory (ANTS-III). LNCS, vol. 1423, pp. 252\u2013266. Springer, Heidelberg (1998)"},{"key":"131_CR8","unstructured":"Fips, P.U.B. 186\u20133: Digital signature standard (DSS). Federal Information Processing Standards Publication (2009)"},{"issue":"1","key":"131_CR9","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 methods. J. Algorithms 27(1), 129\u2013146 (1998)","journal-title":"J. Algorithms"},{"key":"131_CR10","doi-asserted-by":"crossref","unstructured":"Goundar, R.R., Joye, M., Miyaji, A.: Co- $$Z$$ Z addition formul\u00e6 and binary ladders on elliptic curves. In: Mangard, S., Standaert, F.-X. (eds.) Cryptographic Hardware and Embedded Systems\u2014CHES\u00a02010. LNCS, vol. 6225, pp. 65\u201379. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-15031-9_5"},{"issue":"2","key":"131_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s13389-011-0012-0","volume":"1","author":"RR Goundar","year":"2011","unstructured":"Goundar, R.R., Joye, M., Miyaji, A., Rivain, M., Venelli, A.: Scalar multiplication on Weierstra\u00df elliptic curves from co- $$Z$$ Z arithmetic. J. Cryptogr. Eng. 1(2), 161\u2013176 (2011)","journal-title":"J. Cryptogr. Eng."},{"key":"131_CR12","volume-title":"Guide to Elliptic Curve Cryptography","author":"D Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)"},{"key":"131_CR13","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/978-3-662-45611-8_18","volume-title":"Advances in Cryptology\u2013ASIACRYPT 2014","author":"H Hisil","year":"2014","unstructured":"Hisil, H., Costello, C.: Jacobian coordinates on genus 2 curves. In: Sarkar, P., Iwata, T. (eds.) Advances in Cryptology\u2013ASIACRYPT 2014. LNCS, vol. 8873, pp. 338\u2013357. Springer, Heidelberg (2014)"},{"key":"131_CR14","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/978-3-540-89255-7_20","volume-title":"Advances in Cryptology\u2013ASIACRYPT 2008","author":"H H\u0131\u015f\u0131l","year":"2008","unstructured":"H\u0131\u015f\u0131l, H., Wong, K.K.H., Carter, G., Dawson, E.: Twisted Edwards curves revisited. In: Pieprzyk, J. (ed.) Advances in Cryptology\u2013ASIACRYPT 2008. LNCS, vol. 5350, pp. 326\u2013343. Springer, Heidelberg (2008)"},{"key":"131_CR15","unstructured":"IEEE Std P1363-2000: Standard specifications for public key cryptography. IEEE Computer Society (2000)"},{"key":"131_CR16","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-3-540-74735-2_10","volume-title":"Cryptographic Hardware and Embedded Systems\u2013CHES 2007","author":"M Joye","year":"2007","unstructured":"Joye, M.: Highly regular right-to-left algorithms for scalar multiplication. In: Paillier, P., Verbauwhede, I. (eds.) Cryptographic Hardware and Embedded Systems\u2013CHES 2007. LNCS, vol. 4727, pp. 135\u2013147. Springer, Heidelberg (2007)"},{"key":"131_CR17","volume-title":"Fault Analysis in Cryptography","year":"2012","unstructured":"Joye, M., Tunstall, M. (eds.): Fault Analysis in Cryptography. Springer, Heidelberg (2012)"},{"key":"131_CR18","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-44709-1_31","volume-title":"Cryptographic Hardware and Embedded Systems\u2013CHES 2001","author":"M Joye","year":"2001","unstructured":"Joye, M., Tymen, C.: Protections against differential analysis for elliptic curve cryptography: An algebraic approach. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) Cryptographic Hardware and Embedded Systems\u2013CHES 2001. LNCS, vol. 2162, pp. 377\u2013390. Springer, Heidelberg (2001)"},{"key":"131_CR19","volume-title":"The Art of Computer Programming: Seminumerical Algorithms","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming: Seminumerical Algorithms, vol. 2, 3rd edn. Addison-Wesley, Boston (1997)","edition":"3"},{"key":"131_CR20","doi-asserted-by":"crossref","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"131_CR21","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/978-3-642-15031-9_6","volume-title":"Cryptographic Hardware and Embedded Systems\u2013CHES 2010","author":"P Longa","year":"2010","unstructured":"Longa, P., Gebotys, C.H.: Efficient techniques for high-speed elliptic curve cryptography. In: Mangard, S., Standaert, F.-X. (eds.) Cryptographic Hardware and Embedded Systems\u2013CHES 2010. LNCS, vol. 6225, pp. 80\u201394. Springer, Heidelberg (2010)"},{"key":"131_CR22","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/978-3-540-78440-1_14","volume-title":"Public Key Cryptography\u2013PKC 2008","author":"P Longa","year":"2008","unstructured":"Longa, P., Miri, A.: New composite operations and precomputation for elliptic curve cryptosystems over prime fields. In: Cramer, R. (ed.) Public Key Cryptography\u2013PKC 2008. LNCS, vol. 4939, pp. 229\u2013247. Springer, Heidelberg (2008)"},{"key":"131_CR23","volume-title":"Power Analysis Attacks","author":"S Mangard","year":"2007","unstructured":"Mangard, S., Oswald, E., Popp, T.: Power Analysis Attacks. Springer, Heidelberg (2007)"},{"key":"131_CR24","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-73074-3_15","volume-title":"Arithmetic of Finite Fields (WAIFI 2007)","author":"N Meloni","year":"2007","unstructured":"Meloni, N.: New point addition formul\u00e6 for ECC applications. In: Carlet, C., Sunar, B. (eds.) Arithmetic of Finite Fields (WAIFI 2007). LNCS, vol. 4547, pp. 189\u2013201. Springer, Heidelberg (2007)"},{"key":"131_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3198-2","volume-title":"Elliptic Curve Public Key Cryptosystems","author":"AJ Menezes","year":"1993","unstructured":"Menezes, A.J.: Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Boston (1993)"},{"key":"131_CR26","series-title":"LNCS","first-page":"417","volume-title":"Advances in Cryptology\u2013CRYPTO \u201985","author":"VS Miller","year":"1985","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) Advances in Cryptology\u2013CRYPTO \u201985. LNCS, vol. 218, pp. 417\u2013426. Springer, Berlin (1985)"},{"key":"131_CR27","doi-asserted-by":"crossref","unstructured":"M\u00f6ller, B.: Securing elliptic curve point multiplication against side-channel attacks. In: Information Security (ISC\u00a02001). LNCS, vol. 2200, pp. 324\u2013334. Springer (2001)","DOI":"10.1007\/3-540-45439-X_22"},{"issue":"177","key":"131_CR28","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding up the Pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243\u2013264 (1987)","journal-title":"Math. Comput."},{"issue":"6","key":"131_CR29","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. RAIRO Theor. Inform. Appl. 24(6), 531\u2013543 (1990)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"131_CR30","unstructured":"NSA names ECC as the exclusive technology for key agreement and digital signature standards for the U.S. government. Press release (2 March 2005), announced on February 16, 2005 at the RSA conference"},{"key":"131_CR31","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-36563-X_23","volume-title":"Topics in Cryptology\u2013CT-RSA 2003","author":"K Okeya","year":"2003","unstructured":"Okeya, K., Takagi, T.: The width- $$w$$ w NAF method provides small memory and fast elliptic scalar multiplications secure against side channel attacks. In: Joye, M. (ed.) Topics in Cryptology\u2013CT-RSA 2003. LNCS, vol. 2612, pp. 328\u2013342. Springer, Heidelberg (2003)"},{"key":"131_CR32","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0065-2458(08)60610-5","volume":"1","author":"GW Reitwiesner","year":"1960","unstructured":"Reitwiesner, G.W.: Binary arithmetic. Adv. Comput. 1, 231\u2013308 (1960)","journal-title":"Adv. Comput."},{"key":"131_CR33","unstructured":"Rivain, M.: Fast and regular algorithms for scalar multiplication over elliptic curves. Cryptology ePrint Archive, Report 2011\/338, http:\/\/eprint.iacr.org\/ (2011)"},{"key":"131_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The Arithmetic of Elliptic Curves","author":"JH Silverman","year":"1986","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. Springer, New York (1986)"},{"key":"131_CR35","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/3-540-36288-6_18","volume-title":"Public Key Cryptography\u2013PKC 2003","author":"M Stam","year":"2003","unstructured":"Stam, M.: On Montgomery-like representations for elliptic curves over $${\\rm GF}(2^k)$$ GF ( 2 k ) . In: Desmedt, Y. (ed.) Public Key Cryptography\u2013PKC 2003. LNCS, vol. 2567, pp. 240\u2013253. Springer, Heidelberg (2003)"},{"key":"131_CR36","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/978-3-642-15031-9_30","volume-title":"Cryptographic Hardware and Embedded Systems\u2013CHES 2010","author":"M Tunstall","year":"2010","unstructured":"Tunstall, M., Joye, M.: Coordinate blinding over large prime fields. In: Mangard, S., Standaert, F.-X. (eds.) Cryptographic Hardware and Embedded Systems\u2013CHES 2010. LNCS, vol. 6225, pp. 443\u2013455. Springer, Heidelberg (2010)"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-016-0131-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-016-0131-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-016-0131-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T20:51:05Z","timestamp":1567975865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-016-0131-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,28]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["131"],"URL":"https:\/\/doi.org\/10.1007\/s13389-016-0131-8","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,28]]}}}