{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:45:31Z","timestamp":1743011131849,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031228285"},{"type":"electronic","value":"9783031228292"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22829-2_7","type":"book-chapter","created":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T09:13:44Z","timestamp":1670318024000},"page":"118-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Protecting the\u00a0Most Significant Bits in\u00a0Scalar Multiplication Algorithms"],"prefix":"10.1007","author":[{"given":"Estuardo","family":"Alpirez Bock","sequence":"first","affiliation":[]},{"given":"Lukasz","family":"Chmielewski","sequence":"additional","affiliation":[]},{"given":"Konstantina","family":"Miteloudi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,7]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/10958513_17","volume-title":"Information Security","author":"T Akishita","year":"2003","unstructured":"Akishita, T., Takagi, T.: Zero-value point attacks on elliptic curve cryptosystem. In: Boyd, C., Mao, W. (eds.) ISC 2003. LNCS, vol. 2851, pp. 218\u2013233. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/10958513_17"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-030-34618-8_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"C Andrikos","year":"2019","unstructured":"Andrikos, C., et al.: Location, location, location: revisiting modeling and exploitation for location-based side channel leakages. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 285\u2013314. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_10"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Novaes, F.R., Takahashi, A., Tibouchi, M., Yarom, Y.: LadderLeak: breaking ECDSA with Less than One Bit of Nonce Leakage, pp. 225\u2013242. Association for Computing Machinery, New York (2020)","DOI":"10.1145\/3372297.3417268"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Batina, L., Chmielewski, L., Haase, B., Samwel, N., Schwabe, P.: Sca-secure ECC in software - mission impossible? IACR Cryptol. ePrint Arch., p. 1003 (2021)","DOI":"10.46586\/tches.v2023.i1.557-589"},{"key":"7_CR5","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-319-13039-2_2","volume-title":"INDOCRYPT 2014","author":"L Batina","year":"2014","unstructured":"Batina, L., Chmielewski, L., Papachristodoulou, L., Schwabe, P., Tunstall, M.: Online template attacks. In: Meier, W., Mukhopadhyay, D. (eds.) INDOCRYPT 2014. LNCS, vol. 8885, pp. 21\u201336. Springer, Heidelberg (2014)"},{"key":"7_CR6","unstructured":"Becker, G.T., et al.: Test vector leakage assessment (TVLA) methodology in practice. In: International Cryptographic Module Conference (2013)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11745853_14","volume-title":"Public Key Cryptography - PKC 2006","author":"DJ Bernstein","year":"2006","unstructured":"Bernstein, D.J.: Curve25519: new Diffie-Hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 207\u2013228. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_14"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-23951-9_9","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.-Y.: High-speed high-security signatures. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 124\u2013142. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_9"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-47238-6_12","volume-title":"Innovative Security Solutions for Information Technology and Communications","author":"E Alpirez Bock","year":"2016","unstructured":"Alpirez Bock, E., Dyka, Z., Langendoerfer, P.: Increasing the robustness of the montgomery kP-algorithm against SCA by modifying its initialization. In: Bica, I., Reyhanitabar, R. (eds.) SECITC 2016. LNCS, vol. 10006, pp. 167\u2013178. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47238-6_12"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-69053-0_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"D Boneh","year":"1997","unstructured":"Boneh, D., DeMillo, R.A., Lipton, R.J.: On the importance of checking cryptographic protocols for faults. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 37\u201351. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_4"},{"key":"7_CR11","series-title":"LNCS","first-page":"129","volume-title":"CRYPTO\u201996","author":"D Boneh","year":"1996","unstructured":"Boneh, D., Venkatesan, R.: Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes. In: Koblitz, N. (ed.) CRYPTO\u201996. LNCS, vol. 1109, pp. 129\u2013142. Springer, Heidelberg (1996)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Bosma, W., Lenstra, H.W.: Complete system of two addition laws for elliptic curves. J. Number Theory (1995)","DOI":"10.1006\/jnth.1995.1088"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-03332-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"W Castryck","year":"2018","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group Action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15"},{"key":"7_CR14","unstructured":"CryptoJedi. Micro salt: $$\\mu $$nacl - the networking and cryptography library for microcontrollers. http:\/\/munacl.cryptojedi.org\/curve25519-cortexm0.shtml"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"D\u00fcll, M., et al.: High-speed curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers. Des. Codes Cryptogr. 77(2\u20133), 493\u2013514 (2015)","DOI":"10.1007\/s10623-015-0087-1"},{"key":"7_CR16","unstructured":"De Feo, L., et al.: Sike channels. Cryptology ePrint Archive, Paper 2022\/054 (2022). https:\/\/eprint.iacr.org\/2022\/054"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-030-99766-3_8","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"A Gen\u00eat","year":"2022","unstructured":"Gen\u00eat, A., Kalu\u0111erovi\u0107, N.: Single-trace clustering power analysis of\u00a0the\u00a0point-swapping procedure in\u00a0the\u00a0three point ladder of\u00a0cortex-M4 SIKE. In: Balasch, J., O\u2019Flynn, C. (eds.) COSADE 2022. LNCS, vol. 13211, pp. 164\u2013192. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99766-3_8"},{"key":"7_CR18","unstructured":"Goodwill, G., Jun, B., Jaffe, J., Rohatgi, P.: A testing methodology for side-channel resistance validation, niat. Workshop record of the NIST Non-Invasive Attack Testing Workshop (2011). csrc.nist.gov\/CSRC\/media\/Events\/Non-Invasive-Attack-Testing-Workshop\/documents\/08Goodwill.pdf"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Guntur, H., Ishii, J., Satoh, A.: Side-channel attack user reference architecture board sakura-g. In: 2014 IEEE 3rd Global Conference on Consumer Electronics (GCCE), pp. 271\u2013274 (2014)","DOI":"10.1109\/GCCE.2014.7031104"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-08302-5_6","volume-title":"Smart Card Research and Advanced Applications","author":"J Heyszl","year":"2014","unstructured":"Heyszl, J., Ibing, A., Mangard, S., De Santis, F., Sigl, G.: Clustering algorithms for non-profiled single-execution attacks on exponentiations. In: Francillon, A., Rohatgi, P. (eds.) CARDIS 2013. LNCS, vol. 8419, pp. 79\u201393. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08302-5_6"},{"key":"7_CR21","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":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-48059-5_27","volume-title":"Cryptographic Hardware and Embedded Systems","author":"J L\u00f3pez","year":"1999","unstructured":"L\u00f3pez, J., Dahab, R.: Fast multiplication on elliptic curves over GF(2m) without precomputation. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 316\u2013327. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48059-5_27"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-00306-6_2","volume-title":"Information Security Applications","author":"M Medwed","year":"2009","unstructured":"Medwed, M., Oswald, E.: Template attacks on ECDSA. In: Chung, K.-I., Sohn, K., Yung, M. (eds.) WISA 2008. LNCS, vol. 5379, pp. 14\u201327. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00306-6_2"},{"issue":"177","key":"7_CR24","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243\u2013264 (1987)","journal-title":"Math. Comput."},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-75208-2_13","volume-title":"Smart Card Research and Advanced Applications","author":"E Nascimento","year":"2018","unstructured":"Nascimento, E., Chmielewski, \u0141: Applying horizontal clustering side-channel attacks on embedded ECC implementations. In: Eisenbarth, T., Teglia, Y. (eds.) CARDIS 2017. LNCS, vol. 10728, pp. 213\u2013231. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-75208-2_13"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Nascimento, E., Chmielewski, L., Oswald, D.F., Schwabe, P.: Attacking embedded ECC implementations through cmov side channels. In: Selected Areas in Cryptography - SAC 2016\u201323rd International Conference, St. John\u2019s, NL, Canada, 10\u201312 August, 2016, Revised Selected Papers, pp. 99\u2013119 (2016)","DOI":"10.1007\/978-3-319-69453-5_6"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Pirotte, N., Vliegen, J., Batina, L., Mentens, N.: Design of a fully balanced ASIC coprocessor implementing complete addition formulas on weierstrass elliptic curves. In: 2018 21st Euromicro Conference on Digital System Design (DSD), pp. 545\u2013552 (2018)","DOI":"10.1109\/DSD.2018.00095"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-662-49890-3_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Renes","year":"2016","unstructured":"Renes, J., Costello, C., Batina, L.: Complete addition formulas for prime order elliptic curves. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 403\u2013428. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_16"},{"key":"7_CR29","unstructured":"Certicom Research. Sec 2: Recommended elliptic curve domain parameters, version 2.0. www.secg.org\/sec2-v2.pdf"},{"key":"7_CR30","unstructured":"Riscure. Current probe. security test tool for embedded devices (2018). www.riscure.com\/product\/current-probe\/. Accessed 05 May 2021"},{"key":"7_CR31","unstructured":"Riscure. Side channel analysis security tools (2021). www.riscure.com\/security-tools\/inspector-sca\/"}],"container-title":["Lecture Notes in Computer Science","Security, Privacy, and Applied Cryptography Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22829-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,16]],"date-time":"2023-03-16T03:52:04Z","timestamp":1678938724000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22829-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031228285","9783031228292"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22829-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPACE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security, Privacy, and Applied Cryptography Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madras","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"space2022","order":10,"name":"conference_id","label":"Conference ID","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":"61","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":"18","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":"0","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":"30% - 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":"2.69","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":"2.4","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)"}}]}}