{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:37:00Z","timestamp":1772807820635,"version":"3.50.1"},"reference-count":21,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2019]]},"DOI":"10.3934\/amc.2019007","type":"journal-article","created":{"date-parts":[[2018,12,19]],"date-time":"2018-12-19T08:53:46Z","timestamp":1545209626000},"page":"121-135","source":"Crossref","is-referenced-by-count":5,"title":["Further improvement of factoring <inline-formula><tex-math id=\"M1\">$ N = p^r q^s$<\/tex-math><\/inline-formula> with partial known bits"],"prefix":"10.3934","volume":"13","author":[{"given":"Shixiong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longjiang","family":"Qu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Cryptology, Beijing 100878, China"},{"name":"College of Liberal Arts and Sciences, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer, National University of Defense Technology, Changsha 410073, China"},{"name":"College of Liberal Arts and Sciences, National University of Defense Technology, Changsha 410073, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore 637371, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2019007-1","doi-asserted-by":"publisher","unstructured":"D. Boneh, G. Durfee and N. Howgrave-Graham, Factoring \\begin{document}$ N = p^r q$\\end{document}<\/tex-math><\/inline-formula> for large \\begin{document}$ r$\\end{document}<\/tex-math><\/inline-formula>, Advances in Cryptology-CRYPTO 1999<\/i>, Springer Berlin Heidelberg, 1666<\/b> (1999), 326-337.","DOI":"10.1007\/3-540-48405-1_21"},{"key":"key-10.3934\/amc.2019007-2","unstructured":"T. Collins, D. Hopkins, S. Langford and M. Sabin, Public key cryptographic apparatus and method, U.S. Patent<\/i>, (1998), 5848159."},{"key":"key-10.3934\/amc.2019007-3","doi-asserted-by":"publisher","unstructured":"D. Coppersmith, Finding a small root of a univariate modular equation, Advances in Cryptology-EUROCRYPT 1996<\/i>, Springer Berlin Heidelberg, 1070<\/b> (1996), 155-165.","DOI":"10.1007\/3-540-68339-9_14"},{"key":"key-10.3934\/amc.2019007-4","doi-asserted-by":"publisher","unstructured":"D. Coppersmith, Finding a small root of a bivariate integer equation; factoring with high bits known, Advances in Cryptology-EUROCRYPT 1996<\/i>, Springer Berlin Heidelberg, 1070<\/b> (1996), 178-189.","DOI":"10.1007\/3-540-68339-9_16"},{"key":"key-10.3934\/amc.2019007-5","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900030"},{"key":"key-10.3934\/amc.2019007-6","doi-asserted-by":"publisher","unstructured":"J. S. Coron, J. C. Faug\u00e8re, G. Renault and R. Zeitoun, Factoring \\begin{document}$ N = p^rq^s$\\end{document}<\/tex-math><\/inline-formula> for large \\begin{document}$ r$\\end{document}<\/tex-math><\/inline-formula> and \\begin{document}$ s$\\end{document}<\/tex-math><\/inline-formula>, Cryptographers' Track at the RSA Conference<\/i>, Springer, Cham, 9610<\/b> (2016), 448-464.","DOI":"10.1007\/978-3-319-29485-8_26"},{"key":"key-10.3934\/amc.2019007-7","unstructured":"J. S. Coron and R. Zeitoun, Improved factorization of \\begin{document}$ N = p^rq^s$\\end{document}<\/tex-math><\/inline-formula>, Cryptographers' Track at the RSA Conference<\/i>, Springer, Cham, 2018, 65-79."},{"key":"key-10.3934\/amc.2019007-8","unstructured":"M. Herrmann and A. May, On factoring arbitrary integers with known bits, IACR Cryptology ePrint Archive<\/i>, 2007, 374, https:\/\/eprint.iacr.org\/2007\/374<\/a>."},{"key":"key-10.3934\/amc.2019007-9","doi-asserted-by":"publisher","DOI":"10.1515\/JMC.2008.006"},{"key":"key-10.3934\/amc.2019007-10","doi-asserted-by":"publisher","unstructured":"N. Howgrave-Graham, Finding small roots of univariate modular equations revisited, Crytography and Coding<\/i>, Springer Berlin Heidelberg, 1335<\/b> (1997), 131-142.","DOI":"10.1007\/BFb0024458"},{"key":"key-10.3934\/amc.2019007-11","doi-asserted-by":"publisher","unstructured":"N. Howgrave-Graham, Approximate integer common divisors, Cryptography and Lattices<\/i>, Springer Berlin Heidelberg, 2146<\/b> (2001), 51-66.","DOI":"10.1007\/3-540-44670-2_6"},{"key":"key-10.3934\/amc.2019007-12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"key-10.3934\/amc.2019007-13","doi-asserted-by":"publisher","unstructured":"S. Lim, S. Kim, I. Yie and H. Lee, A generalized Takagi-cryptosystem with a modulus of the form \\begin{document}$ p^r q^s$\\end{document}<\/tex-math><\/inline-formula>, Progress in Cryptology-INDOCRYPT 2000<\/i>, Springer Berlin Heidelberg, 1977<\/b> (2000), 283-294.","DOI":"10.1007\/3-540-44495-5_25"},{"key":"key-10.3934\/amc.2019007-14","unstructured":"Y. Lu, L. Peng and S. Sarkar, Cryptanalysis of an RSA variant with moduli \\begin{document}$ N = p^rq^l$\\end{document}<\/tex-math><\/inline-formula>, The 9th International Workshop on Coding and Cryptography 2015, WCC 2015."},{"key":"key-10.3934\/amc.2019007-15","unstructured":"A. May, New RSA Vulnerabilities Using Lattice Reduction Methods<\/i>, Ph.D. thesis, University of Paderborn, 2003."},{"key":"key-10.3934\/amc.2019007-16","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"key-10.3934\/amc.2019007-17","doi-asserted-by":"crossref","unstructured":"B. Santoso, N. Kunihiro, N. Kanayama and K. Ohta, Factorization of square-free integers with high bits known, Progress in Cryptology-VIETCRYPT 2006<\/i>, Springer, Berlin, Heidelberg, 2006,115-130.","DOI":"10.1007\/11958239_8"},{"key":"key-10.3934\/amc.2019007-18","doi-asserted-by":"crossref","unstructured":"T. Takagi, Fast RSA-type cryptosystem modulo \\begin{document}$ p^k q$\\end{document}<\/tex-math><\/inline-formula>, Advances in Cryptology-CRYPTO 1998<\/i>, Springer Berlin Heidelberg, 1998,318-326.","DOI":"10.1007\/BFb0055738"},{"key":"key-10.3934\/amc.2019007-19","doi-asserted-by":"crossref","unstructured":"H. Zhang and T. Takagi, Attacks on multi-prime RSA with small prime difference, Australasian Conference on Information Security and Privacy<\/i>, Springer, Berlin, Heidelberg, 2013, 41-56.","DOI":"10.1007\/978-3-642-39059-3_4"},{"key":"key-10.3934\/amc.2019007-20","doi-asserted-by":"crossref","unstructured":"M. Zheng, N. Kunihiro and H. Hu, Improved factoring attacks on multi-prime RSA with small prime difference, Australasian Conference on Information Security and Privacy<\/i>, Springer, Cham, 2017,324-342.","DOI":"10.1007\/978-3-319-60055-0_17"},{"key":"key-10.3934\/amc.2019007-21","unstructured":"SageMath, the Sage Mathematics Software System, the Sage Developers, 2018, http:\/\/www.sagemath.org<\/a>."}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/aimsciences.org\/download\/files\/1930-5346_2019_1_121.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:03:50Z","timestamp":1772791430000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2019007"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2019007","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}