{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:20:16Z","timestamp":1742401216342},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1109\/tit.2010.2059831","type":"journal-article","created":{"date-parts":[[2011,2,18]],"date-time":"2011-02-18T18:17:37Z","timestamp":1298053057000},"page":"1816-1826","source":"Crossref","is-referenced-by-count":4,"title":["Fast Exponentiation Using Split Exponents"],"prefix":"10.1109","volume":"57","author":[{"given":"Jung Hee","family":"Cheon","sequence":"first","affiliation":[]},{"given":"Stanislaw","family":"Jarecki","sequence":"additional","affiliation":[]},{"given":"Taekyoung","family":"Kwon","sequence":"additional","affiliation":[]},{"given":"Mun-Kyu","family":"Lee","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-004-0161-9"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-05-01769-2"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00588-7"},{"key":"ref36","first-page":"251","article-title":"fast exponentiation in <formula formulatype=\"inline\"><tex notation=\"tex\">$gf(2^n)$<\/tex><\/formula>","volume":"330","author":"agnew","year":"1988","journal-title":"Proc Eurocrypt '88"},{"key":"ref35","first-page":"201","article-title":"Improved algorithms for elliptic curve arithmetic in <formula formulatype=\"inline\"><tex Notation=\"TeX\">$GF(2^n)$<\/tex><\/formula>","volume":"1556","author":"lpez","year":"1999","journal-title":"Proc SAC'98"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-44448-3_7","article-title":"security of signed elgamal encryption","volume":"1976","author":"schnorr","year":"2000","journal-title":"Proc ASIACRYPT 2000"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47555-9_18"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0053453"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/PL00003820","article-title":"elliptic curve cryptosystems over small fields of odd characteristic","volume":"12","author":"smart","year":"1999","journal-title":"J Cryptology"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","article-title":"faster point multiplication on elliptic curves with efficient endomorphisms","volume":"2139","author":"gallant","year":"2001","journal-title":"Proc Crypto 2001"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/11593447_4","article-title":"efficient and secure elliptic curve point multiplication using double-base chains","volume":"3788","author":"dimitrov","year":"2005","journal-title":"Proc Asiacrypt 2005"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/11554868_12","article-title":"an analysis of double base number systems and a sublinear scalar multiplication algorithm","volume":"3715","author":"ciet","year":"2005","journal-title":"Mycrypt 2005"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/11941378_24","article-title":"extended double-base number system with applications to elliptic curve cryptography","volume":"4329","author":"doche","year":"2006","journal-title":"Proc INDOCRYPT 2006"},{"key":"ref17","first-page":"390","article-title":"efficient quintuple formulas for elliptic curves and efficient scalar multiplication using multibase number representation","volume":"4779","author":"mishra","year":"2007","journal-title":"Proc ISCAS 2007"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77026-8_13"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77026-8_12"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056861"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008306223194"},{"key":"ref27","first-page":"332","article-title":"minimality of the hamming weight of the <formula formulatype=\"inline\"><tex notation=\"tex\">$\\tau$<\/tex><\/formula>-naf for koblitz curves and improved combination with point halving","volume":"3897","author":"avanzi","year":"2005","journal-title":"Proc SAC 2005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48658-5_11"},{"key":"ref6","first-page":"1","article-title":"software implementation of elliptic curve cryptography over binary fields","volume":"1965","author":"hankerson","year":"2000","journal-title":"Proc CHES"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-01-01310-2"},{"key":"ref5","year":"1999","journal-title":"Recommended Elliptic Curves for Federal Government Use"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180452"},{"key":"ref7","author":"hankerson","year":"2004","journal-title":"Guide to Elliptic Curve Cryptography"},{"key":"ref2","author":"knuth","year":"1998","journal-title":"The Art of Computer Programming Volume 2 Seminumerical Algorithms"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e91-d.5.1338"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_22"},{"key":"ref20","first-page":"433","article-title":"a tree-based approach for computing double-base chains","volume":"5107","author":"doche","year":"2008","journal-title":"Proc ACISP 2008"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/11958239_9","article-title":"scalar multiplication on koblitz curves using double bases","volume":"4341","author":"avanzi","year":"2006","journal-title":"Proc VIETCRYPT 2006"},{"key":"ref21","first-page":"502","article-title":"double-base number system for multi-scalar multiplications","volume":"5479","author":"doche","year":"2009","journal-title":"Proc EUROCRYPT 2009"},{"key":"ref24","first-page":"445","article-title":"FPGA implementation of point multiplication on Koblitz curves using Kleinian integers","volume":"4249","author":"dimitrov","year":"2006","journal-title":"Proc CHES 2006"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/11935230_9","article-title":"extending scalar multiplication using double bases","volume":"4284","author":"avanzi","year":"2006","journal-title":"Proc ASIACRYPT 2006"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24632-9_3"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.65"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5714236\/05714254.pdf?arnumber=5714254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:44:11Z","timestamp":1633913051000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5714254\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":36,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2059831","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}