{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:31:33Z","timestamp":1743075093346,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031368394"},{"type":"electronic","value":"9783031368400"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-36840-0_15","type":"book-chapter","created":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T07:06:27Z","timestamp":1689923187000},"page":"334-361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Applying Boolean Masking to\u00a0Exponents"],"prefix":"10.1007","author":[{"given":"Michael","family":"Tunstall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louiza","family":"Papachristodoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas","family":"Papagiannopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,22]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-79966-5_10","volume-title":"Information Security Theory and Practices. Smart Devices, Convergence and Next Generation Networks","author":"F Amiel","year":"2008","unstructured":"Amiel, F., Feix, B.: On the BRIP Algorithms Security for RSA. In: Onieva, J.A., Sauveron, D., Chaumette, S., Gollmann, D., Markantonakis, K. (eds.) WISTP 2008. LNCS, vol. 5019, pp. 136\u2013149. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79966-5_10"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-319-16763-3_5","volume-title":"Smart Card Research and Advanced Applications","author":"J Balasch","year":"2015","unstructured":"Balasch, J., Gierlichs, B., Grosso, V., Reparaz, O., Standaert, F.-X.: On the Cost of Lazy Engineering for Masked Software Implementations. In: Joye, M., Moradi, A. (eds.) CARDIS 2014. LNCS, vol. 8968, pp. 64\u201381. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16763-3_5"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-319-13039-2_2","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2014","author":"L Batina","year":"2014","unstructured":"Batina, L., Chmielewski, \u0141, Papachristodoulou, L., Schwabe, P., Tunstall, M.: Online Template Attacks. In: Meier, W., Mukhopadhyay, D. (eds.) INDOCRYPT 2014. LNCS, vol. 8885, pp. 21\u201336. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13039-2_2"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-662-53140-2_2","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2016","author":"A Battistello","year":"2016","unstructured":"Battistello, A., Coron, J.-S., Prouff, E., Zeitoun, R.: Horizontal Side-Channel Attacks and Countermeasures on the ISW Masking Scheme. In: Gierlichs, B., Poschmann, A.Y. (eds.) CHES 2016. LNCS, vol. 9813, pp. 23\u201339. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53140-2_2"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-319-03515-4_7","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2013","author":"A Bauer","year":"2013","unstructured":"Bauer, A., Jaulmes, \u00c9.: Correlation Analysis against Protected SFM Implementations of RSA. In: Paul, G., Vaudenay, S. (eds.) INDOCRYPT 2013. LNCS, vol. 8250, pp. 98\u2013115. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03515-4_7"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-662-43414-7_28","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"A Bauer","year":"2014","unstructured":"Bauer, A., Jaulmes, E., Prouff, E., Wild, J.: Horizontal Collision Correlation Attack on Elliptic Curves. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 553\u2013570. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43414-7_28"},{"key":"15_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":"15_CR8","unstructured":"Bernstein, D.J., Lange, T.: A complete set of addition laws for incomplete edwards curves. Cryptology ePrint Archive, Report 2009\/580 (2009), https:\/\/eprint.iacr.org\/2009\/580"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s13389-015-0097-y","volume":"6","author":"JW Bos","year":"2016","unstructured":"Bos, J.W., Costello, C., Longa, P., Naehrig, M.: Selecting elliptic curves for cryptography: an efficiency and security analysis. J. Cryptographic Eng. 6(4), 259\u2013286 (2016)","journal-title":"J. Cryptographic Eng."},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-28632-5_2","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"E Brier","year":"2004","unstructured":"Brier, E., Clavier, C., Olivier, F.: Correlation Power Analysis with a Leakage Model. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 16\u201329. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28632-5_2"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45664-3_24","volume-title":"Public Key Cryptography","author":"\u00c9 Brier","year":"2002","unstructured":"Brier, \u00c9., Joye, M.: Weierstra\u00df Elliptic Curves and Side-Channel Attacks. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 335\u2013345. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45664-3_24"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-36400-5_3","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"S Chari","year":"2003","unstructured":"Chari, S., Rao, J.R., Rohatgi, P.: Template Attacks. In: Kaliski, B.S., Ko\u00e7, K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 13\u201328. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36400-5_3"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-39927-8_32","volume-title":"Information and Communications Security","author":"M Ciet","year":"2003","unstructured":"Ciet, M., Joye, M.: (Virtually) Free Randomization Techniques for Elliptic Curve Cryptography. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol. 2836, pp. 348\u2013359. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39927-8_32"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-34931-7_9","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"C Clavier","year":"2012","unstructured":"Clavier, C., Feix, B., Gagnerot, G., Giraud, C., Roussellet, M., Verneuil, V.: ROSETTA for Single Trace Analysis. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 140\u2013155. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_9"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-44709-1_25","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2001","author":"C Clavier","year":"2001","unstructured":"Clavier, C., Joye, M.: Universal Exponentiation Algorithm A First Step towards Provable SPA-Resistance. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 300\u2013308. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44709-1_25"},{"key":"15_CR16","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. 1717, pp. 292\u2013302. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48059-5_25"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Ebeid, N.M., Lambert, R.: A new CRT-RSA algorithm resistant to powerful fault attacks. In: WESS 2010. p. 8. ACM (2010)","DOI":"10.1145\/1873548.1873556"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Edwards, H.M.: A normal form for elliptic curves. In: \u00c7etin.K. Ko\u00e7, Paar, C. (eds.) Bulletin of the American Mathematical Society. vol. 44, pp. 393\u2013422 (2007)","DOI":"10.1090\/S0273-0979-07-01153-6"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-13039-2_1","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2014","author":"B Feix","year":"2014","unstructured":"Feix, B., Roussellet, M., Venelli, A.: Side-Channel Analysis on Blinded Regular Scalar Multiplications. In: Meier, W., Mukhopadhyay, D. (eds.) INDOCRYPT 2014. LNCS, vol. 8885, pp. 3\u201320. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13039-2_1"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-44709-1_21","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2001","author":"K Gandolfi","year":"2001","unstructured":"Gandolfi, K., Mourtel, C., Olivier, F.: Electromagnetic Analysis: Concrete Results. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 251\u2013261. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44709-1_21"},{"key":"15_CR21","unstructured":"Goodwill, G., Jun, B., Jaffe, J., Rohatgi, P.: A testing methodology for side channel resistance validation NIST non-invasive attack testing workshop (2011)"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-44709-1_2","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2001","author":"L Goubin","year":"2001","unstructured":"Goubin, L.: A Sound Method for Switching between Boolean and Arithmetic Masking. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 3\u201315. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44709-1_2"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-36288-6_15","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"L Goubin","year":"2003","unstructured":"Goubin, L.: A Refined Power-Analysis Attack on Elliptic Curve Cryptosystems. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 199\u2013211. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_15"},{"key":"15_CR24","unstructured":"Hamburg, M.: Ed448-Goldilocks, a new elliptic curve. Cryptology ePrint Archive, Report 2015\/625 (2015). http:\/\/eprint.iacr.org\/2015\/625"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-319-16715-2_23","volume-title":"Topics in Cryptology \u2013- CT-RSA 2015","author":"N Hanley","year":"2015","unstructured":"Hanley, N., Kim, H.S., Tunstall, M.: Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace. In: Nyberg, K. (ed.) CT-RSA 2015. LNCS, vol. 9048, pp. 431\u2013448. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16715-2_23"},{"issue":"3","key":"15_CR26","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1011214926272","volume":"23","author":"N Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N., Smart, N.P.: Lattice attacks on digital signature schemes. Des. Codes Cryptography 23(3), 283\u2013290 (2001)","journal-title":"Des. Codes Cryptography"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Itoh, K., Izu, T., Takenada, M.: Address-bit differential power analysis of cryptographic schemes OK-ECDH and OK-ECDSA. In: Jr., B.S.K., \u00c7. K. Ko\u00e7, Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 129\u2013143. Springer (2002)","DOI":"10.1007\/3-540-36400-5_11"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-45238-6_30","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"K Itoh","year":"2003","unstructured":"Itoh, K., Izu, T., Takenaka, M.: A Practical Countermeasure against Address-Bit Differential Power Analysis. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 382\u2013396. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45238-6_30"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Izumi, M., Ikegami, J., Sakiyama, K., Ohta, K.: Improved countermeasures against address-bit DPA for ECC scalar multiplication. In: Michell, G.D., Al-Hashimi, B.M., M\u00fcller, W., Macii, E. (eds.) DATE 2010. pp. 981\u2013984. IEEE (2010)","DOI":"10.1109\/DATE.2010.5456907"},{"key":"15_CR30","unstructured":"Joye, M., Villegas, K.: A protected division algorithm. In: Honeyman, P. (ed.) CARDIS 2002. USENIX (2002)"},{"key":"15_CR31","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, B.S., Ko\u00e7, K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 291\u2013302. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36400-5_22"},{"issue":"1","key":"15_CR32","doi-asserted-by":"publisher","first-page":"102","DOI":"10.4218\/etrij.10.0109.0249","volume":"32","author":"H Kim","year":"2010","unstructured":"Kim, H., Kim, T.H., Yoon, J.C., Hong, S.: Practical second-order correlation power analysis on the message blinding method and its novel countermeasure for RSA. ETRI J. 32(1), 102\u2013111 (2010)","journal-title":"ETRI J."},{"key":"15_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"PC 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. 1109, pp. 104\u2013113. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_9"},{"key":"15_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"P Kocher","year":"1999","unstructured":"Kocher, P., Jaffe, J., Jun, B.: Differential Power Analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 388\u2013397. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_25"},{"key":"15_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-24018-3_11","volume-title":"Information Security Theory and Practice","author":"D-P Le","year":"2015","unstructured":"Le, D.-P., Tan, C.H., Tunstall, M.: Randomizing the Montgomery Powering Ladder. In: Akram, R.N., Jajodia, S. (eds.) WISTP 2015. LNCS, vol. 9311, pp. 169\u2013184. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24018-3_11"},{"key":"15_CR36","unstructured":"Lochter, M., Merkle, J., Schmidt, J.M., Sch\u00fctze, T.: Requirements for standard elliptic curves. Cryptology ePrint Archive, Report 2014\/832 (2014), https:\/\/eprint.iacr.org\/2014\/832"},{"key":"15_CR37","unstructured":"Messerges, T.S., Dabbish, E.A.: Investigations of power analysis attacks on smartcards. In: Guthery, S.B., Honeyman, P. (eds.) Smartcard 1999. USENIX Association (1999)"},{"key":"15_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-48059-5_14","volume-title":"Cryptographic Hardware and Embedded Systems","author":"TS Messerges","year":"1999","unstructured":"Messerges, T.S., Dabbish, E.A., Sloan, R.H.: Power Analysis Attacks of Modular Exponentiation in Smartcards. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 144\u2013157. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48059-5_14"},{"issue":"177","key":"15_CR39","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":"15_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-30580-4_3","volume-title":"Public Key Cryptography - PKC 2005","author":"D Naccache","year":"2005","unstructured":"Naccache, D., Nguy\u00ean, P.Q., Tunstall, M., Whelan, C.: Experimenting with Faults, Lattices and the DSA. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 16\u201328. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30580-4_3"},{"key":"15_CR41","unstructured":"National Institute of Standards and Technology (NIST): Recommended elliptic curves for federal government use. In the appendix of FIPS 186\u20133. (2009) http:\/\/csrc.nist.gov\/publications\/fips\/fips186-3\/fips_186-3.pdf"},{"key":"15_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-45811-5_30","volume-title":"Information Security","author":"K Okeya","year":"2002","unstructured":"Okeya, K., Sakurai, K.: A Second-Order DPA Attack Breaks a Window-Method Based Countermeasure against Side Channel Attacks. In: Chan, A.H., Gligor, V. (eds.) ISC 2002. LNCS, vol. 2433, pp. 389\u2013401. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45811-5_30"},{"key":"15_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/11967668_16","volume-title":"Topics in Cryptology \u2013 CT-RSA 2007","author":"E Oswald","year":"2006","unstructured":"Oswald, E., Mangard, S.: Template Attacks on Masking\u2014Resistance Is Futile. In: Abe, M. (ed.) CT-RSA 2007. LNCS, vol. 4377, pp. 243\u2013256. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11967668_16"},{"key":"15_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45418-7_17","volume-title":"Smart Card Programming and Security","author":"J-J Quisquater","year":"2001","unstructured":"Quisquater, J.-J., Samyde, D.: ElectroMagnetic Analysis (EMA): Measures and Counter-measures for Smart Cards. In: Attali, I., Jensen, T. (eds.) E-smart 2001. LNCS, vol. 2140, pp. 200\u2013210. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45418-7_17"},{"issue":"2","key":"15_CR45","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.M.: Method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"15_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-21554-4_5","volume-title":"Applied Cryptography and Network Security","author":"W Schindler","year":"2011","unstructured":"Schindler, W., Itoh, K.: Exponent Blinding Does Not Always Lift (Partial) Spa Resistance to Higher-Level Security. In: Lopez, J., Tsudik, G. (eds.) ACNS 2011. LNCS, vol. 6715, pp. 73\u201390. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21554-4_5"},{"key":"15_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-662-48324-4_25","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2015","author":"T Schneider","year":"2015","unstructured":"Schneider, T., Moradi, A.: Leakage Assessment Methodology. In: G\u00fcneysu, T., Handschuh, H. (eds.) CHES 2015. LNCS, vol. 9293, pp. 495\u2013513. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48324-4_25"},{"issue":"2","key":"15_CR48","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1049\/iet-ifs:20070017","volume":"2","author":"N Smart","year":"2008","unstructured":"Smart, N., Oswald, E., Page, D.: Randomised representations. IET Proc. Inf. Secur. 2(2), 19\u201327 (2008)","journal-title":"IET Proc. Inf. Secur."},{"key":"15_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-642-01001-9_26","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"F-X Standaert","year":"2009","unstructured":"Standaert, F.-X., Malkin, T.G., Yung, M.: A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 443\u2013461. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_26"},{"key":"15_CR50","doi-asserted-by":"crossref","unstructured":"Tunstall, M., Papachristodoulou, L., Papagiannopoulos, K.: Boolean exponent splitting. In: di Vimercati, S.D.C., Samarati, P. (eds.) Proceedings of the 18th International Conference on Security and Cryptography, SECRYPT 2021. pp. 321\u2013332. SCITEPRESS (2021)","DOI":"10.5220\/0010570900002998"},{"key":"15_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-44709-1_24","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2001","author":"CD Walter","year":"2001","unstructured":"Walter, C.D.: Sliding Windows Succumbs to Big Mac Attack. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 286\u2013299. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44709-1_24"},{"key":"15_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/BFb0054867","volume-title":"Algorithmic Number Theory","author":"E De Win","year":"1998","unstructured":"De Win, E., Mister, S., Preneel, B., Wiener, M.: On the performance of signature schemes based on elliptic curves. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 252\u2013266. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054867"},{"key":"15_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-19074-2_6","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"MF Witteman","year":"2011","unstructured":"Witteman, M.F., van Woudenberg, J.G.J., Menarini, F.: Defeating RSA Multiply-Always and Message Blinding Countermeasures. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 77\u201388. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19074-2_6"}],"container-title":["Communications in Computer and Information Science","E-Business and Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36840-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T07:10:34Z","timestamp":1689923434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36840-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031368394","9783031368400"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36840-0_15","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICETE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on E-Business and Telecommunications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icete2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ice-business.org\/","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":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"197","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":"17","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":"9% - 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","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","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}