{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:44:56Z","timestamp":1729611896596,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1109\/isda.2010.5687240","type":"proceedings-article","created":{"date-parts":[[2011,1,13]],"date-time":"2011-01-13T16:33:25Z","timestamp":1294936405000},"page":"342-347","source":"Crossref","is-referenced-by-count":0,"title":["Efficient scalar multiplication based on window algorithm with 2's complement applied for elliptic curve cryptosystems"],"prefix":"10.1109","author":[{"given":"M. Abd-Eldayem","family":"Mohamed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. Alnfrawy","family":"Ehab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. Fahmy","family":"Aly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0913"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.5802\/jtnb.301"},{"key":"ref12","first-page":"369384","article-title":"Minimality and other properties of the width-w nonadjacent form","volume":"75","author":"muir","year":"2006","journal-title":"Mathematics of Computation"},{"journal-title":"Guide to Elliptic Curve Cryptography[M","year":"2004","author":"hankerson","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36552-4_21"},{"key":"ref15","article-title":"Efficient and secure elliptic curve point multiplication using double-base chains","author":"dimitrov","year":"0","journal-title":"Advances in Cryptology ASIACRYPT 05 Lecture Notes In Computer Science 2005"},{"key":"ref16","article-title":"Fast exponentiation with precomputation","author":"brickell","year":"1992","journal-title":"Adv in Cryptology - CRYPTO'92 Lecture Notes in Comput Sci"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0205008"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48658-5_11"},{"key":"ref19","article-title":"Spa resistant scalar multiplication using golden ratio addition chain method","volume":"38","author":"goundar","year":"2008","journal-title":"IAENG International Journal of Applied Mathematics"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","article-title":"Secure integration of asymmetric and symmetric encryption schemes","volume":"1666","author":"fujisaki","year":"1999","journal-title":"Advances in Cryptology CRYPTO '99 Lecture Notes in Computer Science"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028457"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022595222606"},{"journal-title":"ANSI X9 42–2000 1999","article-title":"Public key cryptography for the financial services industry: Agreement of symmetric keys using discrete logarithm cryptography","year":"0","key":"ref5"},{"key":"ref8","article-title":"Addition-subtraction chain for 160 bit integers by using 2's complement","author":"abd-eldayem","year":"0","journal-title":"Egyptian Computer Science Journal"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s102070100002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39799-X_31"},{"article-title":"The Art of Computer Programming: Seminumerical Algorithms","year":"1998","author":"knuth","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"ref20","first-page":"189","article-title":"New point addition formulae for ecc applications","volume":"4547","author":"meloni","year":"2007","journal-title":"WAIFI 2007 ser LNCS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107360211"},{"journal-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography' Discrete Mathematics and Applications","year":"2006","author":"avanzi","key":"ref21"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","article-title":"Efficient Elliptic Curve Exponentiation Using Mixed Coordinates, in Advances in Cryptology-ASIACRYPT98","volume":"1514","author":"cohen","year":"1998","journal-title":"Lecture Notes in Computer Science"},{"year":"2009","key":"ref23","article-title":"Multiprecision Integer and Rational Arithmetic C\/c++ Library (MIRACL)"},{"key":"ref26","article-title":"Fast implementation of elliptic curve arithmetic in GF(pm)","author":"lim","year":"0","journal-title":"Lecture Notes in Computer Science of Public Key Cryptography 2000"},{"key":"ref25","article-title":"Efficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery of the y-coordinate on a montgomery form elliptic curve","author":"okeya","year":"0","journal-title":"Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems CHES 01 Lecture Notes In Computer Science 2001"}],"event":{"name":"2010 10th International Conference on Intelligent Systems Design and Applications (ISDA)","start":{"date-parts":[[2010,11,29]]},"location":"Cairo, Egypt","end":{"date-parts":[[2010,12,1]]}},"container-title":["2010 10th International Conference on Intelligent Systems Design and Applications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5681599\/5687016\/05687240.pdf?arnumber=5687240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T14:20:10Z","timestamp":1497882010000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5687240\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isda.2010.5687240","relation":{},"subject":[],"published":{"date-parts":[[2010,11]]}}}