{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,20]],"date-time":"2026-10-20T02:11:53Z","timestamp":1792462313928,"version":"4.5.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T00:00:00Z","timestamp":1693699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T00:00:00Z","timestamp":1693699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872383"],"award-info":[{"award-number":["61872383"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10623-023-01295-5","type":"journal-article","created":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T14:01:13Z","timestamp":1693749673000},"page":"4107-4142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Practical attacks on small private exponent RSA: new records and new insights"],"prefix":"10.1007","volume":"91","author":[{"given":"Qiang","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6929-1999","authenticated-orcid":false,"given":"Qun-xiong","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wen-feng","family":"Qi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,3]]},"reference":[{"key":"1295_CR1","first-page":"4","volume-title":"CaLC 2001. Lecture Notes in Computer Science","author":"J Bl\u00f6mer","year":"2001","unstructured":"Bl\u00f6mer J., May A.: Low secret exponent RSA revisited. In: Silverman J.H. (ed.) CaLC 2001. Lecture Notes in Computer Science, vol. 2146, pp. 4\u201319. Springer, Heidelberg (2001)."},{"key":"1295_CR2","first-page":"1","volume-title":"PKC 2004. Lecture Notes in Computer Science","author":"J Bl\u00f6mer","year":"2004","unstructured":"Bl\u00f6mer J., May A.: A generalized wiener attack on RSA. In: Bao F., Deng R., Zhou J. (eds.) PKC 2004. Lecture Notes in Computer Science, vol. 2947, pp. 1\u201313. Springer, Heidelberg (2004)."},{"key":"1295_CR3","first-page":"1","volume-title":"EUROCRYPT 1999. Lecture Notes in Computer Science","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. Lecture Notes in Computer Science, vol. 1592, pp. 1\u201311. Springer, Heidelberg (1999)."},{"issue":"4","key":"1295_CR4","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1109\/18.850673","volume":"46","author":"D Boneh","year":"2000","unstructured":"Boneh D., Durfee G.: Cryptanalysis of RSA with private key $$d$$ less than $$N^{0.292}$$. IEEE Trans. Inf. Theory 46(4), 1339\u20131349 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"S3","key":"1295_CR5","first-page":"45","volume":"11","author":"M Bunder","year":"2017","unstructured":"Bunder M., Tonien J.: A new attack on the RSA cryptosystem based on continued fractions. Malays. J. Math. Sci. 11(S3), 45\u201357 (2017).","journal-title":"Malays. J. Math. Sci."},{"key":"1295_CR6","first-page":"155","volume-title":"EUROCRYPT 1996. Lecture Notes in Computer Science","author":"D Coppersmith","year":"1996","unstructured":"Coppersmith D.: Finding a small root of a univariate modular equation. In: Maurer U.M. (ed.) EUROCRYPT 1996. Lecture Notes in Computer Science, vol. 1070, pp. 155\u2013165. Springer, Heidelberg (1996)."},{"key":"1295_CR7","first-page":"178","volume-title":"EUROCRYPT 1996. Lecture Notes in Computer Science","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. Lecture Notes in Computer Science, vol. 1070, pp. 178\u2013189. Springer, Heidelberg (1996)."},{"issue":"4","key":"1295_CR8","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).","journal-title":"J. Cryptol."},{"key":"1295_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s002000100088","volume":"13","author":"B de Weger","year":"2002","unstructured":"de Weger B.: Cryptanalysis of RSA with small prime difference. AAECC 13, 17\u201328 (2002). https:\/\/doi.org\/10.1007\/s002000100088.","journal-title":"AAECC"},{"key":"1295_CR10","unstructured":"Durfee G.: Public key cryptanalysis using algebraic and lattice methods. Ph.D. thesis. Stanford University, Stanford (2002)."},{"key":"1295_CR11","unstructured":"Hashimoto Y: On small secret key attack against RSA with high bits known prime factor. In: Cryptology ePrint Archive (2010)."},{"key":"1295_CR12","first-page":"487","volume-title":"ASIACRYPT 2009. Lecture Notes in Computer Science","author":"M Herrmann","year":"2009","unstructured":"Herrmann M., May A.: Attacking power generators using unravelled linearization: when do we output too much? In: Matsui M. (ed.) ASIACRYPT 2009. Lecture Notes in Computer Science, vol. 5912, pp. 487\u2013504. Springer, Heidelberg (2009)."},{"key":"1295_CR13","first-page":"53","volume-title":"PKC 2010. Lecture Notes in Computer Science","author":"M Herrmann","year":"2010","unstructured":"Herrmann M., May A.: Maximizing small root bounds by linearization and applications to small secret exponent RSA. In: Nguyen P.Q., Pointcheval D. (eds.) PKC 2010. Lecture Notes in Computer Science, vol. 6056, pp. 53\u201369. Springer, Heidelberg (2010)."},{"key":"1295_CR14","doi-asserted-by":"publisher","DOI":"10.1201\/9781420075199","volume-title":"Cryptanalysis of RSA and Its Variants","author":"MJ Hinek","year":"2009","unstructured":"Hinek M.J.: Cryptanalysis of RSA and Its Variants. CRC Press, Boca Raton (2009)."},{"key":"1295_CR15","first-page":"131","volume-title":"Cryptography and Coding 1997. Lecture Notes in Computer Science","author":"N Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham N.: Finding small roots of univariate modular equations revisited. In: Darnell M.J. (ed.) Cryptography and Coding 1997. Lecture Notes in Computer Science, vol. 1355, pp. 131\u2013142. Springer, Heidelberg (1997)."},{"issue":"4","key":"1295_CR16","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra A.K., Lenstra H.W., Lov\u00e1sz L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982).","journal-title":"Math. Ann."},{"key":"1295_CR17","doi-asserted-by":"crossref","unstructured":"Liu C., Yang C.: Factoring RSA modulo $$N$$ with high bits of $$p$$ known revisited. In: 2009 IEEE International Symposium on IT in Medicine & Education, vol. 1, pp. 495\u2013500. IEEE (2009).","DOI":"10.1109\/ITIME.2009.5236369"},{"key":"1295_CR18","first-page":"393","volume-title":"Network and System Security 2013. Lecture Notes in Computer Science","author":"Y Lu","year":"2013","unstructured":"Lu Y., Zhang R., Lin D.: Factoring RSA modulus with known bits from both $$p$$ and $$q$$: a Lattice method. In: Lopez J., Huang X., Sandhu R. (eds.) Network and System Security 2013. Lecture Notes in Computer Science, vol. 7873, pp. 393\u2013404. Springer, Heidelberg (2013)."},{"key":"1295_CR19","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.jnt.2021.01.002","volume":"222","author":"SD Miller","year":"2021","unstructured":"Miller S.D., Narayanan B., Venkatesan R.: Coppersmith\u2019s lattices and \u201cfocus groups\u2019\u2019: an attack on small-exponent RSA. J. Number Theory 222, 376\u2013392 (2021).","journal-title":"J. Number Theory"},{"key":"1295_CR20","first-page":"215","volume-title":"EUROCRYPT 2005. Lecture Notes in Computer Science","author":"PQ Nguyen","year":"2005","unstructured":"Nguyen P.Q., Stehl\u00e9 D.: Floating-point LLL revisited. In: Cramer R.J.F. (ed.) EUROCRYPT 2005. Lecture Notes in Computer Science, vol. 3494, pp. 215\u2013233. Springer, Heidelberg (2005)."},{"key":"1295_CR21","first-page":"238","volume-title":"ANTSVII. Lecture Notes in Computer Science","author":"P Nguyen","year":"2006","unstructured":"Nguyen P., Stehl\u00e9 D.: LLL on the average. In: Hess F., Pauli S., Pohst M. (eds.) ANTSVII. Lecture Notes in Computer Science, vol. 4076, pp. 238\u2013256. Springer, Heidelberg (2006)."},{"key":"1295_CR22","doi-asserted-by":"publisher","first-page":"36607","DOI":"10.1007\/s11042-021-11335-8","volume":"81","author":"A Nitaj","year":"2022","unstructured":"Nitaj A., Ariffin M.R.K., Adenan N.N.H., et al.: Exponential increment of RSA attack range via lattice based cryptanalysis. Multimed. Tools Appl. 81, 36607\u201336622 (2022).","journal-title":"Multimed. Tools Appl."},{"key":"1295_CR23","first-page":"96","volume-title":"ISPEC 2015. Lecture Notes in Computer Science","author":"L Peng","year":"2015","unstructured":"Peng L., Hu L., Huang Z., et al.: Partial prime factor exposure attacks on RSA and its Takagi\u2019s variant. In: Lopez J., Wu Y. (eds.) ISPEC 2015. Lecture Notes in Computer Science, vol. 9065, pp. 96\u2013108. Springer, Cham (2015)."},{"key":"1295_CR24","first-page":"31","volume-title":"EUROCRYPT 1985. Lecture Notes in Computer Science","author":"RL Rivest","year":"1986","unstructured":"Rivest R.L., Shamir A.: Efficient factoring based on partial information. In: Pichler F. (ed.) EUROCRYPT 1985. Lecture Notes in Computer Science, vol. 219, pp. 31\u201334. Springer, Heidelberg (1986)."},{"issue":"2","key":"1295_CR25","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest R.L., Shamir A., Adleman L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978).","journal-title":"Commun. ACM"},{"key":"1295_CR26","first-page":"37","volume-title":"ICISC 2008. Lecture Notes in Computer Science","author":"S Sarkar","year":"2009","unstructured":"Sarkar S., Maitra S.: Improved partial key exposure attacks on RSA by guessing a few bits of one of the prime factors. In: Lee P.J., Cheon J.H. (eds.) ICISC 2008. Lecture Notes in Computer Science, vol. 5461, pp. 37\u201351. Springer, Heidelberg (2009)."},{"key":"1295_CR27","unstructured":"Sarkar S., Maitra S., Sarkar S.: RSA cryptanalysis with increased bounds on the secret exponent using less lattice dimension. In: IACR Cryptology ePrint Archive, vol. 315 (2008)."},{"issue":"1","key":"1295_CR28","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0196-6774(88)90004-1","volume":"9","author":"CP Schnorr","year":"1988","unstructured":"Schnorr C.P.: A more efficient algorithm for lattice basis reduction. J. Algorithm. 9(1), 47\u201362 (1988).","journal-title":"J. Algorithm."},{"key":"1295_CR29","volume-title":"Cryptanalysis of RSA with lattice attacks","author":"AH Suk","year":"2003","unstructured":"Suk A.H.: Cryptanalysis of RSA with lattice attacks. University of Illinois, Illinois, Ph.D.thesis (2003)."},{"key":"1295_CR30","first-page":"381","volume-title":"Australasian Conference on Information Security and Privacy. Lecture Notes in Computer Science","author":"W Susilo","year":"2019","unstructured":"Susilo W., Tonien J., Yang G.: The Wiener attack on RSA revisited: a quest for the exact bound. In: Australasian Conference on Information Security and Privacy. Lecture Notes in Computer Science, vol. 11547, pp. 381\u2013398. Springer, Cham (2019)."},{"key":"1295_CR31","first-page":"58","volume-title":"CT-RSA 2017. Lecture Notes in Computer Science","author":"A Takayasu","year":"2017","unstructured":"Takayasu A., Kunihiro N.: A tool kit for partial key exposure attacks on RSA. In: Handschuh H. (ed.) CT-RSA 2017. Lecture Notes in Computer Science, vol. 10159, pp. 58\u201373. Springer, Cham (2017)."},{"issue":"3","key":"1295_CR32","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"MJ Wiener","year":"1990","unstructured":"Wiener M.J.: Cryptanalysis of short RSA secret exponents. IEEE Trans. Inf. Theory 36(3), 553\u2013558 (1990).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1295_CR33","unstructured":"Wong D.: https:\/\/github.com\/mimoo\/RSA-and-LLL-attacks."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01295-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01295-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01295-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T12:06:05Z","timestamp":1699099565000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01295-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,3]]},"references-count":33,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1295"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01295-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,3]]},"assertion":[{"value":"20 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}