{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T01:49:55Z","timestamp":1790646595878,"version":"4.1.0"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2015,8,1]],"date-time":"2015-08-01T00:00:00Z","timestamp":1438387200000},"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. Comput."],"published-print":{"date-parts":[[2015,8,1]]},"DOI":"10.1109\/tc.2014.2360539","type":"journal-article","created":{"date-parts":[[2014,9,26]],"date-time":"2014-09-26T15:26:53Z","timestamp":1411745213000},"page":"2204-2212","source":"Crossref","is-referenced-by-count":11,"title":["Efficient Double Bases for Scalar Multiplication"],"prefix":"10.1109","volume":"64","author":[{"given":"Nicolas","family":"Meloni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M. Anwar","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77224-8_4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(86)90023-0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77026-8_11"},{"key":"ref13","article-title":"An intersection form for Jacobi-quartic curves","author":"hisil","year":"2008","journal-title":"Personal Comm"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.05.012"},{"key":"ref15","first-page":"391","article-title":"Preventing SPA\/DPA in ECC systems using the Jacobi form","author":"liardet","year":"2001","journal-title":"Proc 3rd Int Workshop Cryptographic Hardware Embedded Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75496-1_26"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78440-1_14"},{"key":"ref18","author":"bernstein","year":"0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77026-8_13"},{"key":"ref4","first-page":"59","article-title":"Efficient and secure elliptic curve point multiplication using double-base chains","volume":"3788","author":"dimitrov","year":"2005","journal-title":"Proc 11th Int Conf Theory Appl Cryptol Inf Security"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/11941378_24"},{"key":"ref6","author":"hankerson","year":"2004","journal-title":"Guide to Elliptic Curve Cryptography"},{"key":"ref5","author":"cohen","year":"2006","journal-title":"Handbook of Elliptic and Hyperelliptic Cryptography"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-07-01153-6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/11745853_13"},{"key":"ref2","first-page":"70","article-title":"On converting numbers to the double-base number system","volume":"5559","author":"berth\u00e9","year":"2004","journal-title":"Proc SPIE Conf Adv Signal Process Algorithms Arch Implementations"},{"key":"ref1","first-page":"82","article-title":"Two algorithms for modular exponentiation using nonstandard arithmetics","volume":"78","author":"dimitrov","year":"1995","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76900-2_3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0205008"},{"key":"ref22","first-page":"159","article-title":"On the maximal distance between integers composed of small primes","volume":"28","author":"tijdeman","year":"1974","journal-title":"Compositio Math"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00044-1"},{"key":"ref24","article-title":"Efficient hardware implementation of cryptographic primitives","author":"knezevic","year":"2011"},{"key":"ref23","first-page":"443","article-title":"Setting speed records with the (fractional) multibase non-adjacent form method for efficient elliptic curve scalar multiplication","volume":"5443","author":"longa","year":"2009","journal-title":"Proc Int'l Conf Public Key Cryptography"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7151894\/06911966.pdf?arnumber=6911966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:01:08Z","timestamp":1641985268000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6911966\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,1]]},"references-count":24,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tc.2014.2360539","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2015,8,1]]}}}