{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T15:29:04Z","timestamp":1746199744968},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T00:00:00Z","timestamp":1508976000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s11432-017-9176-5","type":"journal-article","created":{"date-parts":[[2017,11,4]],"date-time":"2017-11-04T05:06:50Z","timestamp":1509772010000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A better bound for implicit factorization problem with shared middle bits"],"prefix":"10.1007","volume":"61","author":[{"given":"Shixiong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longjiang","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaojing","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,26]]},"reference":[{"key":"9176_CR1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R L Rivest","year":"1978","unstructured":"Rivest R L, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems. Commun ACM, 1978, 21: 120\u2013126","journal-title":"Commun ACM"},{"key":"9176_CR2","first-page":"155","volume-title":"Finding a small root of a univariate modular equation","author":"D Coppersmith","year":"1996","unstructured":"Coppersmith D. Finding a small root of a univariate modular equation. In: Advances in Cryptology-EUROCRYPT 1996. Berlin-Heidelberg: Springer, 1996. 155\u2013165"},{"key":"9176_CR3","doi-asserted-by":"crossref","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, 1997, 10: 233\u2013260","journal-title":"J Cryptol"},{"key":"9176_CR4","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"M J Wiener","year":"1990","unstructured":"Wiener M J. Cryptanalysis of short RSA secret exponents. IEEE Trans Inform Theory, 1990, 36: 553\u2013558","journal-title":"IEEE Trans Inform Theory"},{"key":"9176_CR5","first-page":"1","volume-title":"Cryptanalysis of RSA with private key d less than N 0.292","author":"D Boneh","year":"1999","unstructured":"Boneh D, Durfee G. Cryptanalysis of RSA with private key d less than N\n                                    0.292. In: Advances in Cryptology-EUROCRYPT 1999. Berlin-Heidelberg: Springer, 1999. 1\u201311"},{"key":"9176_CR6","first-page":"25","volume-title":"An attack on RSA given a small fraction of the private key bits","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: Advances in Cryptology-ASIACRYPT 1998. Berlin-Heidelberg: Springer, 1998. 25\u201334"},{"key":"9176_CR7","first-page":"27","volume-title":"New partial key exposure attacks on RSA","author":"J Bl\u00a8omer","year":"2003","unstructured":"Bl\u00a8omer J, May A. New partial key exposure attacks on RSA. In: Advances in Cryptology-CRYPTO 2003. Berlin-Heidelberg: Springer, 2003. 27\u201343"},{"key":"9176_CR8","first-page":"371","volume-title":"Partial key exposure attacks on RSA up to full size exponents","author":"M Ernst","year":"2005","unstructured":"Ernst M, Jochemsz E, May A, et al. Partial key exposure attacks on RSA up to full size exponents. In: Advances in Cryptology-EUROCRYPT 2005. Berlin-Heidelberg: Springer, 2005. 371\u2013386"},{"key":"9176_CR9","first-page":"34","volume-title":"A new lattice construction for partial key exposure attack for RSA","author":"Y Aono","year":"2009","unstructured":"Aono Y. A new lattice construction for partial key exposure attack for RSA. In: Public Key Cryptography-PKC 2009. Berlin-Heidelberg: Springer, 2009. 34\u201353"},{"key":"9176_CR10","first-page":"2","volume-title":"Partial key exposure attack on RSA-improvements for limited lattice dimensions","author":"S Sarkar","year":"2010","unstructured":"Sarkar S, Gupta S S, Maitra S. Partial key exposure attack on RSA-improvements for limited lattice dimensions. In: Progress in Cryptology-INDOCRYPT 2010. Berlin-Heidelberg: Springer, 2010. 2\u201316"},{"key":"9176_CR11","first-page":"76","volume-title":"Partial key exposure: generalized framework to attack RSA","author":"S Sarkar","year":"2011","unstructured":"Sarkar S. Partial key exposure: generalized framework to attack RSA. In: Progress in Cryptology-INDOCRYPT 2011. Berlin-Heidelberg: Springer, 2011. 76\u201392"},{"key":"9176_CR12","first-page":"213","volume-title":"Computing the RSA secret key is deterministic polynomial time equivalent to factoring","author":"A May","year":"2004","unstructured":"May A. Computing the RSA secret key is deterministic polynomial time equivalent to factoring. In: Advances in Cryptology-CRYPTO 2004. Berlin-Heidelberg: Springer, 2004. 213\u2013219"},{"key":"9176_CR13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s00145-006-0433-6","volume":"20","author":"J S Coron","year":"2007","unstructured":"Coron J S, May A. Deterministic polynomial-time equivalence of computing the RSA secret key and factoring. J Cryptol, 2007, 20: 39\u201350","journal-title":"J Cryptol"},{"key":"9176_CR14","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s11432-009-0014-z","volume":"52","author":"P Luo","year":"2009","unstructured":"Luo P, Zhou H J, Wang D S, et al. Cryptanalysis of RSA for a special case with d > e. Sci China Ser F-Inf Sci, 2009, 52: 609\u2013616","journal-title":"Sci China Ser F-Inf Sci"},{"key":"9176_CR15","doi-asserted-by":"crossref","first-page":"032108","DOI":"10.1007\/s11432-015-5325-7","volume":"59","author":"M Zheng","year":"2016","unstructured":"Zheng M, Hu H, Wang Z. Generalized cryptanalysis of RSA with small public exponent. Sci China Inf Sci, 2016, 59: 032108","journal-title":"Sci China Inf Sci"},{"key":"9176_CR16","first-page":"1","volume-title":"Implicit factoring: on polynomial time factoring given only an implicit hint","author":"A May","year":"2009","unstructured":"May A, Ritzenhofen M. Implicit factoring: on polynomial time factoring given only an implicit hint. In: Public Key Cryptography-PKC 2009. Berlin-Heidelberg: Springer, 2009. 1\u201314"},{"key":"9176_CR17","first-page":"70","volume-title":"Implicit factoring with shared most significant and middle bits","author":"J C Faug`ere","year":"2010","unstructured":"Faug`ere J C, Marinier R, Renault G. Implicit factoring with shared most significant and middle bits. In: Public Key Cryptography-PKC 2010. Berlin-Heidelberg: Springer, 2010. 70\u201387"},{"key":"9176_CR18","first-page":"178","volume-title":"Finding a small root of a bivariate integer equation; factoring with high bits known","author":"D Coppersmith","year":"1996","unstructured":"Coppersmith D. Finding a small root of a bivariate integer equation; factoring with high bits known. In: Advances in Cryptology-EUROCRYPT 1996. Berlin-Heidelberg: Springer, 1996. 178\u2013189"},{"key":"9176_CR19","doi-asserted-by":"crossref","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. Crytography and Coding. Berlin: Springer, 1997. 131\u2013142"},{"key":"9176_CR20","first-page":"492","volume-title":"Finding small roots of bivariate integer polynomial equations revisited","author":"J S Coron","year":"2004","unstructured":"Coron J S. Finding small roots of bivariate integer polynomial equations revisited. In: Advances in Cryptology- EUROCRYPT 2004. Berlin-Heidelberg: Springer, 2004. 492\u2013505"},{"key":"9176_CR21","doi-asserted-by":"crossref","first-page":"4002","DOI":"10.1109\/TIT.2011.2137270","volume":"57","author":"S Sarkar","year":"2011","unstructured":"Sarkar S, Maitra S. Approximate integer common divisor problem relates to implicit factorization. IEEE Trans Inform Theory, 2011, 57: 4002\u20134013","journal-title":"IEEE Trans Inform Theory"},{"key":"9176_CR22","doi-asserted-by":"crossref","first-page":"243","DOI":"10.3934\/amc.2013.7.243","volume":"7","author":"Y Lu","year":"2013","unstructured":"Lu Y, Zhang R, Lin D. Improved bounds for the implicit factorization problem. Adv Math Commun, 2013, 7: 243\u2013251","journal-title":"Adv Math Commun"},{"key":"9176_CR23","first-page":"165","volume-title":"Further improvement of factoring RSA moduli with implicit hint","author":"L Q Peng","year":"2014","unstructured":"Peng L Q, Hu L, Xu J, et al. Further improvement of factoring RSA moduli with implicit hint. In: Progress in Cryptology-AFRICACRYPT 2014. Berlin: Springer, 2014. 165\u2013177"},{"key":"9176_CR24","first-page":"462","volume-title":"Towards optimal bounds for implicit factorization problem","author":"Y Lu","year":"2015","unstructured":"Lu Y, Peng L Q, Zhang R, et al. Towards optimal bounds for implicit factorization problem. In: Selected Areas in Cryptography-SAC 2015. Berlin: Springer, 2015. 462\u2013476"},{"key":"9176_CR25","first-page":"67","volume-title":"Implicit factorization of RSA moduli revisited (short paper)","author":"L Q Peng","year":"2015","unstructured":"Peng L Q, Hu L, Lu Y, et al. Implicit factorization of RSA moduli revisited (short paper). In: Advances in Information and Computer Security. Berlin: Springer, 2015. 67\u201376"},{"key":"9176_CR26","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A K Lenstra","year":"1982","unstructured":"Lenstra A K, Lenstra H W, Lov\u00e1sz L. Factoring polynomials with rational coefficients. Math Ann, 1982, 261: 515\u2013534","journal-title":"Math Ann"},{"key":"9176_CR27","volume-title":"New RSA vulnerabilities using lattice reduction methods","author":"A May","year":"2003","unstructured":"May A. New RSA vulnerabilities using lattice reduction methods. Dissertation for Ph.D. Degree. Paderborn: University of Paderborn, 2003"},{"key":"9176_CR28","first-page":"1","volume-title":"New attacks on RSA with small secret CRT-exponents","author":"D Bleichenbacher","year":"2006","unstructured":"Bleichenbacher D, May A. New attacks on RSA with small secret CRT-exponents. In: Public Key Cryptography-PKC 2006. Berlin-Heidelberg: Springer, 2006. 1\u201313"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-017-9176-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-017-9176-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-017-9176-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,4]],"date-time":"2017-11-04T05:06:55Z","timestamp":1509772015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-017-9176-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,26]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["9176"],"URL":"https:\/\/doi.org\/10.1007\/s11432-017-9176-5","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,26]]},"article-number":"032109"}}