{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T06:09:35Z","timestamp":1725689375767},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642314094"},{"type":"electronic","value":"9783642314100"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31410-0_21","type":"book-chapter","created":{"date-parts":[[2012,6,20]],"date-time":"2012-06-20T02:26:59Z","timestamp":1340159219000},"page":"342-359","source":"Crossref","is-referenced-by-count":5,"title":["Improved Fixed-Base Comb Method for Fast Scalar Multiplication"],"prefix":"10.1007","author":[{"given":"Nashwa A. F.","family":"Mohamed","sequence":"first","affiliation":[]},{"given":"Mohsin H. A.","family":"Hashim","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Hutter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Booth, A.D.: A signed binary multiplication technique. Q. J. Mech. Applied Math., 236\u2013240 (1951)","DOI":"10.1093\/qjmam\/4.2.236"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.5802\/jtnb.301","volume":"13","author":"W. Bosma","year":"2001","unstructured":"Bosma, W.: Signed bits and fast exponentiation. Jornal de Th\u00e9orie des Nombers de Bordeaux\u00a013, 27\u201341 (2001)","journal-title":"Jornal de Th\u00e9orie des Nombers de Bordeaux"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1090\/S0002-9904-1939-07068-7","volume":"45","author":"A. Brauer","year":"1939","unstructured":"Brauer, A.: On addition chains. Bull. Amer. Math. Soc.\u00a045, 736\u2013739 (1939)","journal-title":"Bull. Amer. Math. Soc."},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-47555-9_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"E.F. Brickell","year":"1993","unstructured":"Brickell, E.F., Gordon, D.M., McCurley, K.S., Wilson, D.B.: Fast Exponentiation with Precomputation (Extended Abstract). In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 200\u2013207. Springer, Heidelberg (1993)"},{"key":"21_CR5","volume-title":"Handbook of elliptic and hyperelliptic curve cryptography","author":"H. Cohen","year":"2006","unstructured":"Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of elliptic and hyperelliptic curve cryptography. Taylor and Francis Group, LLC (2006)"},{"key":"21_CR6","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.\u00a01717, pp. 292\u2013302. Springer, Heidelberg (1999)"},{"key":"21_CR7","unstructured":"Feng, M., Zhu, B.B., Xu, M., Li, S.: Efficient comb elliptic curve multiplication methods resistant to power analysis. IACR Cryptology ePrint Archive, 2005:222 (2005)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"D.M. Gordan","year":"1998","unstructured":"Gordan, D.M.: A survey of fast exponentiation methods. Journal of Algorithms\u00a027, 129\u2013146 (1998)","journal-title":"Journal of Algorithms"},{"key":"21_CR9","volume-title":"Guide to elliptic curve cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to elliptic curve cryptography. Springer, New York (2004)"},{"key":"21_CR10","unstructured":"Hedabou, M., Pinel, P., B\u00e9n\u00e9teau, L.: A comb method to render ecc resistant against side channel attacks. Paper submitted only to the Cryptology ePrint Archive. hedabou@insa-toulouse.fr 12754 (received, December 2, 2004)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-31979-5_8","volume-title":"Information Security Practice and Experience","author":"M. Hedabou","year":"2005","unstructured":"Hedabou, M., Pinel, P., B\u00e9n\u00e9teau, L.: Countermeasures for Preventing Comb Method Against SCA Attacks. In: Deng, R.H., Bao, F., Pang, H., Zhou, J. (eds.) ISPEC 2005. LNCS, vol.\u00a03439, pp. 85\u201396. Springer, Heidelberg (2005)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-36400-5_22","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"M. Joye","year":"2003","unstructured":"Joye, M., Yen, S.-M.: The Montgomery Powering Ladder. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 291\u2013302. Springer, Heidelberg (2003)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation\u00a048, 203\u2013220 (1987)","journal-title":"Mathematics of Computation"},{"key":"21_CR14","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 \u201996","author":"P.C. 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.\u00a01109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P.C. Kocher","year":"1999","unstructured":"Kocher, P.C., Jaffe, J., Jun, B.: Differential Power Analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 388\u2013397. Springer, Heidelberg (1999)"},{"key":"21_CR16","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":"C.H. Lim","year":"1994","unstructured":"Lim, C.H., Lee, P.J.: More Flexible Exponentiation with Precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 95\u2013107. Springer, Heidelberg (1994)"},{"key":"21_CR17","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.\u00a05580, pp. 334\u2013349. Springer, Heidelberg (2009)"},{"key":"21_CR18","unstructured":"Mangard, S., Oswald, E., Popp, T.: Power Analysis Attacks \u2013 Revealing the Secrets of Smart Cards. Springer (2007) ISBN 978-0-387-30857-9"},{"key":"21_CR19","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","author":"V.S. Miller","year":"1986","unstructured":"Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"P.L. Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the pollard and elliptic curve methods of factorization. Mathematics of Computation\u00a048, 243\u2013264 (1987)","journal-title":"Mathematics of Computation"},{"key":"21_CR21","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1051\/ita\/1990240605311","volume":"24","author":"F. Morain","year":"1989","unstructured":"Morain, F., Olivos, J.: Speeding up the computations on an elliptic curve using addition-subtraction chains. Theor. Inform. Appli.\u00a024, 531\u2013543 (1989)","journal-title":"Theor. Inform. Appli."},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0065-2458(08)60610-5","volume":"1","author":"G.W. Reitwiesner","year":"1960","unstructured":"Reitwiesner, G.W.: Binary arithmetic. Advances in Computers\u00a01, 231\u2013308 (1960)","journal-title":"Advances in Computers"},{"issue":"5","key":"21_CR23","first-page":"1075","volume":"E85-A","author":"Y. Sakai","year":"2002","unstructured":"Sakai, Y., Sakurai, K.: Speeding up elliptic scalar multiplication using multidoubling. IEICE Transactions Fundamentals\u00a0E85-A(5), 1075\u20131083 (2002)","journal-title":"IEICE Transactions Fundamentals"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-28632-5_22","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"Y. Sakai","year":"2004","unstructured":"Sakai, Y., Sakurai, K.: A New Attack with Side Channel Leakage During Exponent Recoding Computations. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol.\u00a03156, pp. 298\u2013311. Springer, Heidelberg (2004)"},{"key":"21_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1920-8","volume-title":"The arithmetic of elliptic curves","author":"J.H. Silverman","year":"1986","unstructured":"Silverman, J.H.: The arithmetic of elliptic curves, vol.\u00a0106. Springer, Berlin (1986)"},{"key":"21_CR26","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1008306223194","volume":"19","author":"J.A. Solinas","year":"2000","unstructured":"Solinas, J.A.: Effiecient arithmetic on koblitz curves. Designs, Codes and Cryptography\u00a019, 195\u2013249 (2000)","journal-title":"Designs, Codes and Cryptography"},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1215\/S0012-7094-73-04085-4","volume":"40","author":"E.G. Thurber","year":"1973","unstructured":"Thurber, E.G.: On addition chains l(mn)\u2009\u2264\u2009l(n)\u2009\u2212\u2009b and lower bounds for c(r). Duke Mathematical Journal\u00a040, 907\u2013913 (1973)","journal-title":"Duke Mathematical Journal"},{"key":"21_CR28","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.amc.2004.10.010","volume":"168","author":"W.-J. Tsaur","year":"2005","unstructured":"Tsaur, W.-J., Chou, C.-H.: Efficient algorithm for speeding up the computations of elliptic curve cryptosystem. Applied Mathematics and Computation\u00a0168, 1045\u20131064 (2005)","journal-title":"Applied Mathematics and Computation"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31410-0_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:59:28Z","timestamp":1620115168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31410-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642314094","9783642314100"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31410-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}