{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:33:41Z","timestamp":1725489221808},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540140399"},{"type":"electronic","value":"9783540392002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-39200-9_24","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T03:35:32Z","timestamp":1187235332000},"page":"388-400","source":"Crossref","is-referenced-by-count":20,"title":["Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast Endomorphisms"],"prefix":"10.1007","author":[{"given":"Mathieu","family":"Ciet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanja","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Sica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Jacques","family":"Quisquater","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"24_CR1","unstructured":"IEEE Std 1363-2000. IEEE Standard Specifications for Public-Key Cryptography. IEEE Computer Society, August 29, 2000."},{"key":"24_CR2","unstructured":"R.M. Avanzi. On multi-exponentiation in cryptography. Technical Report 2002\/154, Cryptology ePrint Archive, Available at: http:\/\/eprint.iacr.org\/2002\/154 , 2002."},{"key":"24_CR3","unstructured":"D.J. Bernstein. Pippenger\u2019s exponentiation algorithm. Available at: http:\/\/cr.yp.to\/papers.html , 2002."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"I. Blake, G. Seroussi, and N. Smart. Elliptic Curves in Cryptography, volume 265 of London Mathematical Society. Cambridge University Press, 2000.","DOI":"10.1017\/CBO9781107360211"},{"key":"24_CR5","unstructured":"H. Cohen. A Course in Computational Algebraic Number Theory, volume 138 of Graduate Texts in Mathematics. Springer, 1996."},{"key":"24_CR6","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 Cryptography \u2014 Proceedings of ASIACRYPT 1998","author":"H. Cohen","year":"1998","unstructured":"H. Cohen, A. Miyaji, and T. Ono. Efficient Elliptic Curve using Mixed Coordinates. In K. Ohta and D. Pei, editors, Advances in Cryptography \u2014 Proceedings of ASIACRYPT 1998, volume 1514 of Lecture Notes in Computer Science, pages 51\u201365. Springer, 1998."},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469\u2013472, 1985.","journal-title":"IEEE Transactions on Information Theory"},{"key":"24_CR8","unstructured":"Standard for Efficient Cryptography. Elliptic Curve Cryptography Ver.1.0 Technical report, Certicom, Available at: http:\/\/www.secg.org\/drafts.html , 2001."},{"key":"24_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology \u2014 Proceedings of CRYPTO 2001","author":"R. P. Gallant","year":"2001","unstructured":"R. P. Gallant, J. L. Lambert, and S. A. Vanstone. Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. In J. Kilian, editor, Advances in Cryptology \u2014 Proceedings of CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 190\u2013200. Springer, 2001."},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"D. M. Gordon","year":"1998","unstructured":"D. M. Gordon. A Survey of Fast Exponentiation Methods. Journal of Algorithms, 27(1):129\u2013146, 1998.","journal-title":"Journal of Algorithms"},{"key":"24_CR11","series-title":"Lect Notes Comput Sci","first-page":"279","volume-title":"Advances in Cryptology \u2014 Proceedings of CRYPTO 1991","author":"N. Koblitz","year":"1991","unstructured":"N. Koblitz. CM-curves with good cryptographic properties. In Joan Feigenbaum, editor, Advances in Cryptology \u2014 Proceedings of CRYPTO 1991, volume 576 of Lecture Notes in Computer Science, pages 279\u2013287, Berlin, 1991. Springer."},{"key":"24_CR12","unstructured":"T. Lange. Efficient Arithmetic on Hyperelliptic Koblitz Curves. PhD thesis, University of Essen, 2001."},{"key":"24_CR13","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. Speeding up the Computations on an Elliptic Curve using Addition-Subtraction Chains. Inform. Theor. Appl., 24:531\u2013543, 1990.","journal-title":"Inform. Theor. Appl."},{"issue":"4","key":"24_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s001459900045","volume":"11","author":"V. M\u00fcller","year":"1998","unstructured":"V. M\u00fcller. Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two. Journal of Cryptology, 11(4):219\u2013234, 1998.","journal-title":"Journal of Cryptology"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"V. M\u00fcller. Efficient Point Multiplication for Elliptic Curves over Special Optimal Extension Fields. In Walter de Gruyter, editor, Public-Key Cryptography and Computational Number Theory, pages 197\u2013207, Warschau, Poland, September 11\u201315, 2000 (2001).","DOI":"10.1515\/9783110881035.197"},{"key":"24_CR16","unstructured":"National Institute of Standards and Technology. FIPS-186-2: Digital Signature Standard (DSS), January 2000. Available at http:\/\/csrc.nist.gov\/publications\/fips\/ ."},{"key":"24_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/3-540-45664-3_23","volume-title":"Advances in Cryptology \u2014 Proceedings of PKC 2002","author":"Y.-H. Park","year":"2002","unstructured":"Y-H. Park, S. Jeong, C. Kim, and J. Lim. An Alternate Decomposition of an Integer for Faster Point Multiplication on Certain Elliptic Curves. In D. Naccache and P. Paillier, editors, Advances in Cryptology \u2014 Proceedings of PKC 2002, volume 2274 of Lecture Notes in Computer Science, pages 323\u2013334. Springer, 2002."},{"key":"24_CR18","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0065-2458(08)60610-5","volume":"1","author":"G.W. Reitwiesner","year":"1960","unstructured":"G.W. Reitwiesner. Binary arithmetic. Advances in Computers, 1:231\u2013308, 1960.","journal-title":"Advances in Computers"},{"key":"24_CR19","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of Selected Areas in Cryptography (SAC 2002)","author":"F. Sica","year":"2002","unstructured":"F. Sica, M. Ciet, and J-J. Quisquater. Analysis of the Gallant-Lambert-Vanstone Method based on Efficient Endomorphisms: Elliptic and Hyperelliptic Curves. In H. Heys and K. Nyberg, editors, Proceedings of Selected Areas in Cryptography (SAC 2002), Lecture Notes in Computer Science. Springer, 2002. To appear."},{"issue":"2","key":"24_CR20","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/PL00003820","volume":"12","author":"N.P. Smart","year":"1999","unstructured":"N.P. Smart. Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic. Journal of Cryptology, 12(2):141\u2013151, 1999.","journal-title":"Journal of Cryptology"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1008306223194","volume":"19","author":"J. Solinas","year":"2000","unstructured":"J. Solinas. Efficient arithmetic on Koblitz curves. Designs, Codes and Cryptography, 19:195\u2013249, 2000.","journal-title":"Designs, Codes and Cryptography"},{"key":"24_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BFb0052248","volume-title":"Advances in Cryptology \u2014 Proceedings of CRYPTO 1997","author":"J. A. Solinas","year":"1997","unstructured":"J. A. Solinas. An Improved Algorithm for Arithmetic on a Family of Elliptic Curves. In Burton S. Kaliski Jr., editor, Advances in Cryptology \u2014 Proceedings of CRYPTO 1997, volume 1294 of Lecture Notes in Computer Science, pages 357\u2013371. Springer, 1997."},{"key":"24_CR23","unstructured":"J.A. Solinas. Low-Weight Binary Representations for Pairs of Integers. Technical Report CORR 2001-41, CACR, Available at: www.cacr.math.uwaterloo.ca\/~techreports\/2001\/corr2001-41.ps , 2001."},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"E.G. Straus. Addition chains of vectors (problem 5125). American Mathematical Monthly 70, pages 806\u2013808, 1964.","DOI":"10.2307\/2310929"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39200-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:09:21Z","timestamp":1556755761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39200-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540140399","9783540392002"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-39200-9_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}