{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:12:45Z","timestamp":1762506765188,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,3,22]],"date-time":"2016-03-22T00:00:00Z","timestamp":1458604800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the National Key Basic Research Program of China","award":["2013CB834203"],"award-info":[{"award-number":["2013CB834203"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61472417","61402469"],"award-info":[{"award-number":["61472417","61402469"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10623-016-0196-5","type":"journal-article","created":{"date-parts":[[2016,3,22]],"date-time":"2016-03-22T11:12:01Z","timestamp":1458645121000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Cryptanalysis of Dual RSA"],"prefix":"10.1007","volume":"83","author":[{"given":"Liqiang","family":"Peng","sequence":"first","affiliation":[]},{"given":"Lei","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Yao","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Zhangjie","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"key":"196_CR1","doi-asserted-by":"crossref","unstructured":"Boneh D., Durfee G.: Cryptanalysis of RSA with private key d less than N $${}^{\\text{0.292 }}$$ 0.292 . IEEE Trans. Inf. Theory 46(4), 1339\u20131349 (2000).","DOI":"10.1109\/18.850673"},{"key":"196_CR2","doi-asserted-by":"crossref","unstructured":"Bosma W., Cannon J.J., Playoust C.: The magma algebra system I: the user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997).","DOI":"10.1006\/jsco.1996.0125"},{"key":"196_CR3","doi-asserted-by":"crossref","unstructured":"Coppersmith D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptol. 10(4), 233\u2013260 (1997).","DOI":"10.1007\/s001459900030"},{"key":"196_CR4","doi-asserted-by":"crossref","unstructured":"Gama N., Nguyen P.Q.: Predicting lattice reduction. In: Smart N. (ed.) EUROCRYPT 2008. Lecture Notes in Computer Science, vol. 4965, pp. 31\u201351. Springer, Heidelberg (2008).","DOI":"10.1007\/978-3-540-78967-3_3"},{"key":"196_CR5","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-642-13013-7_4"},{"key":"196_CR6","unstructured":"Hinek M.J.: On the security of some variants of RSA. Ph.D.thesis, University of Waterloo, Waterloo (2007)."},{"key":"196_CR7","unstructured":"Hoffstein J., Pipher J., Silverman J.H.: An Inroduction to Mathematical Cryptography. Springer, Berlin (2008)."},{"key":"196_CR8","doi-asserted-by":"crossref","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).","DOI":"10.1007\/BFb0024458"},{"key":"196_CR9","doi-asserted-by":"crossref","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. Lecture Notes in Computer Science, vol. 4284, pp. 267\u2013282. Springer, Heidelberg (2006).","DOI":"10.1007\/11935230_18"},{"key":"196_CR10","doi-asserted-by":"crossref","unstructured":"Joye M.: RSA moduli with a predetermined portion: techniques and applications. In: Chen L., Mu Y., Susilo, W. (eds.) ISPEC 2008. Lecture Notes in Computer Science, vol. 4991, pp. 116\u2013130. Springer, Heidelberg (2008).","DOI":"10.1007\/978-3-540-79104-1_9"},{"key":"196_CR11","doi-asserted-by":"crossref","unstructured":"Kleinjung T., Aoki K., Franke J., Lenstra A.K., Thom\u00e9 E., Bos J.W., Gaudry P., Kruppa A., Montgomery P.L., Osvik D.A., te Riele H.J.J., Timofeev A., Zimmermann P.: Factorization of a 768-bit RSA modulus. In: Rabin T. (ed.) CRYPTO 2010. Lecture Notes in Computer Science, vol. 6223, pp. 333\u2013350. Springer, Heidelberg (2010).","DOI":"10.1007\/978-3-642-14623-7_18"},{"key":"196_CR12","doi-asserted-by":"crossref","unstructured":"Lenstra A.K.: Generating RSA moduli with a predetermined portion. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. Lecture Notes in Computer Science, vol. 1514, pp. 1\u201310. Springer, Heidelberg (1998).","DOI":"10.1007\/3-540-49649-1_1"},{"key":"196_CR13","doi-asserted-by":"crossref","unstructured":"Lenstra A.K., de Weger B.M.M.: Twin RSA. In: Dawson E., Vaudenay S. (eds.) Mycrypt 2005. Lecture Notes in Computer Science, vol. 3715, pp. 222\u2013228. Springer, Heidelberg (2005).","DOI":"10.1007\/11554868_16"},{"key":"196_CR14","doi-asserted-by":"crossref","unstructured":"Lenstra A.K., Lenstra H.W., Lov\u00e1sz L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982).","DOI":"10.1007\/BF01457454"},{"key":"196_CR15","doi-asserted-by":"crossref","unstructured":"Lenstra A.K., Tromer E., Shamir A., Kortsmit W., Dodson B., Hughes J.P., Leyland P.C.: Factoring estimates for a 1024-bit RSA modulus. In: Laih C.S. (ed.) ASIACRYPT 2003. Lecture Notes in Computer Science, vol. 2894, pp. 55\u201374. Springer, Heidelberg (2003).","DOI":"10.1007\/978-3-540-40061-5_4"},{"key":"196_CR16","doi-asserted-by":"crossref","unstructured":"Nguyen P.Q., Vall\u00e9e B. (eds.): The LLL Algorithm\u2014Survey and Applications. Series in Information Security and Cryptography. Springer, Heidelberg (2010).","DOI":"10.1007\/978-3-642-02295-1"},{"key":"196_CR17","doi-asserted-by":"crossref","unstructured":"Peng L., Hu L., Xu J., Huang Z., Xie Y.: Further improvement of factoring RSA moduli with implicit hint. In: Pointcheval D., Vergnaud D. (eds.) AFRICACRYPT 2014. Lecture Notes in Computer Science, vol. 8469, pp. 165\u2013177. Springer International Publishing, Switzerland (2014).","DOI":"10.1007\/978-3-319-06734-6_11"},{"key":"196_CR18","doi-asserted-by":"crossref","unstructured":"Rivest R.L., Shamir A., Adleman L.M.: A method for obtaining digital signatures and public-key cryptosystems (reprint). Commun. ACM 26(1), 96\u201399 (1983).","DOI":"10.1145\/357980.358017"},{"key":"196_CR19","doi-asserted-by":"crossref","unstructured":"Sarkar S., Maitra S.: Cryptanalytic results on \u2019Dual CRT\u2019 and \u2019Common Prime\u2019 RSA. Des. Codes Cryptogr. 66(1\u20133), 157\u2013174 (2013).","DOI":"10.1007\/s10623-012-9675-5"},{"key":"196_CR20","doi-asserted-by":"crossref","unstructured":"Shparlinski I.: On RSA moduli with prescribed bit patterns. Des. Codes Cryptogr. 39(1), 113\u2013122 (2006).","DOI":"10.1007\/s10623-005-3137-2"},{"key":"196_CR21","doi-asserted-by":"crossref","unstructured":"Sun H., Wu M., Ting W., Hinek M.J.: Dual RSA and its security analysis. IEEE Trans. Inf. Theory 53(8), 2922\u20132933 (2007).","DOI":"10.1109\/TIT.2007.901248"},{"key":"196_CR22","unstructured":"Takagi T.: Fast RSA-type cryptosystem modulo p $${}^{\\rm {k}}$$ k q. In: Krawczyk H. (ed.) CRYPTO 1998. Lecture Notes in Computer Science, vol. 1462, pp. 318\u2013326. Springer, Heidelberg (1998)."},{"key":"196_CR23","doi-asserted-by":"crossref","unstructured":"Takayasu A., Kunihiro N.: Better lattice constructions for solving multivariate linear equations modulo unknown divisors. IEICE Trans. 97-A(6), 1259\u20131272 (2014).","DOI":"10.1587\/transfun.E97.A.1259"},{"key":"196_CR24","doi-asserted-by":"crossref","unstructured":"Takayasu A., Kunihiro N.: Partial key exposure attacks on RSA: achieving the boneh-durfee bound. In: Joux A., Youssef A.M. (eds.) SAC 2014. Lecture Notes in Computer Science, vol. 8781, pp. 345\u2013362. Springer International Publishing, Switzerland (2014).","DOI":"10.1007\/978-3-319-13051-4_21"},{"key":"196_CR25","doi-asserted-by":"crossref","unstructured":"Vanstone S.A., Zuccherato R.J.: Short RSA keys and their generation. J. Cryptol. 8(2), 101\u2013114 (1995).","DOI":"10.1007\/BF00190758"},{"key":"196_CR26","doi-asserted-by":"crossref","unstructured":"Wiener M.J.: Cryptanalysis of short RSA secret exponents. IEEE Trans. Inf. Theory 36(3), 553\u2013558 (1990).","DOI":"10.1109\/18.54902"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0196-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0196-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0196-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0196-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T15:55:35Z","timestamp":1600358135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0196-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,22]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["196"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0196-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2016,3,22]]}}}