{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T17:07:20Z","timestamp":1749143240165,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030652760"},{"type":"electronic","value":"9783030652777"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-65277-7_11","type":"book-chapter","created":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T12:17:34Z","timestamp":1607343454000},"page":"248-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extending the Signed Non-zero Bit and Sign-Aligned Columns Methods to General Bases for Use in Cryptography"],"prefix":"10.1007","author":[{"given":"Abhraneel","family":"Dutta","sequence":"first","affiliation":[]},{"given":"Aaron","family":"Hutchinson","sequence":"additional","affiliation":[]},{"given":"Koray","family":"Karabina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,8]]},"reference":[{"key":"11_CR1","unstructured":"Explicit Formulas Database. https:\/\/hyperelliptic.org\/EFD\/"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Avizienis, A.: Signed-Digit Number Representations for Fast Parallel Arithmetic. IRE Transactions on Electronic Computers, EC-10, pp. 289\u2013400 (1961)","DOI":"10.1109\/TEC.1961.5219227"},{"key":"11_CR3","unstructured":"Avanzi, R., et al.: Handbook of Elliptic and Hyperelliptic Curve Cryptography, Second Edition. Chapman & Hall\/CRC, 2nd edition (2012)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1093\/qjmam\/4.2.236","volume":"4","author":"A Booth","year":"1951","unstructured":"Booth, A.: A signed binary multiplication technique. Q. J. Mech. Appl. Math. 4, 236\u2013240 (1951)","journal-title":"Q. J. Mech. Appl. Math."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/0-387-34805-0_37","volume-title":"Advances in Cryptology \u2014 CRYPTO 1989 Proceedings","author":"J Bos","year":"1990","unstructured":"Bos, J., Coster, M.: Addition chain heuristics. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 400\u2013407. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_37"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-662-48797-6_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"C Costello","year":"2015","unstructured":"Costello, C., Longa, P.: Four$$\\mathbb{Q}$$: four-dimensional decompositions on a $$\\mathbb{Q}$$-curve over the Mersenne Prime. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 214\u2013235. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_10"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22, 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-04852-9_1","volume-title":"Topics in Cryptology \u2013 CT-RSA 2014","author":"A Faz-Hern\u00e1ndez","year":"2014","unstructured":"Faz-Hern\u00e1ndez, A., Longa, P., S\u00e1nchez, A.H.: Efficient and secure algorithms for GLV-based scalar multiplication and their implementation on GLV-GLS curves. In: Benaloh, J. (ed.) CT-RSA 2014. LNCS, vol. 8366, pp. 1\u201327. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04852-9_1"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11689522_2","volume-title":"Information Security Practice and Experience","author":"M Feng","year":"2006","unstructured":"Feng, M., Zhu, B.B., Zhao, C., Li, S.: Signed MSB-set comb method for elliptic curve point multiplication. In: Chen, K., Deng, R., Lai, X., Zhou, J. (eds.) ISPEC 2006. LNCS, vol. 3903, pp. 13\u201324. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11689522_2"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-642-01001-9_30","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"SD Galbraith","year":"2009","unstructured":"Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 518\u2013535. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_30"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"RP Gallant","year":"2001","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190\u2013200. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_11"},{"key":"11_CR12","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.H., Zhou, J. (eds.) ISPEC 2005. LNCS, vol. 3439, pp. 85\u201396. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31979-5_8"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-030-05072-6_12","volume-title":"Security, Privacy, and Applied Cryptography Engineering","author":"H Hisil","year":"2018","unstructured":"Hisil, H., Hutchinson, A., Karabina, K.: d-MUL: optimizing and implementing a multidimensional scalar multiplication algorithm over elliptic curves. In: Chattopadhyay, A., Rebeiro, C., Yarom, Y. (eds.) SPACE 2018. LNCS, vol. 11348, pp. 198\u2013217. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05072-6_12"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-25405-5_2","volume-title":"Post-Quantum Cryptography","author":"D Jao","year":"2011","unstructured":"Jao, D., De Feo, L.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 19\u201334. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_2"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1049\/el:19890785","volume":"25","author":"J Jedwab","year":"1989","unstructured":"Jedwab, J., Mitchell, C.: Minimum weight modified signed-digit representations and fast exponentiation. Electron. Lett. 25, 1171\u20131172 (1989)","journal-title":"Electron. Lett."},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s102070100002","volume":"1","author":"D Johnson","year":"2001","unstructured":"Johnson, D., Menezes, A., Vanstone, S.: The Elliptic Curve Digital Signature Algorithm (ECDSA). Int. J. Inf. Secur. 1(1), 36\u201363 (2001). https:\/\/doi.org\/10.1007\/s102070100002","journal-title":"Int. J. Inf. Secur."},{"key":"11_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. 5580, pp. 334\u2013349. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02384-2_21"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Karabina, K.: A survey of scalar multiplication algorithms. In: Chung, F., Graham, R., Hoffman, F., Mullin, R.C., Hogben, L., West, D.B. (eds.) 50 years of Combinatorics, Graph Theory, and Computing, chapter 20, pp. 359\u2013386. Chapman and Hall\/CRC (2019)","DOI":"10.1201\/9780429280092-20"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology \u2014 CRYPTO 1994","author":"CH Lim","year":"1994","unstructured":"Lim, C.H., Lee, P.J.: More flexible exponentiation with precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 95\u2013107. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_11"},{"key":"11_CR20","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 \u2014 EUROCRYPT 1992","author":"EF Brickell","year":"1993","unstructured":"Brickell, E.F., Gordon, D.M., McCurley, K.S., Wilson, D.B.: Fast exponentiation with precomputation. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 200\u2013207. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-47555-9_18"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45439-X_22","volume-title":"Information Security","author":"B M\u00f6ller","year":"2001","unstructured":"M\u00f6ller, B.: Securing elliptic curve point multiplication against side-channel attacks. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol. 2200, pp. 324\u2013334. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45439-X_22"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1051\/ita\/1990240605311","volume":"24","author":"F Morain","year":"1990","unstructured":"Morain, F., Olivos, J.: Speeding up the computations on an elliptic curve using addition-subtraction chains. Theoret. Informat. Appl. 24, 531\u2013543 (1990)","journal-title":"Theoret. Informat. Appl."},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-36563-X_23","volume-title":"Topics in Cryptology \u2014 CT-RSA 2003","author":"K Okeya","year":"2003","unstructured":"Okeya, K., Takagi, T.: The width-w NAF method provides small memory and fast elliptic scalar multiplications secure against side channel attacks. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 328\u2013343. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36563-X_23"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Pippenger, N.: On the Evaluation of Powers and Related Problems. In: 17th Annual IEEE Symposium on Foundations of Computer Science, pp. 258\u2013263 (1976)","DOI":"10.1109\/SFCS.1976.21"},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1008306223194","volume":"19","author":"J Solinas","year":"2000","unstructured":"Solinas, J.: Efficient arithmetic on koblitz curves. Des. Codes Crypt. 19, 195\u2013249 (2000)","journal-title":"Des. Codes Crypt."},{"key":"11_CR26","first-page":"806","volume":"70","author":"E Straus","year":"1964","unstructured":"Straus, E.: Addition chains of vectors (problem 5125). Am. Math. Monthly 70, 806\u2013808 (1964)","journal-title":"Am. Math. Monthly"},{"key":"11_CR27","unstructured":"Xu, M., Feng, M., Zhu, B., Liu, S.: Efficient comb methods for elliptic curve point multiplication resistant to power analysis. Cryptology ePrint Archive, Report 2005\/22 (2005)"},{"key":"11_CR28","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0205008","volume":"5","author":"A Yao","year":"1976","unstructured":"Yao, A.: On the evaluation of powers. SIAM J. Comput. 5, 281\u2013307 (1976)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65277-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T22:28:43Z","timestamp":1617920923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65277-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030652760","9783030652777"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65277-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangalore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/indocrypt2020.iiitb.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"84","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.0","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}