{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:27:46Z","timestamp":1757618866051,"version":"3.44.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031972591"},{"type":"electronic","value":"9783031972607"}],"license":[{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T00:00:00Z","timestamp":1751414400000},"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":[[2026]]},"DOI":"10.1007\/978-3-031-97260-7_5","type":"book-chapter","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T05:21:03Z","timestamp":1752470463000},"page":"91-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Partial Key Exposure Attack on\u00a0Common Prime RSA"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0777-4175","authenticated-orcid":false,"given":"Mengce","family":"Zheng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0372-1757","authenticated-orcid":false,"given":"Abderrahmane","family":"Nitaj","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,2]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Becker, T., Weispfenning, V., Kredel, H.: Gr\u00f6bner Bases - A Computational Approach to Commutative Algebra. Graduate Texts in Mathematics, vol.\u00a0141. Springer (1993)","DOI":"10.1007\/978-1-4612-0913-3_5"},{"key":"5_CR2","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":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11426639_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"J Bl\u00f6mer","year":"2005","unstructured":"Bl\u00f6mer, J., May, A.: A tool kit for finding small roots of bivariate polynomials over the integers. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 251\u2013267. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_15"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48910-X_1","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"D Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than $$N^{0.292}$$. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 1\u201311. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_1"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-49649-1_3","volume-title":"Advances in Cryptology \u2014 ASIACRYPT\u201998","author":"D Boneh","year":"1998","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"},{"key":"5_CR6","unstructured":"Collins, T., Hopkins, D., Langford, S., Sabin, M.: Public key cryptographic apparatus and method. U.S. Patent 5848159 (1998)"},{"issue":"4","key":"5_CR7","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."},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.4064\/aa-58-4-363-385","volume":"58","author":"P Erdos","year":"1991","unstructured":"Erdos, P., Pomerance, C., Schmutz, E.: Carmichael\u2019s lambda function. Acta Arith 58(4), 363\u2013385 (1991)","journal-title":"Acta Arith"},{"key":"5_CR9","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"},{"issue":"5","key":"5_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/1506409.1506429","volume":"52","author":"J Halderman","year":"2009","unstructured":"Halderman, J., et al.: Lest we remember: cold-boot attacks on encryption keys. Commun. ACM 52(5), 91\u201398 (2009). https:\/\/doi.org\/10.1145\/1506409.1506429","journal-title":"Commun. ACM"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/11605805_6","volume-title":"Topics in Cryptology \u2013 CT-RSA 2006","author":"MJ Hinek","year":"2006","unstructured":"Hinek, M.J.: Another look at small RSA exponents. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, vol. 3860, pp. 82\u201398. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11605805_6"},{"key":"5_CR12","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":"5_CR13","doi-asserted-by":"publisher","first-page":"114845","DOI":"10.1016\/J.TCS.2024.114845","volume":"1019","author":"Z Jiang","year":"2024","unstructured":"Jiang, Z., Zhou, Y., Liu, Y.: Partial key exposure attacks on prime power RSA with non-consecutive blocks. Theor. Comput. Sci. 1019, 114845 (2024). https:\/\/doi.org\/10.1016\/J.TCS.2024.114845","journal-title":"Theor. Comput. Sci."},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/11935230_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"E Jochemsz","year":"2006","unstructured":"Jochemsz, E., May, A.: A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 267\u2013282. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11935230_18"},{"key":"5_CR15","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"},{"issue":"4","key":"5_CR16","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(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-662-48797-6_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"Y Lu","year":"2015","unstructured":"Lu, Y., Zhang, R., Peng, L., Lin, D.: Solving linear equations modulo unknown divisors: revisited. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 189\u2013213. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_9"},{"key":"5_CR18","unstructured":"May, A.: New RSA vulnerabilities using lattice reduction methods. Ph.D. thesis, University of Paderborn (2003). http:\/\/ubdata.uni-paderborn.de\/ediss\/17\/2003\/may\/disserta.pdf"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"May, A.: Using LLL-reduction for solving RSA and factorization problems. In: Nguyen, P.Q., Vall\u00e9e, B. (eds.) The LLL Algorithm - Survey and Applications. Information Security and Cryptography, pp. 315\u2013348. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-02295-1_10","DOI":"10.1007\/978-3-642-02295-1_10"},{"key":"5_CR20","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. LNCS, vol. 13090, pp. 99\u2013129. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92062-3_4"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ins.2020.05.075","volume":"538","author":"M Mumtaz","year":"2020","unstructured":"Mumtaz, M., Luo, P.: Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices. Inf. Sci. 538, 54\u201368 (2020). https:\/\/doi.org\/10.1016\/j.ins.2020.05.075","journal-title":"Inf. Sci."},{"issue":"21","key":"5_CR22","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1145\/359340.359342","volume":"18","author":"JJ Quisquater","year":"1982","unstructured":"Quisquater, J.J., Couvreur, C.: Fast decipherment algorithm for RSA public-key cryptosystem. Electron. Lett. 18(21), 905\u2013907 (1982). https:\/\/doi.org\/10.1145\/359340.359342","journal-title":"Electron. Lett."},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Ristenpart, T., Tromer, E., Shacham, H., Savage, S.: Hey, you, get off of my cloud: exploring information leakage in third-party compute clouds. In: Al-Shaer, E., Jha, S., Keromytis, A.D. (eds.) Proceedings of the 2009 ACM Conference on Computer and Communications Security, CCS 2009, Chicago, Illinois, USA, 9\u201313 November 2009, pp. 199\u2013212. ACM (2009). https:\/\/doi.org\/10.1145\/1653662.1653687","DOI":"10.1145\/1653662.1653687"},{"issue":"2","key":"5_CR24","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.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978). https:\/\/doi.org\/10.1145\/359340.359342","journal-title":"Commun. ACM"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-33027-8_28","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"S Sarkar","year":"2012","unstructured":"Sarkar, S., Maitra, S.: Side channel attack to actual cryptanalysis: breaking CRT-RSA with low weight decryption exponents. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 476\u2013493. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_28"},{"issue":"1\u20133","key":"5_CR26","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10623-012-9675-5","volume":"66","author":"S Sarkar","year":"2013","unstructured":"Sarkar, S., Maitra, S.: Cryptanalytic results on \u2018dual CRT\u2019 and \u2018common prime\u2019 RSA. Des. Codes Cryptogr. 66(1\u20133), 157\u2013174 (2013). https:\/\/doi.org\/10.1007\/s10623-012-9675-5","journal-title":"Des. Codes Cryptogr."},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/BFb0055738","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"T Takagi","year":"1998","unstructured":"Takagi, T.: Fast RSA-type cryptosystem modulo pkq. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 318\u2013326. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055738"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-39059-3_9","volume-title":"Information Security and Privacy","author":"A Takayasu","year":"2013","unstructured":"Takayasu, A., Kunihiro, N.: Better lattice constructions for solving multivariate linear equations modulo unknown divisors. In: Boyd, C., Simpson, L. (eds.) ACISP 2013. LNCS, vol. 7959, pp. 118\u2013135. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39059-3_9"},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2018.08.021","volume":"761","author":"A Takayasu","year":"2019","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","journal-title":"Theor. Comput. Sci."},{"key":"5_CR30","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 9.5) (2025). https:\/\/www.sagemath.org"},{"issue":"3","key":"5_CR31","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"M Wiener","year":"1990","unstructured":"Wiener, M.: Cryptanalysis of short RSA secret exponents. IEEE Trans. Inf. Theory 36(3), 553\u2013558 (1990). https:\/\/doi.org\/10.1109\/18.54902","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR32","doi-asserted-by":"publisher","unstructured":"Yuan, S., Yu, W., Wang, K., Li, X.: Partial key exposure attacks on RSA with moduli $$N=p^r q^s$$. In: IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, 26 June\u20131 July 2022, pp. 1436\u20131440. IEEE (2022). https:\/\/doi.org\/10.1109\/ISIT50566.2022.9834542","DOI":"10.1109\/ISIT50566.2022.9834542"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"Zheng, M.: Partial key exposure attack on common prime RSA. In: Ge, C., Yung, M. (eds.) Inscrypt 2023, Part II. LNCS, vol. 14527, pp. 407\u2013410. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-981-97-0945-8_27","DOI":"10.1007\/978-981-97-0945-8_27"},{"key":"5_CR34","unstructured":"Zheng, M.: Partial key exposure attack on common prime RSA. IACR Cryptol. ePrint Arch. 61 (2024). https:\/\/eprint.iacr.org\/2024\/061"},{"key":"5_CR35","doi-asserted-by":"publisher","first-page":"5203","DOI":"10.1109\/ACCESS.2024.3349633","volume":"12","author":"M Zheng","year":"2024","unstructured":"Zheng, M.: Revisiting small private key attacks on common prime RSA. IEEE Access 12, 5203\u20135211 (2024). https:\/\/doi.org\/10.1109\/ACCESS.2024.3349633","journal-title":"IEEE Access"},{"issue":"1","key":"5_CR36","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1186\/S42400-024-00289-7","volume":"7","author":"M Zheng","year":"2024","unstructured":"Zheng, M., Kang, H.: Lattice-based cryptanalysis of RSA-type cryptosystems: a bibliometric analysis. Cybersecur. 7(1), 74 (2024). https:\/\/doi.org\/10.1186\/S42400-024-00289-7","journal-title":"Cybersecur."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97260-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T07:46:09Z","timestamp":1757231169000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97260-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,2]]},"ISBN":["9783031972591","9783031972607"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97260-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,7,2]]},"assertion":[{"value":"2 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/africacrypt2025.sciencesconf.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}