{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:54:52Z","timestamp":1779900892049,"version":"3.53.1"},"publisher-location":"Cham","reference-count":65,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229718","type":"print"},{"value":"9783031229725","type":"electronic"}],"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-22972-5_18","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:35:48Z","timestamp":1674560148000},"page":"508-536","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Third is All You Need: Extended Partial Key Exposure Attack on\u00a0CRT-RSA with\u00a0Additive Exponent Blinding"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8703-219X","authenticated-orcid":false,"given":"Yuanyuan","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joop","family":"van de Pol","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9278-4521","authenticated-orcid":false,"given":"Yu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7444-0285","authenticated-orcid":false,"given":"Fran\u00e7ois-Xavier","family":"Standaert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-030-77870-5_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"MR Albrecht","year":"2021","unstructured":"Albrecht, M.R., Heninger, N.: On bounded distance decoding with predicate: breaking the \u201clattice barrier\u2019\u2019 for the hidden number problem. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part I. LNCS, vol. 12696, pp. 528\u2013558. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_19"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Aldaya, A.C., Garc\u00eda, C.P., Tapia, L.M.A., Brumley, B.B.: Cache-timing attacks on RSA key generation. IACR TCHES 2019(4), 213\u2013242 (2019). https:\/\/doi.org\/10.13154\/tches.v2019.i4.213-242. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8350","DOI":"10.13154\/tches.v2019.i4.213-242"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-00468-1_3","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"Y Aono","year":"2009","unstructured":"Aono, Y.: A new lattice construction for partial key exposure attack for RSA. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 34\u201353. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00468-1_3"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-29912-4_7","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"S Bauer","year":"2012","unstructured":"Bauer, S.: Attacking exponent blinding in RSA without CRT. In: Schindler, W., Huss, S.A. (eds.) COSADE 2012. LNCS, vol. 7275, pp. 82\u201388. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29912-4_7"},{"key":"18_CR5","unstructured":"bbuhrow: YAFU, Automated integer factorization Version: 2.0.8 (2022). https:\/\/github.com\/bbuhrow\/yafu"},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Boneh, D., Durfee, G., Frankel, Y.: An attack on RSA given a small fraction of the private key bits. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 25\u201334. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49649-1_3","DOI":"10.1007\/3-540-49649-1_3"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-45146-4_2","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J Bl\u00f6mer","year":"2003","unstructured":"Bl\u00f6mer, J., May, A.: New partial key exposure attacks on RSA. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 27\u201343. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_2"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Bos, J., Stam, M. (eds.): Computational Cryptography: Algorithmic Aspects of Cryptology. London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge (2021). https:\/\/doi.org\/10.1017\/9781108854207","DOI":"10.1017\/9781108854207"},{"key":"18_CR9","unstructured":"Botan: Botan, a Crypto and TLS for Modern C++ library, Version: 2.19.1 (2022). https:\/\/github.com\/randombit\/botan. https:\/\/github.com\/randombit\/botan\/blob\/master\/src\/lib\/pubkey\/rsa\/rsa.cpp"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/978-3-030-26948-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"O Bronchain","year":"2019","unstructured":"Bronchain, O., Hendrickx, J.M., Massart, C., Olshevsky, A., Standaert, F.-X.: Leakage certification revisited: bounding model errors in side-channel security evaluations. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part I. LNCS, vol. 11692, pp. 713\u2013737. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_25"},{"key":"18_CR11","unstructured":"BSI: BSI AIS46 RSA SCA Resistance Guideline, Minimum Requirements for Evaluating Side-Channel Attack Resistance of RSA, DSA and Diffie-Hellman Key Exchange Implementations Version: 1.0 (2013). https:\/\/www.bsi.bund.de\/SharedDocs\/Downloads\/DE\/BSI\/Zertifizierung\/Interpretationen\/AIS_46_BSI_guidelines_SCA_RSA_V1_0_e_pdf.pdf?__blob=publicationFile &v=1"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-66787-4_3","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2017","author":"E Cagli","year":"2017","unstructured":"Cagli, E., Dumas, C., Prouff, E.: Convolutional neural networks with data augmentation against jitter-based countermeasures. In: Fischer, W., Homma, N. (eds.) CHES 2017. LNCS, vol. 10529, pp. 45\u201368. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66787-4_3"},{"key":"18_CR13","doi-asserted-by":"publisher","unstructured":"Carbone, M., et al.: Deep learning to evaluate secure RSA implementations. IACR TCHES 2019(2), 132\u2013161 (2019). https:\/\/doi.org\/10.13154\/tches.v2019.i2.132-161. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/7388","DOI":"10.13154\/tches.v2019.i2.132-161"},{"key":"18_CR14","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":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-17650-0_5","volume-title":"Information and Communications Security","author":"C Clavier","year":"2010","unstructured":"Clavier, C., Feix, B., Gagnerot, G., Roussellet, M., Verneuil, V.: Horizontal correlation analysis on exponentiation. In: Soriano, M., Qing, S., L\u00f3pez, J. (eds.) ICICS 2010. LNCS, vol. 6476, pp. 46\u201361. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17650-0_5"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-68339-9_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"D Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a bivariate integer equation; factoring with high bits known. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 178\u2013189. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_16"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"D Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a univariate modular equation. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 155\u2013165. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_14"},{"issue":"4","key":"18_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptol. 10(4), 233\u2013260 (1997). https:\/\/doi.org\/10.1007\/s001459900030","journal-title":"J. Cryptol."},{"key":"18_CR19","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":"18_CR20","doi-asserted-by":"crossref","unstructured":"Diaconis, P., Erd\u00f6s, P.: On the distribution of the greatest common divisor. In: A Festschrift for Herman Rubin, pp. 56\u201361. Institute of Mathematical Statistics (2004)","DOI":"10.1214\/lnms\/1196285379"},{"issue":"1","key":"18_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s13389-018-0181-1","volume":"9","author":"I Diop","year":"2018","unstructured":"Diop, I., Linge, Y., Ordas, T., Liardet, P.-Y., Maurine, P.: From theory to practice: horizontal attacks on protected implementations of modular exponentiations. J. Cryptogr. Eng. 9(1), 37\u201352 (2018). https:\/\/doi.org\/10.1007\/s13389-018-0181-1","journal-title":"J. Cryptogr. Eng."},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Dugardin, M., Schindler, W., Guilley, S.: Stochastic methods defeat regular RSA exponentiation algorithms with combined blinding methods. J. Math. Cryptol. 15(1), 408\u2013433 (2021). https:\/\/doi.org\/10.1515\/jmc-2020-0010","DOI":"10.1515\/jmc-2020-0010"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/11426639_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M Ernst","year":"2005","unstructured":"Ernst, M., Jochemsz, E., May, A., de Weger, B.: Partial key exposure attacks on RSA up to full size exponents. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 371\u2013386. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_22"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11894063_27","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"P-A Fouque","year":"2006","unstructured":"Fouque, P.-A., Kunz-Jacques, S., Martinet, G., Muller, F., Valette, F.: Power attack on small RSA public exponent. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 339\u2013353. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11894063_27"},{"key":"18_CR25","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press, Cambridge (2016). http:\/\/www.deeplearningbook.org"},{"key":"18_CR26","unstructured":"Guyon, I.: A scaling law for the validation-set training-set size ratio. In: AT & T Bell Laboratories (1997)"},{"key":"18_CR27","unstructured":"Halderman, J.A., et al.: Lest we remember: cold boot attacks on encryption keys. In: van Oorschot, P.C. (ed.) USENIX Security 2008, San Jose, CA, USA, 28 July\u20131 August 2008, pp. 45\u201360. USENIX Association (2008)"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-03356-8_1","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"N Heninger","year":"2009","unstructured":"Heninger, N., Shacham, H.: Reconstructing RSA private keys from random key bits. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 1\u201317. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_1"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-04138-9_10","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2009","author":"M Hlav\u00e1\u010d","year":"2009","unstructured":"Hlav\u00e1\u010d, M.: Known\u2013plaintext\u2013only attack on RSA\u2013CRT with montgomery multiplication. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol. 5747, pp. 128\u2013140. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04138-9_10"},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Crytography and Coding","author":"N Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham, N.: Finding small roots of univariate modular equations revisited. In: Darnell, M. (ed.) Cryptography and Coding 1997. LNCS, vol. 1355, pp. 131\u2013142. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0024458"},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-44670-2_6","volume-title":"Cryptography and Lattices","author":"N Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N.: Approximate integer common divisors. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 51\u201366. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44670-2_6"},{"key":"18_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-29101-2_25","volume-title":"Information Security Practice and Experience","author":"M Joye","year":"2012","unstructured":"Joye, M., Lepoint, T.: Partial key exposure on RSA with private exponents larger than N. In: Ryan, M.D., Smyth, B., Wang, G. (eds.) ISPEC 2012. LNCS, vol. 7232, pp. 369\u2013380. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29101-2_25"},{"key":"18_CR33","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":"10","key":"18_CR34","doi-asserted-by":"publisher","first-page":"947","DOI":"10.2514\/8.5282","volume":"30","author":"HJ Kelley","year":"1960","unstructured":"Kelley, H.J.: Gradient theory of optimal flight paths. Ars J. 30(10), 947\u2013954 (1960)","journal-title":"Ars J."},{"key":"18_CR35","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":"18_CR36","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A Lenstra","year":"1982","unstructured":"Lenstra, A., Lenstra, H., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"18_CR37","unstructured":"Libgcrypt: Libgcrypt, the gnu crypto library, Version: 1.9.0 (2021). https:\/\/github.com\/gpg\/libgcrypt. https:\/\/github.com\/gpg\/libgcrypt\/blob\/master\/cipher\/rsa.c"},{"key":"18_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-319-07536-5_10","volume-title":"Applied Cryptography and Network Security","author":"Y Lu","year":"2014","unstructured":"Lu, Y., Zhang, R., Lin, D.: New partial key exposure attacks on CRT-RSA with large public exponents. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 151\u2013162. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07536-5_10"},{"key":"18_CR39","unstructured":"Maghrebi, H.: Deep learning based side-channel attack: a new profiling methodology based on multi-label classification. Cryptology ePrint Archive, Report 2020\/436 (2020). https:\/\/eprint.iacr.org\/2020\/436"},{"key":"18_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-38162-6","volume-title":"Power Analysis Attacks - Revealing the Secrets of Smart Cards","author":"S Mangard","year":"2007","unstructured":"Mangard, S., Oswald, E., Popp, T.: Power Analysis Attacks - Revealing the Secrets of Smart Cards. Springer, New York (2007). https:\/\/doi.org\/10.1007\/978-0-387-38162-6"},{"key":"18_CR41","doi-asserted-by":"publisher","unstructured":"Masure, L., Dumas, C., Prouff, E.: A comprehensive study of deep learning for side-channel analysis. IACR TCHES 2020(1), 348\u2013375 (2019). https:\/\/doi.org\/10.13154\/tches.v2020.i1.348-375. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8402","DOI":"10.13154\/tches.v2020.i1.348-375"},{"key":"18_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-030-92062-3_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"A May","year":"2021","unstructured":"May, A., Nowakowski, J., Sarkar, S.: Partial key exposure attack on\u00a0short secret exponent CRT-RSA. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, Part I. LNCS, vol. 13090, pp. 99\u2013129. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_4"},{"key":"18_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-031-07082-2_6","volume-title":"Advances in Cryptology","author":"A May","year":"2022","unstructured":"May, A., Nowakowski, J., Sarkar, S.: Approximate divisor multiples - factoring with only a third of the secret CRT-exponents. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part III. LNCS, vol. 13277, pp. 147\u2013167. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_6"},{"key":"18_CR44","unstructured":"MbedTLS: MbedTLS, a TLS and SSL library, Version: 3.1.0 (2021). https:\/\/github.com\/Mbed-TLS\/mbedtls. https:\/\/github.com\/Mbed-TLS\/mbedtls\/blob\/development\/library\/rsa.c"},{"key":"18_CR45","unstructured":"NIST: FIPS PUB 186\u20134, Digital Signature Standard (DSS) (FIPS 186-4) (2013). https:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.186-4.pdf"},{"key":"18_CR46","unstructured":"Paszke, A., et al.: Pytorch: an imperative style, high-performance deep learning library. In: Wallach, H.M., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E.B., Garnett, R. (eds.) Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, 8\u201314 December 2019, Vancouver, BC, Canada, pp. 8024\u20138035 (2019). https:\/\/proceedings.neurips.cc\/paper\/2019\/hash\/bdbca288fee7f92f2bfa9f7012727740-Abstract.html"},{"key":"18_CR47","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"18_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-319-31271-2_3","volume-title":"Smart Card Research and Advanced Applications","author":"G Perin","year":"2016","unstructured":"Perin, G., Chmielewski, \u0141: A semi-parametric approach for side-channel attacks on protected RSA implementations. In: Homma, N., Medwed, M. (eds.) CARDIS 2015. LNCS, vol. 9514, pp. 34\u201353. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31271-2_3"},{"key":"18_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-20465-4_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"M Renauld","year":"2011","unstructured":"Renauld, M., Standaert, F.-X., Veyrat-Charvillon, N., Kamel, D., Flandre, D.: A formal study of power variability issues and side-channel attacks for nanoscale devices. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 109\u2013128. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_8"},{"key":"18_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-13039-2_15","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2014","author":"S Sarkar","year":"2014","unstructured":"Sarkar, S., Venkateswarlu, A.: Partial key exposure attack on CRT-RSA. In: Meier, W., Mukhopadhyay, D. (eds.) INDOCRYPT 2014. LNCS, vol. 8885, pp. 255\u2013264. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13039-2_15"},{"key":"18_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/3-540-44499-8_8","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2000","author":"W Schindler","year":"2000","unstructured":"Schindler, W.: A timing attack against RSA with the Chinese remainder theorem. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2000. LNCS, vol. 1965, pp. 109\u2013124. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44499-8_8"},{"key":"18_CR52","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"},{"issue":"4","key":"18_CR53","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s13389-014-0081-y","volume":"4","author":"W Schindler","year":"2014","unstructured":"Schindler, W., Wiemers, A.: Power attacks in the presence of exponent blinding. J. Cryptogr. Eng. 4(4), 213\u2013236 (2014). https:\/\/doi.org\/10.1007\/s13389-014-0081-y","journal-title":"J. Cryptogr. Eng."},{"issue":"4","key":"18_CR54","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s13389-016-0146-1","volume":"7","author":"W Schindler","year":"2017","unstructured":"Schindler, W., Wiemers, A.: Generic power attacks on RSA with CRT and exponent blinding: new results. J. Cryptogr. Eng. 7(4), 255\u2013272 (2017). https:\/\/doi.org\/10.1007\/s13389-016-0146-1","journal-title":"J. Cryptogr. Eng."},{"key":"18_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-540-24847-7_31","volume-title":"Algorithmic Number Theory","author":"D Stehl\u00e9","year":"2004","unstructured":"Stehl\u00e9, D., Zimmermann, P.: A binary recursive Gcd algorithm. In: Buell, D. (ed.) ANTS 2004. LNCS, vol. 3076, pp. 411\u2013425. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24847-7_31"},{"key":"18_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-13051-4_21","volume-title":"Selected Areas in Cryptography \u2013 SAC 2014","author":"A Takayasu","year":"2014","unstructured":"Takayasu, A., Kunihiro, N.: Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound. In: Joux, A., Youssef, A. (eds.) SAC 2014. LNCS, vol. 8781, pp. 345\u2013362. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13051-4_21"},{"key":"18_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-319-28166-7_25","volume-title":"Applied Cryptography and Network Security","author":"A Takayasu","year":"2015","unstructured":"Takayasu, A., Kunihiro, N.: Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents. In: Malkin, T., Kolesnikov, V., Lewko, A.B., Polychronakis, M. (eds.) ACNS 2015. LNCS, vol. 9092, pp. 518\u2013537. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28166-7_25"},{"key":"18_CR58","doi-asserted-by":"publisher","unstructured":"Takayasu, A., Kunihiro, N.: Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound. Theor. Comput. Sci. 761, 51\u201377 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.08.021","DOI":"10.1016\/j.tcs.2018.08.021"},{"issue":"4","key":"18_CR59","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1007\/s00145-018-9282-3","volume":"32","author":"A Takayasu","year":"2018","unstructured":"Takayasu, A., Lu, Y., Peng, L.: Small CRT-exponent RSA revisited. J. Cryptol. 32(4), 1337\u20131382 (2018). https:\/\/doi.org\/10.1007\/s00145-018-9282-3","journal-title":"J. Cryptol."},{"key":"18_CR60","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":"18_CR61","doi-asserted-by":"publisher","unstructured":"Wang, T., Cui, X., Ni, Y., Yu, D., Cui, X., Qu, G.: A practical cold boot attack on RSA private keys. In: 2017 Asian Hardware Oriented Security and Trust Symposium, AsianHOST 2017, Beijing, China, 19\u201320 October 2017, pp. 55\u201360. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/AsianHOST.2017.8353995","DOI":"10.1109\/AsianHOST.2017.8353995"},{"key":"18_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-662-53140-2_17","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2016","author":"Y Yarom","year":"2016","unstructured":"Yarom, Y., Genkin, D., Heninger, N.: CacheBleed: a timing attack on OpenSSL constant time RSA. In: Gierlichs, B., Poschmann, A.Y. (eds.) CHES 2016. LNCS, vol. 9813, pp. 346\u2013367. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53140-2_17"},{"key":"18_CR63","doi-asserted-by":"publisher","unstructured":"Yen, S., Joye, M.: Checking before output may not be enough against fault-based cryptanalysis. IEEE Trans. Computers 49(9), 967\u2013970 (2000). https:\/\/doi.org\/10.1109\/12.869328","DOI":"10.1109\/12.869328"},{"key":"18_CR64","doi-asserted-by":"publisher","unstructured":"Zaid, G., Bossuet, L., Habrard, A., Venelli, A.: Efficiency through diversity in ensemble models applied to side-channel attacks. IACR TCHES 2021(3), 60\u201396 (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i3.60-96. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/8968","DOI":"10.46586\/tches.v2021.i3.60-96"},{"key":"18_CR65","unstructured":"Zeiler, M.D.: ADADELTA: an adaptive learning rate method. CoRR abs\/1212.5701 (2012). http:\/\/arxiv.org\/abs\/1212.5701"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22972-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:02:45Z","timestamp":1769216565000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22972-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229718","9783031229725"],"references-count":65,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22972-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"364","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":"98","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":"27% - 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":"10","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}