{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T10:26:45Z","timestamp":1781519205637,"version":"3.54.1"},"reference-count":93,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002335"],"award-info":[{"award-number":["62002335"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007834","name":"Ningbo Natural Science Foundation","doi-asserted-by":"crossref","award":["2021J174"],"award-info":[{"award-number":["2021J174"]}],"id":[{"id":"10.13039\/100007834","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Ningbo Young Science and Technology Talent Cultivation Program","award":["2023QL007"],"award-info":[{"award-number":["2023QL007"]}]},{"name":"Open Fund of Advanced Cryptography and System Security Key Laboratory of Sichuan Province","award":["SKLACSS-202315"],"award-info":[{"award-number":["SKLACSS-202315"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The RSA (Rivest\u2013Shamir\u2013Adleman) cryptosystem is a widely used public-key cryptographic algorithm in information systems and computer applications. With the advancement of lattice theory, a technique known as the lattice-based method has emerged as a significant threat to RSA and its variants. This paper aims to conduct a bibliometric analysis of publications in the field of lattice-based attacks on RSA-type cryptosystems. The analysis is based on a dataset of relevant publications retrieved from Scopus and utilizes visualization tools such as CiteSpace and VOSviewer for a thorough overview. In order to understand the research developmental trajectory, we analyze the publication trends over the years, explore cooperation networks at various levels, including country\/region, institution, and author, and assess the extent of collaboration, contribution, and productivity within the field. Additionally, author co-citation network and reference co-citation clustering are utilized to enable the identification of significant research achievements, cutting-edge developments, and structural framework. Furthermore, we conduct detailed analysis from a keyword perspective to identify research hotspots and emerging trends. The findings contribute to the existing body of knowledge on lattice-based cryptanalysis of RSA-type cryptosystems. Moreover, this bibliometric analysis serves as a valuable resource for identifying fruitful areas for further exploration and guides future research efforts.<\/jats:p>","DOI":"10.1186\/s42400-024-00289-7","type":"journal-article","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T02:01:41Z","timestamp":1733968901000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Lattice-based cryptanalysis of RSA-type cryptosystems: a bibliometric analysis"],"prefix":"10.1186","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0777-4175","authenticated-orcid":false,"given":"Mengce","family":"Zheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hao","family":"Kang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"289_CR1","doi-asserted-by":"publisher","unstructured":"Ajtai M, Dwork C (1997) A public-key cryptosystem with worst-case\/average-case equivalence. In: Leighton FT, Shor PW (eds) Proceedings of the twenty-ninth annual ACM symposium on the theory of computing, El Paso, Texas, USA, May 4\u20136, 1997, pp 284\u2013293. ACM. Retrieved from https:\/\/doi.org\/10.1145\/258533.258604","DOI":"10.1145\/258533.258604"},{"key":"289_CR2","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-00468-1_3","volume-title":"Public key cryptography\u2014PKC 2009, 12th international conference on practice and theory in public key cryptography, Irvine, CA, USA, March 18-20, 2009. Proceedings","author":"Y Aono","year":"2009","unstructured":"Aono Y (2009) A new lattice construction for partial key exposure attack for RSA. In: Jarecki S, Tsudik G (eds) Public key cryptography\u2014PKC 2009, 12th international conference on practice and theory in public key cryptography, Irvine, CA, USA, March 18-20, 2009. Proceedings, vol 5443. Springer, Berlin, pp 34\u201353. https:\/\/doi.org\/10.1007\/978-3-642-00468-1_3"},{"key":"289_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0913-3","volume-title":"Gr\u00f6bner bases: a computational approach to commutative algebra","author":"T Becker","year":"1993","unstructured":"Becker T, Weispfenning V, Kredel H (1993) Gr\u00f6bner bases: a computational approach to commutative algebra, vol 141. Springer, Berlin"},{"key":"289_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-45146-4_2","volume-title":"Advances in cryptology: CRYPTO 2003, 23rd annual international cryptology conference, Santa Barbara, California, USA, August 17\u201321, 2003, proceedings","author":"J Bl\u00f6mer","year":"2003","unstructured":"Bl\u00f6mer J, May A (2003) New partial key exposure attacks on RSA. In: Boneh D (ed) Advances in cryptology: CRYPTO 2003, 23rd annual international cryptology conference, Santa Barbara, California, USA, August 17\u201321, 2003, proceedings, vol 2729. Springer, Berlin, pp 27\u201343. https:\/\/doi.org\/10.1007\/978-3-540-45146-4_2"},{"key":"289_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24632-9_1","volume-title":"Public key cryptography: PKC 2004, 7th international workshop on theory and practice in public key cryptography, Singapore, March 1\u20134, 2004","author":"J Bl\u00f6mer","year":"2004","unstructured":"Bl\u00f6mer J, May A (2004) A generalized wiener attack on RSA. In: Bao F, Deng RH, Zhou J (eds) Public key cryptography: PKC 2004, 7th international workshop on theory and practice in public key cryptography, Singapore, March 1\u20134, 2004, vol 2947. Springer, Berlin, pp 1\u201313. https:\/\/doi.org\/10.1007\/978-3-540-24632-9_1"},{"key":"289_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11426639_15","volume-title":"Advances in cryptology: EUROCRYPT 2005, 24th annual international conference on the theory and applications of cryptographic techniques, Aarhus, Denmark, May 22\u201326, 2005, proceedings","author":"J Bl\u00f6mer","year":"2005","unstructured":"Bl\u00f6mer J, May A (2005) A tool kit for finding small roots of bivariate polynomials over the integers. In: Cramer R (ed) Advances in cryptology: EUROCRYPT 2005, 24th annual international conference on the theory and applications of cryptographic techniques, Aarhus, Denmark, May 22\u201326, 2005, proceedings, vol 3494. Springer, Berlin, pp 251\u2013267. https:\/\/doi.org\/10.1007\/11426639_15"},{"issue":"2","key":"289_CR7","first-page":"203","volume":"46","author":"D Boneh","year":"1999","unstructured":"Boneh D (1999) Twenty years of attacks on the RSA cryptosystem. Not AMS 46(2):203\u2013213","journal-title":"Not AMS"},{"issue":"4","key":"289_CR8","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1109\/18.850673","volume":"46","author":"D Boneh","year":"2000","unstructured":"Boneh D, Durfee G (2000) Cryptanalysis of RSA with private key d less than N0.292. IEEE Trans Inf Theory 46(4):1339\u20131349. https:\/\/doi.org\/10.1109\/18.850673","journal-title":"IEEE Trans Inf Theory"},{"key":"289_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-49649-1_3","volume-title":"Advances in cryptology: ASIACRYPT \u201998, international conference on the theory and applications of cryptology and information security, Beijing, China, October 18\u201322, 1998, proceedings","author":"D Boneh","year":"1998","unstructured":"Boneh D, Durfee G, Frankel Y (1998) An attack on RSA given a small fraction of the private key bits. In: Ohta K, Pei D (eds) Advances in cryptology: ASIACRYPT \u201998, international conference on the theory and applications of cryptology and information security, Beijing, China, October 18\u201322, 1998, proceedings, vol 1514. Springer, Berlin, pp 25\u201334. https:\/\/doi.org\/10.1007\/3-540-49649-1_3"},{"key":"289_CR10","doi-asserted-by":"publisher","unstructured":"Boneh D, Durfee G, Howgrave-Graham N (1999) Factoring N = $$p^r q$$ for large $$r$$. In: Wiener MJ (eds) Advances in cryptology: CRYPTO \u201999, 19th annual international cryptology conference, Santa Barbara, California, USA, August 15\u201319, 1999, proceedings, vol 1666, pp 326\u2013337. Springer. Retrieved from https:\/\/doi.org\/10.1007\/3-540-48405-1_21","DOI":"10.1007\/3-540-48405-1_21"},{"key":"289_CR11","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2017.09.009","volume":"704","author":"MW Bunder","year":"2017","unstructured":"Bunder MW, Nitaj A, Susilo W, Tonien J (2017) A generalized attack on RSA type cryptosystems. Theor Comput Sci 704:74\u201381. https:\/\/doi.org\/10.1016\/j.tcs.2017.09.009","journal-title":"Theor Comput Sci"},{"issue":"3","key":"289_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1002\/asi.20317","volume":"57","author":"C Chen","year":"2006","unstructured":"Chen C (2006) CiteSpace II: detecting and visualizing emerging trends and transient patterns in scientific literature. J Assoc Inf Sci Technol 57(3):359\u2013377. https:\/\/doi.org\/10.1002\/asi.20317","journal-title":"J Assoc Inf Sci Technol"},{"key":"289_CR13","doi-asserted-by":"publisher","unstructured":"Chen Y, Nguyen PQ (2011) BKZ 2.0: better lattice security estimates. In: Lee DH, Wang X (eds) Advances in cryptology: ASIACRYPT 2011\u201417th international conference on the theory and application of cryptology and information security, Seoul, South Korea, December 4\u20138, 2011. Proceedings, vol 7073, pp 1\u201320. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1","DOI":"10.1007\/978-3-642-25385-0_1"},{"key":"289_CR14","unstructured":"Collins T, Hopkins D, Langford S, Sabin M (1998) Public key cryptographic apparatus and method (No. 5848159). (U.S. Patent 5848159)"},{"key":"289_CR15","doi-asserted-by":"publisher","unstructured":"Coppersmith D (1996a) Finding a small root of a bivariate integer equation; factoring with high bits known. In: Maurer UM (ed) Advances in cryptology: EUROCRYPT \u201996, international conference on the theory and application of cryptographic techniques, Saragossa, Spain, May 12\u201316, 1996, proceeding, vol 1070. Springer, pp 178\u2013189. https:\/\/doi.org\/10.1007\/3-540-68339-9_16","DOI":"10.1007\/3-540-68339-9_16"},{"key":"289_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"Advances in cryptology: EUROCRYPT \u201996, international conference on the theory and application of cryptographic techniques, Saragossa, Spain, May 12\u201316, 1996, proceeding","author":"D Coppersmith","year":"1996","unstructured":"Coppersmith D (1996b) Finding a small root of a univariate modular equation. In: Maurer UM (ed) Advances in cryptology: EUROCRYPT \u201996, international conference on the theory and application of cryptographic techniques, Saragossa, Spain, May 12\u201316, 1996, proceeding, vol 1070. Springer, Berlin, pp 155\u2013165. https:\/\/doi.org\/10.1007\/3-540-68339-9_14"},{"issue":"4","key":"289_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith D (1997) Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J Cryptol 10(4):233\u2013260. https:\/\/doi.org\/10.1007\/s001459900030","journal-title":"J Cryptol"},{"key":"289_CR18","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-540-24676-3_29","volume-title":"Advances in cryptology: EUROCRYPT 2004, international conference on the theory and applications of cryptographic techniques, Interlaken, Switzerland, May 2\u20136, 2004, proceedings","author":"J Coron","year":"2004","unstructured":"Coron J (2004) Finding small roots of bivariate integer polynomial equations revisited. In: Cachin C, Camenisch J (eds) Advances in cryptology: EUROCRYPT 2004, international conference on the theory and applications of cryptographic techniques, Interlaken, Switzerland, May 2\u20136, 2004, proceedings, vol 3027. Springer, Berlin, pp 492\u2013505. https:\/\/doi.org\/10.1007\/978-3-540-24676-3_29"},{"key":"289_CR19","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-74143-5_21","volume-title":"Advances in cryptology: CRYPTO 2007, 27th annual international cryptology conference, Santa Barbara, CA, USA, August 19\u201323, 2007, proceedings","author":"J Coron","year":"2007","unstructured":"Coron J (2007) Finding small roots of bivariate integer polynomial equations: a direct approach. In: Menezes A (ed) Advances in cryptology: CRYPTO 2007, 27th annual international cryptology conference, Santa Barbara, CA, USA, August 19\u201323, 2007, proceedings, vol 4622. Springer, Berlin, pp 379\u2013394. https:\/\/doi.org\/10.1007\/978-3-540-74143-5_21"},{"key":"289_CR20","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-642-04138-9_31","volume-title":"Cryptographic hardware and embedded systems: CHES 2009, 11th international workshop, Lausanne, Switzerland, September 6\u20139, 2009, proceedings","author":"J Coron","year":"2009","unstructured":"Coron J, Joux A, Kizhvatov I, Naccache D, Paillier P (2009) Fault attacks on RSA signatures with partially unknown messages. In: Clavier C, Gaj K (eds) Cryptographic hardware and embedded systems: CHES 2009, 11th international workshop, Lausanne, Switzerland, September 6\u20139, 2009, proceedings, vol 5747. Springer, Berlin, pp 444\u2013456. https:\/\/doi.org\/10.1007\/978-3-642-04138-9_31"},{"key":"289_CR21","doi-asserted-by":"publisher","unstructured":"Durfee G, Nguyen PQ (2000) Cryptanalysis of the RSA schemes with short secret exponent from asiacrypt \u201999. In: Okamoto T (ed) Advances in cryptology\u2014ASIACRYPT 2000, 6th international conference on the theory and application of cryptology and information security, Kyoto, Japan, December 3\u20137, 2000, proceedings, vol 1976, pp 14\u201329. Springer. Retrieved from https:\/\/doi.org\/10.1007\/3-540-44448-3_2","DOI":"10.1007\/3-540-44448-3_2"},{"key":"289_CR22","doi-asserted-by":"crossref","unstructured":"Elkamchouchi H, Elshenawy K, Shaban H (2002) Extended RSA cryptosystem and digital signature schemes in the domain of Gaussian integers. In: The 8th international conference on communication systems, 2002 (ICCS 2002), vol\u00a01, pp 91\u201395","DOI":"10.1109\/ICCS.2002.1182444"},{"key":"289_CR23","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/11426639_22","volume-title":"Advances in cryptology: EUROCRYPT 2005, 24th annual international conference on the theory and applications of cryptographic techniques, Aarhus, Denmark, May 22\u201326, 2005, proceedings","author":"M Ernst","year":"2005","unstructured":"Ernst M, Jochemsz E, May A, de Weger B (2005) Partial key exposure attacks on RSA up to full size exponents. In: Cramer R (ed) Advances in cryptology: EUROCRYPT 2005, 24th annual international conference on the theory and applications of cryptographic techniques, Aarhus, Denmark, May 22\u201326, 2005, proceedings, vol 3494. Springer, Berlin, pp 371\u2013386. https:\/\/doi.org\/10.1007\/11426639_22"},{"key":"289_CR24","doi-asserted-by":"publisher","unstructured":"Feng Y, Nitaj A, Pan Y (2023) Generalized implicit factorization problem. CoRR, arXiv:2304.08718, Retrieved from https:\/\/doi.org\/10.48550\/arXiv.2304.08718","DOI":"10.48550\/arXiv.2304.08718"},{"key":"289_CR25","doi-asserted-by":"publisher","unstructured":"Herrmann M, May A (2008) Solving linear equations modulo divisors: on factoring given any bits. In: Pieprzyk J (ed) Advances in cryptology: ASIACRYPT 2008, 14th international conference on the theory and application of cryptology and information security, Melbourne, Australia, December 7\u201311, 2008. proceedings, vol 5350, pp 406\u2013424. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-540-89255-7_25","DOI":"10.1007\/978-3-540-89255-7_25"},{"key":"289_CR26","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-10366-7_29","volume-title":"Advances in cryptology: ASIACRYPT 2009, 15th international conference on the theory and application of cryptology and information security, Tokyo, Japan, December 6\u201310, 2009. Proceedings","author":"M Herrmann","year":"2009","unstructured":"Herrmann M, May A (2009) Attacking power generators using unravelled linearization: when do we output too much? In: Matsui M (ed) Advances in cryptology: ASIACRYPT 2009, 15th international conference on the theory and application of cryptology and information security, Tokyo, Japan, December 6\u201310, 2009. Proceedings, vol 5912. Springer, Berlin, pp 487\u2013504. https:\/\/doi.org\/10.1007\/978-3-642-10366-7_29"},{"key":"289_CR27","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/11605805_6","volume-title":"Topics in cryptology: CT-RSA 2006, the cryptographers\u2019 track at the RSA conference 2006, San Jose, CA, USA, February 13\u201317, 2006, proceedings","author":"MJ Hinek","year":"2006","unstructured":"Hinek MJ (2006) Another look at small RSA exponents. In: Pointcheval D (ed) Topics in cryptology: CT-RSA 2006, the cryptographers\u2019 track at the RSA conference 2006, San Jose, CA, USA, February 13\u201317, 2006, proceedings, vol 3860. Springer, Berlin, pp 82\u201398. https:\/\/doi.org\/10.1007\/11605805_6"},{"key":"289_CR28","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Cryptography and coding, 6th IMA international conference, Cirencester, UK, December 17\u201319, 1997, proceedings","author":"N Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham N (1997) Finding small roots of univariate modular equations revisited. In: Darnell M (ed) Cryptography and coding, 6th IMA international conference, Cirencester, UK, December 17\u201319, 1997, proceedings, vol 1355. Springer, Berlin, pp 131\u2013142. https:\/\/doi.org\/10.1007\/BFb0024458"},{"key":"289_CR29","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-46701-7_14","volume-title":"Secure networking: CQRE (secure) \u201999, international exhibition and congress D\u00fcsseldorf, Germany, November 30\u2013December 2, 1999, proceedings","author":"N Howgrave-Graham","year":"1999","unstructured":"Howgrave-Graham N, Seifert J (1999) Extending Wiener\u2019s attack in the presence of many decrypting exponents. In: Baumgart R (ed) Secure networking: CQRE (secure) \u201999, international exhibition and congress D\u00fcsseldorf, Germany, November 30\u2013December 2, 1999, proceedings, vol 1740. Springer, Berlin, pp 153\u2013166. https:\/\/doi.org\/10.1007\/3-540-46701-7_14"},{"key":"289_CR30","doi-asserted-by":"publisher","unstructured":"Jochemsz E, May A (2006) A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants. In: Lai X, Chen K (eds) Advances in cryptology: ASIACRYPT 2006, 12th international conference on the theory and application of cryptology and information security, Shanghai, China, December 3\u20137, 2006, proceedings, vol 4284, pp 267\u2013282. Springer. Retrieved from https:\/\/doi.org\/10.1007\/11935230_18","DOI":"10.1007\/11935230_18"},{"issue":"3","key":"289_CR31","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s001459900042","volume":"11","author":"A Joux","year":"1998","unstructured":"Joux A, Stern J (1998) Lattice reduction: a toolbox for the cryptanalyst. J Cryptol 11(3):161\u2013185. https:\/\/doi.org\/10.1007\/s001459900042","journal-title":"J Cryptol"},{"key":"289_CR32","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in cryptology: CRYPTO \u201996, 16th annual international cryptology conference, Santa Barbara, California, USA, August 18\u201322, 1996, proceedings","author":"PC Kocher","year":"1996","unstructured":"Kocher PC (1996) Timing attacks on implementations of Diffie\u2013Hellman, RSA, DSS, and other systems. In: Koblitz N (ed) Advances in cryptology: CRYPTO \u201996, 16th annual international cryptology conference, Santa Barbara, California, USA, August 18\u201322, 1996, proceedings, vol 1109. Springer, Berlin, pp 104\u2013113. https:\/\/doi.org\/10.1007\/3-540-68697-5_9"},{"key":"289_CR33","doi-asserted-by":"publisher","unstructured":"Kocher PC, Jaffe J, Jun B (1999) Differential power analysis. In:\u00a0Wiener MJ (eds) Advances in cryptology: CRYPTO \u201999, 19th annual international cryptology conference, Santa Barbara, California, USA, August 15\u201319, 1999, proceedings, vol 1666, pp 388\u2013397. Springer. Retrieved from https:\/\/doi.org\/10.1007\/3-540-48405-1_25","DOI":"10.1007\/3-540-48405-1_25"},{"key":"289_CR34","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-46766-1_20","volume-title":"Advances in cryptology: CRYPTO \u201991, 11th annual international cryptology conference, Santa Barbara, California, USA, August 11\u201315, 1991, proceedings","author":"K Koyama","year":"1991","unstructured":"Koyama K, Maurer UM, Okamoto T, Vanstone SA (1991) New public-key schemes based on elliptic curves over the ring Zn. In: Feigenbaum J (ed) Advances in cryptology: CRYPTO \u201991, 11th annual international cryptology conference, Santa Barbara, California, USA, August 11\u201315, 1991, proceedings, vol 576. Springer, Berlin, pp 252\u2013266. https:\/\/doi.org\/10.1007\/3-540-46766-1_20"},{"issue":"6","key":"289_CR35","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1587\/transfun.E97.A.1273","volume":"97\u2013A","author":"N Kunihiro","year":"2014","unstructured":"Kunihiro N, Shinohara N, Izu T (2014) Recovering RSA secret keys from noisy key bits with erasures and errors. IEICE Trans Fundam Electron Commun Comput Sci 97\u2013A(6):1273\u20131284. https:\/\/doi.org\/10.1587\/transfun.E97.A.1273","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"issue":"1","key":"289_CR36","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"JC Lagarias","year":"1985","unstructured":"Lagarias JC, Odlyzko AM (1985) Solving low-density subset sum problems. J ACM 32(1):229\u2013246. https:\/\/doi.org\/10.1145\/2455.2461","journal-title":"J ACM"},{"issue":"4","key":"289_CR37","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra AK, Lenstra HW, Lov\u00e1sz L (1982) Factoring polynomials with rational coefficients. Math Ann 261(4):515\u2013534","journal-title":"Math Ann"},{"key":"289_CR38","doi-asserted-by":"publisher","unstructured":"Lenstra AK, Jr, HWL, Manasse MS, Pollard JM (1990) The number field sieve. In: Ortiz H (eds) Proceedings of the 22nd annual ACM symposium on theory of computing, May 13\u201317, 1990, Baltimore, Maryland, USA, pp 564\u2013572. ACM. Retrieved from https:\/\/doi.org\/10.1145\/100216.100295","DOI":"10.1145\/100216.100295"},{"key":"289_CR39","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-44495-5_25","volume-title":"Progress in cryptology: INDOCRYPT 2000, first international conference in cryptology in India, Calcutta, India, December 10\u201313, 2000, proceedings","author":"S Lim","year":"2000","unstructured":"Lim S, Kim S, Yie I, Lee H (2000) A generalized Takagi-cryptosystem with a modulus of the form prqs. In: Roy BK, Okamoto E (eds) Progress in cryptology: INDOCRYPT 2000, first international conference in cryptology in India, Calcutta, India, December 10\u201313, 2000, proceedings, vol 1977. Springer, Berlin, pp 283\u2013294. https:\/\/doi.org\/10.1007\/3-540-44495-5_25"},{"key":"289_CR40","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-39059-3_5","volume-title":"Information security and privacy: 18th Australasian conference, ACISP 2013, Brisbane, Australia, July 1\u20133, 2013. Proceedings","author":"Y Lu","year":"2013","unstructured":"Lu Y, Zhang R, Lin D (2013) Factoring multi-power RSA modulus N = prq with partial known bits. In: Boyd C, Simpson L (eds) Information security and privacy: 18th Australasian conference, ACISP 2013, Brisbane, Australia, July 1\u20133, 2013. Proceedings, vol 7959. Springer, Berlin, pp 57\u201371. https:\/\/doi.org\/10.1007\/978-3-642-39059-3_5"},{"key":"289_CR41","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-319-31301-6_26","volume-title":"Selected areas in cryptography: SAC 2015\u201422nd international conference, Sackville, NB, Canada, August 12\u201314, 2015, revised selected papers","author":"Y Lu","year":"2015","unstructured":"Lu Y, Peng L, Zhang R, Hu L, Lin D (2015a) Towards optimal bounds for implicit factorization problem. In: Dunkelman O, Keliher L (eds) Selected areas in cryptography: SAC 2015\u201422nd international conference, Sackville, NB, Canada, August 12\u201314, 2015, revised selected papers, vol 9566. Springer, Berlin, pp 462\u2013476. https:\/\/doi.org\/10.1007\/978-3-319-31301-6_26"},{"key":"289_CR42","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-662-48797-6_9","volume-title":"Advances in cryptology: ASIACRYPT 2015\u201421st international conference on the theory and application of cryptology and information security, Auckland, New Zealand, November 29\u2013December 3, 2015, proceedings, part I","author":"Y Lu","year":"2015","unstructured":"Lu Y, Zhang R, Peng L, Lin D (2015b) Solving linear equations modulo unknown divisors: revisited. In: Iwata T, Cheon JH (eds) Advances in cryptology: ASIACRYPT 2015\u201421st international conference on the theory and application of cryptology and information security, Auckland, New Zealand, November 29\u2013December 3, 2015, proceedings, part I, vol 9452. Springer, Berlin, pp 189\u2013213. https:\/\/doi.org\/10.1007\/978-3-662-48797-6_9"},{"issue":"2","key":"289_CR43","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1515\/jmc-2016-0025","volume":"11","author":"Y Lu","year":"2017","unstructured":"Lu Y, Peng L, Sarkar S (2017) Cryptanalysis of an RSA variant with moduli N = prql. J Math Cryptol 11(2):117. https:\/\/doi.org\/10.1515\/jmc-2016-0025","journal-title":"J Math Cryptol"},{"key":"289_CR44","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-030-61638-0_24","volume-title":"Applied cryptography and network security workshops: ACNS 2020 satellite workshops, Aiblock, Aihws, Aiots, cloud s &p, sci, secmt, and Simla, Rome, Italy, October 19\u201322, 2020, proceedings","author":"Z Ma","year":"2020","unstructured":"Ma Z, Li B, Cai Q, Yang J (2020) Applications and developments of the lattice attack in side channel attacks. In: Zhou J et al (eds) Applied cryptography and network security workshops: ACNS 2020 satellite workshops, Aiblock, Aihws, Aiots, cloud s &p, sci, secmt, and Simla, Rome, Italy, October 19\u201322, 2020, proceedings, vol 12418. Springer, Berlin, pp 435\u2013452. https:\/\/doi.org\/10.1007\/978-3-030-61638-0_24"},{"key":"289_CR45","unstructured":"May A (2003) New RSA vulnerabilities using lattice reduction methods (Doctoral dissertation, University of Paderborn). Retrieved from http:\/\/ubdata.uni-paderborn.de\/ediss\/17\/2003\/may\/disserta.pdf"},{"key":"289_CR46","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-02295-1_10","volume-title":"The LLL algorithm: survey and applications","author":"A May","year":"2010","unstructured":"May A (2010) Using LLL-reduction for solving RSA and factorization problems. In: Nguyen PQ, Vall\u00e9e B (eds) The LLL algorithm: survey and applications. Springer, Berlin, pp 315\u2013348. https:\/\/doi.org\/10.1007\/978-3-642-02295-1_10"},{"key":"289_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00468-1_1","volume-title":"Public key cryptography: PKC 2009, 12th international conference on practice and theory in public key cryptography, Irvine, CA, USA, March 18\u201320, 2009, proceedings","author":"A May","year":"2009","unstructured":"May A, Ritzenhofen M (2009) Implicit factoring: on polynomial time factoring given only an implicit hint. In: Jarecki S, Tsudik G (eds) Public key cryptography: PKC 2009, 12th international conference on practice and theory in public key cryptography, Irvine, CA, USA, March 18\u201320, 2009, proceedings, vol 5443. Springer, Berlin, pp 1\u201314. https:\/\/doi.org\/10.1007\/978-3-642-00468-1_1"},{"key":"289_CR48","doi-asserted-by":"publisher","unstructured":"May A, Nowakowski J, Sarkar S (2022) Approximate divisor multiples: factoring with only a third of the secret crt-exponents. In: Dunkelman O, Dziembowski S (eds) Advances in cryptology: EUROCRYPT 2022\u201441st annual international conference on the theory and applications of cryptographic techniques, Trondheim, Norway, May 30\u2013June 3, 2022, proceedings, part III, vol 13277, pp 147\u2013167. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-031-07082-2_6","DOI":"10.1007\/978-3-031-07082-2_6"},{"key":"289_CR49","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-981-99-8730-6_2","volume-title":"Advances in cryptology: ASIACRYPT 2023\u201429th international conference on the theory and application of cryptology and information security, Guangzhou, China, December 4\u20138, 2023, proceedings, part IV","author":"J Meers","year":"2023","unstructured":"Meers J, Nowakowski J (2023) Solving the hidden number problem for CSIDH and CSURF via automated coppersmith. In: Guo J, Steinfeld R (eds) Advances in cryptology: ASIACRYPT 2023\u201429th international conference on the theory and application of cryptology and information security, Guangzhou, China, December 4\u20138, 2023, proceedings, part IV, vol 14441. Springer, Berlin, pp 39\u201371. https:\/\/doi.org\/10.1007\/978-981-99-8730-6_2"},{"issue":"1","key":"289_CR50","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/09720529.2018.1564201","volume":"22","author":"M Mumtaz","year":"2019","unstructured":"Mumtaz M, Luo P (2019) Forty years of attacks on the RSA cryptosystem: a brief survey. J Discrete Math Sci Cryptogr 22(1):9\u201329. https:\/\/doi.org\/10.1080\/09720529.2018.1564201","journal-title":"J Discrete Math Sci Cryptogr"},{"key":"289_CR51","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-76620-1_6","volume-title":"Number-theoretic methods in cryptology: first international conference, nutmic 2017, Warsaw, Poland, September 11\u201313, 2017, revised selected papers","author":"N Murru","year":"2017","unstructured":"Murru N, Saettone FM (2017) A novel RSA-Like cryptosystem based on a generalization of the r\u00e9dei rational functions. In: Kaczorowski J, Pieprzyk J, Pomykala J (eds) Number-theoretic methods in cryptology: first international conference, nutmic 2017, Warsaw, Poland, September 11\u201313, 2017, revised selected papers, vol 10737. Springer, Berlin, pp 91\u2013103. https:\/\/doi.org\/10.1007\/978-3-319-76620-1_6"},{"key":"289_CR52","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.tcs.2022.05.010","volume":"923","author":"DI Nassr","year":"2022","unstructured":"Nassr DI, Anwar M, Bahig HM (2022) Improving small private exponent attack on the Murru\u2013Saettone cryptosystem. Theor Comput Sci 923:222\u2013234. https:\/\/doi.org\/10.1016\/j.tcs.2022.05.010","journal-title":"Theor Comput Sci"},{"key":"289_CR53","doi-asserted-by":"publisher","unstructured":"Nemec M, S\u00fds M, Svenda P, Klinec D, Matyas V (2017) The return of coppersmith\u2019s attack: practical factorization of widely used RSA moduli. In: Thuraisingham B, Evans D, Malkin T, Xu D (eds) Proceedings of the 2017 ACM SIGSAC conference on computer and communications security, CCS 2017, Dallas, TX, USA, October 30\u2013November 03, 2017, pp 1631\u20131648. ACM. Retrieved from https:\/\/doi.org\/10.1145\/3133956.3133969","DOI":"10.1145\/3133956.3133969"},{"key":"289_CR54","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/10722028_4","volume-title":"Algorithmic number theory, 4th international symposium, ants-iv, Leiden, The Netherlands, July 2\u20137, 2000, proceedings","author":"PQ Nguyen","year":"2000","unstructured":"Nguyen PQ, Stern J (2000) Lattice reduction in cryptology: an update. In: Bosma W (ed) Algorithmic number theory, 4th international symposium, ants-iv, Leiden, The Netherlands, July 2\u20137, 2000, proceedings, vol 1838. Springer, Berlin, pp 85\u2013112. https:\/\/doi.org\/10.1007\/10722028_4"},{"key":"289_CR55","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and lattices, international conference, calc 2001, Providence, RI, USA, March 29\u201330, 2001, revised papers","author":"PQ Nguyen","year":"2001","unstructured":"Nguyen PQ, Stern J (2001) The two faces of lattices in cryptology. In: Silverman JH (ed) Cryptography and lattices, international conference, calc 2001, Providence, RI, USA, March 29\u201330, 2001, revised papers, vol 2146. Springer, Berlin, pp 146\u2013180. https:\/\/doi.org\/10.1007\/3-540-44670-2_12"},{"key":"289_CR56","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-68164-9_12","volume-title":"Progress in cryptology: AFRICACRYPT 2008, first international conference on cryptology in Africa, Casablanca, Morocco, June 11\u201314, 2008, proceedings","author":"A Nitaj","year":"2008","unstructured":"Nitaj A (2008) Another generalization of Wiener\u2019s attack on RSA. In: Vaudenay S (ed) Progress in cryptology: AFRICACRYPT 2008, first international conference on cryptology in Africa, Casablanca, Morocco, June 11\u201314, 2008, proceedings, vol 5023. Springer, Berlin, pp 174\u2013190. https:\/\/doi.org\/10.1007\/978-3-540-68164-9_12"},{"key":"289_CR57","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-02384-2_7","volume-title":"Progress in cryptology: AFRICACRYPT 2009, second international conference on cryptology in Africa, Gammarth, Tunisia, June 21\u201325, 2009, proceedings","author":"A Nitaj","year":"2009","unstructured":"Nitaj A (2009) Cryptanalysis of RSA using the ratio of the primes. In: Preneel B (ed) Progress in cryptology: AFRICACRYPT 2009, second international conference on cryptology in Africa, Gammarth, Tunisia, June 21\u201325, 2009, proceedings, vol 5580. Springer, Berlin, pp 98\u2013115. https:\/\/doi.org\/10.1007\/978-3-642-02384-2_7"},{"key":"289_CR58","doi-asserted-by":"publisher","unstructured":"Nitaj A, Rachidi T (2015) Factoring RSA moduli with weak prime factors. In: Hajji SE, Nitaj A, Carlet C, Souidi EM (eds) Codes, cryptology, and information security: first international conference, C2SI 2015, Rabat, Morocco, May 26\u201328, 2015, proceedings\u2014in honor of Thierry Berger, vol 9084, pp 361\u2013374. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-319-18681-8_29","DOI":"10.1007\/978-3-319-18681-8_29"},{"key":"289_CR59","doi-asserted-by":"publisher","first-page":"53788","DOI":"10.1109\/ACCESS.2022.3175519","volume":"10","author":"A Nitaj","year":"2022","unstructured":"Nitaj A, Ariffin MRBK, Adenan NNH, Lau TSC, Chen J (2022) Security issues of novel RSA variant. IEEE Access 10:53788\u201353796. https:\/\/doi.org\/10.1109\/ACCESS.2022.3175519","journal-title":"IEEE Access"},{"key":"289_CR60","doi-asserted-by":"publisher","unstructured":"Peng L, Hu L, Xu J, Huang Z, Xie Y (2014) Further improvement of factoring RSA moduli with implicit hint. In: Pointcheval D, Vergnaud D (eds) Progress in cryptology\u2014AFRICACRYPT 2014\u20147th international conference on cryptology in Africa, Marrakesh, Morocco, May 28\u201330, 2014, proceedings, vol 8469, pp 165\u2013177. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-319-06734-6_11","DOI":"10.1007\/978-3-319-06734-6_11"},{"key":"289_CR61","doi-asserted-by":"publisher","unstructured":"Peng L, Hu L, Lu Y, Huang Z, Xu J (2015) Implicit factorization of RSA moduli revisited (short paper). In: Tanaka K, Suga Y (eds) Advances in information and computer security\u201410th international workshop on security, IWSEC 2015, Nara, Japan, August 26\u201328, 2015, proceedings, vol 9241, pp 67\u201376. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-319-22425-1_5","DOI":"10.1007\/978-3-319-22425-1_5"},{"key":"289_CR62","doi-asserted-by":"publisher","DOI":"10.7312\/pric91844","volume-title":"Little science, big science","author":"DJDS Price","year":"1963","unstructured":"Price DJDS (1963) Little science, big science. Columbia University Press, New York. https:\/\/doi.org\/10.7312\/pric91844"},{"issue":"3683","key":"289_CR63","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1126\/science.149.3683.510","volume":"149","author":"DJDS Price","year":"1965","unstructured":"Price DJDS (1965) Networks of scientific papers: the pattern of bibliographic references indicates the nature of the scientific research front. Science 149(3683):510\u2013515. https:\/\/doi.org\/10.1126\/science.149.3683.510","journal-title":"Science"},{"issue":"21","key":"289_CR64","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1145\/359340.359342","volume":"18","author":"J-J Quisquater","year":"1982","unstructured":"Quisquater J-J, Couvreur C (1982) Fast decipherment algorithm for RSA public-key cryptosystem. Electron Lett 18(21):905\u2013907. https:\/\/doi.org\/10.1145\/359340.359342","journal-title":"Electron Lett"},{"key":"289_CR65","doi-asserted-by":"publisher","unstructured":"Rivest RL, Shamir A (1985) Efficient factoring based on partial information. In: Pichler F (ed) Advances in cryptology: EUROCRYPT \u201985, workshop on the theory and application of of cryptographic techniques, Linz, Austria, April 1985, proceedings, vol\u00a0219, pp 31\u201334. Springer. Retrieved from https:\/\/doi.org\/10.1007\/3-540-39805-8_3","DOI":"10.1007\/3-540-39805-8_3"},{"issue":"2","key":"289_CR66","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Shamir A, Adleman LM (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120\u2013126. https:\/\/doi.org\/10.1145\/359340.359342","journal-title":"Commun ACM"},{"key":"289_CR67","doi-asserted-by":"publisher","unstructured":"Sarkar S (2011) Partial key exposure: generalized framework to attack RSA. In: Bernstein DJ, Chatterjee S (eds) Progress in cryptology: INDOCRYPT 2011\u201412th international conference on cryptology in India, Chennai, India, December 11\u201314, 2011, proceedings, vol 7107, pp 76\u201392. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-642-25578-6_7","DOI":"10.1007\/978-3-642-25578-6_7"},{"issue":"6","key":"289_CR68","doi-asserted-by":"publisher","first-page":"4002","DOI":"10.1109\/TIT.2011.2137270","volume":"57","author":"S Sarkar","year":"2011","unstructured":"Sarkar S, Maitra S (2011) Approximate integer common divisor problem relates to implicit factorization. IEEE Trans Inf Theory 57(6):4002\u20134013. https:\/\/doi.org\/10.1109\/TIT.2011.2137270","journal-title":"IEEE Trans Inf Theory"},{"key":"289_CR69","doi-asserted-by":"publisher","unstructured":"Sarkar S, Maitra S (2012) Side channel attack to actual cryptanalysis: breaking CRT-RSA with low weight decryption exponents. In: Prouff E, Schaumont P (eds) Cryptographic hardware and embedded systems: CHES 2012\u201414th international workshop, Leuven, Belgium, September 9\u201312, 2012. proceedings, vol 7428, pp 476\u2013493. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-642-33027-8_28","DOI":"10.1007\/978-3-642-33027-8_28"},{"key":"289_CR70","doi-asserted-by":"publisher","unstructured":"Shi G, Wang G, Gu D (2022) Further cryptanalysis of a type of RSA variants. In: Susilo W, Chen X, Guo F, Zhang Y, Intan R (eds) Information security: 25th international conference, ISC 2022, Bali, Indonesia, December 18\u201322, 2022, proceedings, vol 13640, pp 133\u2013152. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-031-22390-7_9","DOI":"10.1007\/978-3-031-22390-7_9"},{"issue":"4","key":"289_CR71","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/asi.4630240406","volume":"24","author":"H Small","year":"1973","unstructured":"Small H (1973) Co-citation in the scientific literature: a new measure of the relationship between two documents. J Am Soc Inf Sci 24(4):265\u2013269. https:\/\/doi.org\/10.1002\/asi.4630240406","journal-title":"J Am Soc Inf Sci"},{"key":"289_CR72","doi-asserted-by":"publisher","unstructured":"Stern J (1998) Lattices and cryptography: an overview. In: Imai H, Zheng Y (eds) Public key cryptography, first international workshop on practice and theory in public key cryptography, PKC \u201998, Pacifico Yokohama, Japan, February 5\u20136, 1998, proceedings, vol 1431, pp 50\u201354. Springer. Retrieved from https:\/\/doi.org\/10.1007\/BFb0054013","DOI":"10.1007\/BFb0054013"},{"issue":"8","key":"289_CR73","doi-asserted-by":"publisher","first-page":"2922","DOI":"10.1109\/TIT.2007.901248","volume":"53","author":"H Sun","year":"2007","unstructured":"Sun H, Wu M, Ting W, Hinek MJ (2007) Dual RSA and its security analysis. IEEE Trans Inf Theory 53(8):2922\u20132933. https:\/\/doi.org\/10.1109\/TIT.2007.901248","journal-title":"IEEE Trans Inf Theory"},{"key":"289_CR74","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2020.07.004","volume":"841","author":"K Suzuki","year":"2020","unstructured":"Suzuki K, Takayasu A, Kunihiro N (2020) Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents. Theor Comput Sci 841:62\u201383. https:\/\/doi.org\/10.1016\/j.tcs.2020.07.004","journal-title":"Theor Comput Sci"},{"key":"289_CR75","doi-asserted-by":"publisher","unstructured":"Takagi T (1998) Fast RSA-type cryptosystem modulo $$p^k q$$. In: Krawczyk H (eds) Advances in cryptology: CRYPTO \u201998, 18th annual international cryptology conference, Santa Barbara, California, USA, August 23\u201327, 1998, proceedings, vol 1462, pp 318\u2013326. Springer. Retrieved from https:\/\/doi.org\/10.1007\/BFb0055738","DOI":"10.1007\/BFb0055738"},{"issue":"6","key":"289_CR76","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1587\/transfun.E97.A.1259","volume":"97\u2013A","author":"A Takayasu","year":"2014","unstructured":"Takayasu A, Kunihiro N (2014a) Better lattice constructions for solving multivariate linear equations modulo unknown divisors. IEICE Trans Fundam Electron Commun Comput Sci 97\u2013A(6):1259\u20131272. https:\/\/doi.org\/10.1587\/transfun.E97.A.1259","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"289_CR77","doi-asserted-by":"publisher","unstructured":"Takayasu A, Kunihiro N (2014b) Cryptanalysis of RSA with multiple small secret exponents. In: Susilo W, Mu Y (eds) Information security and privacy: 19th Australasian conference, ACISP 2014, Wollongong, NSW, Australia, July 7\u20139, 2014, proceedings, vol 8544, pp 176\u2013191. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-319-08344-5_12","DOI":"10.1007\/978-3-319-08344-5_12"},{"key":"289_CR78","doi-asserted-by":"publisher","unstructured":"Takayasu A, Kunihiro N (2014c) Partial key exposure attacks on RSA: achieving the Boneh\u2013Durfee bound. In: Joux A, Youssef AM (eds) Selected areas in cryptography: SAC 2014\u201421st international conference, Montreal, QC, Canada, August 14\u201315, 2014, revised selected papers, vol 8781, pp 345\u2013362. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-319-13051-4_21","DOI":"10.1007\/978-3-319-13051-4_21"},{"key":"289_CR79","doi-asserted-by":"publisher","unstructured":"Takayasu A, Kunihiro N (2015) Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents. In: Malkin T, Kolesnikov V, Lewko AB, Polychronakis M (eds) Applied cryptography and network security: 13th international conference, ACNS 2015, New York, NY, USA, June 2\u20135, 2015, revised selected papers, vol 9092, pp 518\u2013537. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-319-28166-7_25","DOI":"10.1007\/978-3-319-28166-7_25"},{"key":"289_CR80","doi-asserted-by":"publisher","unstructured":"Takayasu A, Kunihiro N (2016) Partial key exposure attacks on CRT-RSA: General improvement for the exposed least significant bits. In: Bishop M, Nascimento ACA (eds) Information security: 19th international conference, ISC 2016, Honolulu, HI, USA, September 3\u20136, 2016, proceedings, vol 9866, pp 35\u201347. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-319-45871-7_3","DOI":"10.1007\/978-3-319-45871-7_3"},{"key":"289_CR81","doi-asserted-by":"publisher","unstructured":"Takayasu A, Kunihiro N (2017) A tool kit for partial key exposure attacks on RSA. In: Handschuh H (eds) Topics in cryptology: CT-RSA 2017\u2014the cryptographers\u2019 track at the RSA conference 2017, San Francisco, CA, USA, February 14\u201317, 2017, proceedings, vol 10159, pp 58\u201373. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-319-52153-4_4","DOI":"10.1007\/978-3-319-52153-4_4"},{"key":"289_CR82","doi-asserted-by":"publisher","first-page":"241","DOI":"10.46586\/tches.v2023.i2.241-269","volume":"2","author":"R Ueno","year":"2023","unstructured":"Ueno R (2023) Homma N (2023) How secure is exponent-blinded RSA-CRT with sliding window exponentiation? IACR Trans Cryptogr Hardw Embed Syst 2:241\u2013269. https:\/\/doi.org\/10.46586\/tches.v2023.i2.241-269","journal-title":"IACR Trans Cryptogr Hardw Embed Syst"},{"issue":"2","key":"289_CR83","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s11192-009-0146-3","volume":"84","author":"NJ van Eck","year":"2010","unstructured":"van Eck NJ, Waltman L (2010) Software survey: VOSviewer, a computer program for bibliometric mapping. Scientometrics 84(2):523\u2013538. https:\/\/doi.org\/10.1007\/s11192-009-0146-3","journal-title":"Scientometrics"},{"issue":"1","key":"289_CR84","doi-asserted-by":"publisher","first-page":"121","DOI":"10.3934\/amc.2019007","volume":"13","author":"S Wang","year":"2019","unstructured":"Wang S, Qu L, Li C, Wang H (2019) Further improvement of factoring N = prqs with partial known bits. Adv Math Commun 13(1):121\u2013135. https:\/\/doi.org\/10.3934\/amc.2019007","journal-title":"Adv Math Commun"},{"issue":"3","key":"289_CR85","doi-asserted-by":"publisher","first-page":"441","DOI":"10.3934\/amc.2020076","volume":"15","author":"S Wang","year":"2021","unstructured":"Wang S, Qu L, Li C, Fu S, Chen H (2021) Finding small solutions of the equation bx \u2212 ay = z and its applications to cryptanalysis of the RSA cryptosystem. Adv Math Commun 15(3):441\u2013469. https:\/\/doi.org\/10.3934\/amc.2020076","journal-title":"Adv Math Commun"},{"issue":"3","key":"289_CR86","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1002\/asi.4630320302","volume":"32","author":"HD White","year":"1981","unstructured":"White HD, Griffith BC (1981) Author cocitation: a literature measure of intellectual structure. J Am Soc Inf Sci 32(3):163\u2013171. https:\/\/doi.org\/10.1002\/asi.4630320302","journal-title":"J Am Soc Inf Sci"},{"issue":"3","key":"289_CR87","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"MJ Wiener","year":"1990","unstructured":"Wiener MJ (1990) Cryptanalysis of short RSA secret exponents. IEEE Trans Inf Theory 36(3):553\u2013558. https:\/\/doi.org\/10.1109\/18.54902","journal-title":"IEEE Trans Inf Theory"},{"key":"289_CR88","doi-asserted-by":"publisher","unstructured":"Zheng M (2023) Partial key exposure attack on common prime RSA. In: Ge C, Yung M (eds) Information security and cryptology: 19th international conference, inscrypt 2023, Hangzhou, China, December 9\u201310, 2023, revised selected papers, part II, vol 14527, pp 407\u2013410. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-981-97-0945-8_27","DOI":"10.1007\/978-981-97-0945-8_27"},{"key":"289_CR89","doi-asserted-by":"publisher","unstructured":"Zheng M, Kunihiro N, Hu H (2017) Improved factoring attacks on multi-prime RSA with small prime difference. In: Pieprzyk J, Suriadi S (eds) Information security and privacy: 22nd Australasian conference, ACISP 2017, Auckland, New Zealand, July 3\u20135, 2017, proceedings, part I, vol 10342, pp 324\u2013342. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-319-60055-0_17","DOI":"10.1007\/978-3-319-60055-0_17"},{"issue":"8","key":"289_CR90","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1587\/transfun.2019EAP1170","volume":"103\u2013A","author":"M Zheng","year":"2020","unstructured":"Zheng M, Kunihiro N, Hu H (2020) Lattice-based cryptanalysis of RSA with implicitly related keys. IEICE Trans Fundam Electron Commun Comput Sci 103\u2013A(8):959\u2013968. https:\/\/doi.org\/10.1587\/transfun.2019EAP1170","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"289_CR91","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2021.08.001","volume":"889","author":"M Zheng","year":"2021","unstructured":"Zheng M, Kunihiro N, Yao Y (2021) Cryptanalysis of the RSA variant based on cubic Pell equation. Theor Comput Sci 889:135\u2013144. https:\/\/doi.org\/10.1016\/j.tcs.2021.08.001","journal-title":"Theor Comput Sci"},{"key":"289_CR92","doi-asserted-by":"publisher","first-page":"34674","DOI":"10.1109\/ACCESS.2023.3264590","volume":"11","author":"M Zheng","year":"2023","unstructured":"Zheng M, Chen Z, Wu Y (2023) Solving generalized bivariate integer equations and its application to factoring with known bits. IEEE Access 11:34674\u201334684. https:\/\/doi.org\/10.1109\/ACCESS.2023.3264590","journal-title":"IEEE Access"},{"key":"289_CR93","doi-asserted-by":"publisher","unstructured":"Zhou Y, van\u00a0de Pol J, Yu Y, Standaert F (2022) A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding. In: Agrawal S, Lin D (eds) Advances in cryptology: ASIACRYPT 2022\u201428th international conference on the theory and application of cryptology and information security, Taipei, Taiwan, December 5\u20139, 2022, proceedings, part IV, vol 13794, pp 508\u2013536. Springer. Retrieved from https:\/\/doi.org\/10.1007\/978-3-031-22972-5_18","DOI":"10.1007\/978-3-031-22972-5_18"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00289-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-024-00289-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00289-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T03:03:01Z","timestamp":1733972581000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-024-00289-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"references-count":93,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["289"],"URL":"https:\/\/doi.org\/10.1186\/s42400-024-00289-7","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"11 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"74"}}