{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T23:19:19Z","timestamp":1773962359220,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":61,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662498897","type":"print"},{"value":"9783662498903","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49890-3_16","type":"book-chapter","created":{"date-parts":[[2016,4,27]],"date-time":"2016-04-27T04:40:46Z","timestamp":1461732046000},"page":"403-428","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":60,"title":["Complete Addition Formulas for Prime Order Elliptic Curves"],"prefix":"10.1007","author":[{"given":"Joost","family":"Renes","sequence":"first","affiliation":[]},{"given":"Craig","family":"Costello","sequence":"additional","affiliation":[]},{"given":"Lejla","family":"Batina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,28]]},"reference":[{"key":"16_CR1","unstructured":"Accredited Standards Committee X9. American National Standard X9.62-1999, Public Key Cryptography forthe Financial Services Industry: The Elliptic Curve Digital Signaturealgorithm (ECDSA) (1999) Draft at. http:\/\/grouper.ieee.org\/groups\/1363\/Research\/Other.html"},{"key":"16_CR2","unstructured":"Accredited Standards Committee X9. American National Standard X9.63-2001, Public key cryptography forthe financial services industry: key agreement and key transport usingelliptic curve cryptography (1999) Draft at. http:\/\/grouper.ieee.org\/groups\/1363\/Research\/Other.html"},{"key":"16_CR3","unstructured":"Agence nationale de la s\u00e9curit\u00e9 des sys\u00e8mes d\u2019information(ANSSI).M\u00e9canismes cryptographiques: R\u00e8gles et recommandationsconcernant le choix et le dimensionnement des m\u00e9canismescryptographiques (2014). http:\/\/www.ssi.gouv.fr\/uploads\/2015\/01\/RGS_v-2-0_B1.pdf"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1112\/S1461157012001027","volume":"15","author":"C Ar\u00e8ne","year":"2012","unstructured":"Ar\u00e8ne, C., Kohel, D., Ritzenthaler, C.: Complete addition laws on abelian varieties. LMS J. Comput. Math. 15, 308\u2013316 (2012)","journal-title":"LMS J. Comput. Math."},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-540-24660-2_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"L Batina","year":"2004","unstructured":"Batina, L., Bruin-Muurling, G., \u00d6rs, S.: Flexible hardware design for RSA and elliptic curve cryptosystems. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 250\u2013263. Springer, Heidelberg (2004)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11745853_14","volume-title":"Public Key Cryptography - PKC 2006","author":"DJ Bernstein","year":"2006","unstructured":"Bernstein, D.J.: Curve25519: new diffie-hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 207\u2013228. Springer, Heidelberg (2006)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-68164-9_26","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 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.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 389\u2013405. Springer, Heidelberg (2008)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-319-22174-8_15","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2015","author":"DJ Bernstein","year":"2015","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Kohel, D., Lange, T.: Twisted hessian curves. In: Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LatinCrypt 2015. LNCS, vol. 9230, pp. 269\u2013294. Springer, Heidelberg (2015)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/978-3-662-44709-3_18","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014","author":"DJ Bernstein","year":"2014","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T.: Curve41417: karatsuba revisited. In: Batina, L., Robshaw, M. (eds.) CHES 2014. LNCS, vol. 8731, pp. 316\u2013334. Springer, Heidelberg (2014)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Hamburg, M., Krasnova, A., Lange, T.: Elligator: elliptic-curve points indistinguishable from uniform random strings. In: Sadeghi, A., Gligor, V.D., Yung, M., (eds.) ACM SIGSAC Conference on Computer and Communications Security, CCS 2013, Berlin, Germany, 4\u20138 November 2013, pp. 967\u2013980. ACM (2013)","DOI":"10.1145\/2508859.2516734"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 29\u201350. Springer, Heidelberg (2007)"},{"key":"16_CR13","unstructured":"Bernstein, D.J., Lange, T.: Complete addition laws for elliptic curves. Talk at Algebra and Number Theory Seminar (Universidad Autonomo de Madrid) (2009) Slides at. http:\/\/cr.yp.to\/talks\/2009.04.17\/slides.pdf"},{"key":"16_CR14","unstructured":"Bernstein, D.J., Lange, T.: Safecurves: choosing safe curves for elliptic-curve cryptography. http:\/\/safecurves.cr.yp.to\/ . Accessed 5 October 2015"},{"key":"16_CR15","unstructured":"Bernstein, D.J., Lange, T.: Explicit-Formulas Database. http:\/\/hyperelliptic.org\/EFD\/index.html . Accessed 3 October 2015"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Costello, C., Longa, P., Naehrig, M.: Selecting elliptic curves for cryptography: An efficiency andsecurity analysis. J. Crypt. Eng. 1\u201328 (2015). http:\/\/dx.doi.org\/10.1007\/s13389-015-0097-y","DOI":"10.1007\/s13389-015-0097-y"},{"key":"16_CR17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-662-45472-5_11","volume-title":"Financial Cryptography and Data Security","author":"Joppe W. Bos","year":"2014","unstructured":"Bos, J.W., Halderman, J.A., Heninger, N., Moore, J., Naehrig, M., Wustrow, E.: Elliptic curve cryptography in practice. In: Christin and Safavi-Naini [26], pp. 157\u2013175"},{"issue":"3\/4","key":"16_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J.J., Playoust, C.: The magma algebra system I: the user language. J. Symb. Comput. 24(3\/4), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"issue":"2","key":"16_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/jnth.1995.1088","volume":"53","author":"W Bosma","year":"1995","unstructured":"Bosma, W., Lenstra, H.W.: Complete systems of two addition laws for elliptic curves. J. Number Theory 53(2), 229\u2013240 (1995)","journal-title":"J. Number Theory"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45664-3_24","volume-title":"Public Key Cryptography","author":"E Brier","year":"2002","unstructured":"Brier, E., Joye, M.: Weierstra\u00df elliptic curves and side-channel attacks. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 335\u2013345. Springer, Heidelberg (2002)"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-44828-4_6","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"E Brier","year":"2003","unstructured":"Brier, E., Joye, M.: Fast point multiplication on elliptic curves through isogenies. In: Fossorier, M.P.C., H\u00f8holdt, T., Poli, A. (eds.) AAECC 2003. LNCS, vol. 2643, pp. 43\u201350. Springer, Heidelberg (2003)"},{"key":"16_CR22","unstructured":"Certicom Research. SEC 2: Recommended Elliptic Curve Domain Parameters, Version 2.0 (2010). http:\/\/www.secg.org\/sec2-v2.pdf"},{"key":"16_CR23","unstructured":"Certivox UK, Ltd. CertiVox Standard Curves. http:\/\/docs.certivox.com\/docs\/miracl\/certivox-standard-curves . Accessed 9 September 2015"},{"issue":"5","key":"16_CR24","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1109\/TCSII.2006.889459","volume":"54","author":"G Chen","year":"2007","unstructured":"Chen, G., Bai, G., Chen, H.: A high-performance elliptic curve cryptographic processor for general curves over GF(p) based on a systolic arithmetic unit. IEEE Trans. Circ. Syst. II Express Briefs 54(5), 412\u2013416 (2007)","journal-title":"IEEE Trans. Circ. Syst. II Express Briefs"},{"key":"16_CR25","unstructured":"Chinese Commerical Cryptography Administration Office.SM2 Digital Signature Algorithm. See (2010). http:\/\/www.oscca.gov.cn\/UpFile\/2010122214836668.pdf and http:\/\/tools.ietf.org\/html\/draft-shen-sm2-ecdsa-02"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","volume-title":"Financial Cryptography and Data Security","year":"2014","unstructured":"Christin, N., Safavi-Naini, R. (eds.): FC 2014. LNCS, vol. 8437. Springer, Heidelberg (2014)"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"H Cohen","year":"1998","unstructured":"Cohen, H., Miyaji, A., Ono, T.: Efficient elliptic curve exponentiation using mixed coordinates. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 51\u201365. Springer, Heidelberg (1998)"},{"key":"16_CR28","unstructured":"Committee on National Security Systems (CNSS). Advisory Memorandum: Use of Public Standards for the Secure Sharingof Information Among National Security Systems (2015). https:\/\/www.cnss.gov\/CNSS\/openDoc.cfm?Q5ww0Xu+7kg\/OpTB\/R2\/MQ=="},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-48059-5_25","volume-title":"Cryptographic Hardware and Embedded Systems","author":"J-S Coron","year":"1999","unstructured":"Coron, J.-S.: Resistance against differential power analysis for elliptic curve cryptosystems. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, p. 292. Springer, Heidelberg (1999)"},{"key":"16_CR30","unstructured":"ECC Brainpool. ECC Brainpool Standard Curves and Curve Generation (2005). http:\/\/www.ecc-brainpool.org\/download\/Domain-parameters.pdf"},{"issue":"3","key":"16_CR31","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1090\/S0273-0979-07-01153-6","volume":"44","author":"H Edwards","year":"2007","unstructured":"Edwards, H.: A normal form for elliptic curves. Bull. Am. Math. Soc. 44(3), 393\u2013422 (2007)","journal-title":"Bull. Am. Math. Soc."},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-23951-9_10","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"J Fan","year":"2011","unstructured":"Fan, J., Gierlichs, B., Vercauteren, F.: To infinity and beyond: combined attack on ECC using points of low order. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 143\u2013159. Springer, Heidelberg (2011)"},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-28368-0_18","volume-title":"Cryptography and Security: From Theory to Applications","author":"J Fan","year":"2012","unstructured":"Fan, J., Verbauwhede, I.: An updated survey on secure ECC implementations: attacks, countermeasures and cost. In: Naccache, D. (ed.) Cryphtography and Security: From Theory to Applications. LNCS, vol. 6805, pp. 265\u2013282. Springer, Heidelberg (2012)"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"RP Gallant","year":"2001","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190\u2013200. Springer, Heidelberg (2001)"},{"key":"16_CR35","unstructured":"Government Committee of Russia for Standards.Information technology. Cryptographic data security. Signature andverification processes of [electronic] digital signature (2001). See. https:\/\/tools.ietf.org\/html\/rfc5832"},{"key":"16_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-85053-3_5","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2008","author":"T G\u00fcneysu","year":"2008","unstructured":"G\u00fcneysu, T., Paar, C.: Ultra high performance ECC over NIST primes on commercial FPGAs. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol. 5154, pp. 62\u201378. Springer, Heidelberg (2008)"},{"key":"16_CR37","unstructured":"Hamburg, M.: Twisting Edwards curves with isogenies. Cryptology ePrint Archive, report 2014\/027 (2014). http:\/\/eprint.iacr.org\/"},{"key":"16_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/978-3-662-47989-6_34","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"M Hamburg","year":"2015","unstructured":"Hamburg, M.: Decaf: eliminating cofactors through point compression. In: Gennaro, R., Robshaw, M. (eds.) Advances in Cryptology \u2013 CRYPTO 2015. LNCS, vol. 9215, pp. 705\u2013723. Springer, Heidelberg (2015)"},{"key":"16_CR39","unstructured":"Hamburg, M.: Ed448-Goldilocks, a new elliptic curve. Cryptology ePrint Archive, report 2015\/625 (2015). http:\/\/eprint.iacr.org\/"},{"key":"16_CR40","volume-title":"Guide to Elliptic Curve Cryptography","author":"D Hankerson","year":"2006","unstructured":"Hankerson, D., Menezes, A.J., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer Science and Business Media, Heidelberg (2006)"},{"key":"16_CR41","unstructured":"Hisil, H.: Elliptic curves, group law, and efficient computation, Ph.D. thesis, Queensland University of Technology (2010). http:\/\/eprints.qut.edu.au\/33233\/"},{"issue":"3","key":"16_CR42","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10623-011-9558-1","volume":"63","author":"Z Hu","year":"2012","unstructured":"Hu, Z., Longa, P., Xu, M.: Implementing the 4-dimensional GLV method on GLS elliptic curves with j-invariant 0. Des. Codes Crypt. 63(3), 331\u2013343 (2012)","journal-title":"Des. Codes Crypt."},{"key":"16_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-36288-6_17","volume-title":"Public Key Cryptography - PKC 2003","author":"T Izu","year":"2003","unstructured":"Izu, T., Takagi, T.: Exceptional procedure attack on elliptic curve cryptosystems. In: Desmedt, Y. (ed.) Public Key Cryptography - PKC 2003. LNCS, vol. 2567, pp. 224\u2013239. Springer, Heidelberg (2003)"},{"key":"16_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-02384-2_21","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"M Joye","year":"2009","unstructured":"Joye, M., Tunstall, M.: Exponent recoding and regular exponentiation algorithms. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 334\u2013349. Springer, Heidelberg (2009)"},{"key":"16_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-29889-9_4","volume-title":"Financial Cryptography and Data Security","author":"E K\u00e4sper","year":"2012","unstructured":"K\u00e4sper, E.: Fast elliptic curve cryptography in openSSL. In: Danezis, G., Dietrich, S., Sako, K. (eds.) FC 2011 Workshops 2011. LNCS, vol. 7126, pp. 27\u201339. Springer, Heidelberg (2012)"},{"key":"16_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology - CRYPTO 1996","author":"PC Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing attacks on implementations of diffie-hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"issue":"5","key":"16_CR47","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1016\/j.jnt.2010.12.001","volume":"131","author":"D Kohel","year":"2011","unstructured":"Kohel, D.: Addition law structure of elliptic curves. J. Number Theory 131(5), 894\u2013919 (2011)","journal-title":"J. Number Theory"},{"issue":"3","key":"16_CR48","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/BF01388526","volume":"79","author":"H Lange","year":"1985","unstructured":"Lange, H., Ruppert, W.: Complete systems of addition laws on abelian varieties. Inventiones mathematicae 79(3), 603\u2013610 (1985)","journal-title":"Inventiones mathematicae"},{"key":"16_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"CH Lim","year":"1994","unstructured":"Lim, C.H., Lee, P.J.: More flexible exponentiation with precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 95\u2013107. Springer, Heidelberg (1994)"},{"key":"16_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-319-02726-5_22","volume-title":"Information and Communications Security","author":"Z Liu","year":"2013","unstructured":"Liu, Z., Seo, H., Gro\u00dfsch\u00e4dl, J., Kim, H.: Efficient implementation of NIST-compliant elliptic curve cryptography for sensor nodes. In: Qing, S., Zhou, J., Liu, D. (eds.) ICICS 2013. LNCS, vol. 8233, pp. 302\u2013317. Springer, Heidelberg (2013)"},{"key":"16_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-15031-9_6","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"P Longa","year":"2010","unstructured":"Longa, P., Gebotys, C.: Efficient techniques for high-speed elliptic curve cryptography. In: Mangard, S., Standaert, F. (eds.) CHES 2010. LNCS, vol. 6225, pp. 80\u201394. Springer, Heidelberg (2010)"},{"key":"16_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology of CRYPTO 1985 Proceedings","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"issue":"170","key":"16_CR53","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519\u2013521 (1985)","journal-title":"Math. Comput."},{"issue":"177","key":"16_CR54","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243\u2013264 (1987)","journal-title":"Math. Comput."},{"key":"16_CR55","unstructured":"National Institute for Standards and Technology (NIST). Digital Signature Standard. Federal Information Processing Standards Publication 186-2 (2000). http:\/\/csrc.nist.gov\/publications\/fips\/archive\/fips186-2\/fips186-2.pdf"},{"key":"16_CR56","unstructured":"National Institute for Standards and Technology (NIST). Digital Signature Standard. Federal Information Processing Standards Publication 186-4 (2013). http:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.186-4.pdf"},{"key":"16_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-36563-X_23","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"K Okeya","year":"2003","unstructured":"Okeya, K., Takagi, T.: The width-$$w$$ NAF method provides small memory and fast elliptic scalar multiplications secure against side channel attacks. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 328\u2013342. Springer, Heidelberg (2003)"},{"key":"16_CR58","unstructured":"Renes, J., Costello, C., Batina, L.: Complete addition formulas for prime order elliptic curves. Cryptology ePrint Archive, report 2015\/1060 (2015). http:\/\/eprint.iacr.org\/"},{"key":"16_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-77690-1_19","volume-title":"Wireless Sensor Networks","author":"P Szczechowiak","year":"2008","unstructured":"Szczechowiak, P., Oliveira, L.B., Scott, M., Collier, M., Dahab, R.: NanoECC: testing the limits of elliptic curve cryptography in sensor networks. In: Verdone, R. (ed.) EWSN 2008. LNCS, vol. 4913, pp. 305\u2013320. Springer, Heidelberg (2008)"},{"key":"16_CR60","unstructured":"Renes, J., Costello, C., Batina, L.: Complete addition formulas for prime order elliptic curves. Cryptology ePrint Archive, report 2015\/1060 (2015). http:\/\/eprint.iacr.org\/"},{"key":"16_CR61","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-3-662-45472-5_10","volume-title":"Financial Cryptography and Data Security","author":"Mehdi Tibouchi","year":"2014","unstructured":"Tibouchi, M.: Elligator squared: Uniform points on elliptic curves of prime order as uniform random strings. In: Christin and Safavi-Naini [26], pp. 139\u2013156"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2016"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49890-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T19:56:46Z","timestamp":1692302206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49890-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662498897","9783662498903"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49890-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"28 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}