{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:39Z","timestamp":1772283699518,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319600543","type":"print"},{"value":"9783319600550","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60055-0_17","type":"book-chapter","created":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T22:14:16Z","timestamp":1496096056000},"page":"324-342","source":"Crossref","is-referenced-by-count":4,"title":["Improved Factoring Attacks on Multi-prime RSA with Small Prime Difference"],"prefix":"10.1007","author":[{"given":"Mengce","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Noboru","family":"Kunihiro","sequence":"additional","affiliation":[]},{"given":"Honggang","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-34129-8_4","volume-title":"Information and Communications Security","author":"HM Bahig","year":"2012","unstructured":"Bahig, H.M., Bhery, A., Nassr, D.I.: Cryptanalysis of multi-prime RSA with small prime difference. In: Chim, T.W., Yuen, T.H. (eds.) ICICS 2012. LNCS, vol. 7618, pp. 33\u201344. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-34129-8_4"},{"issue":"4","key":"17_CR2","doi-asserted-by":"crossref","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 \n            $$d$$\n           less than \n            $${N}^{0.292}$$\n          . IEEE Trans. Inf. Theory 46(4), 1339\u20131349 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"17_CR3","first-page":"1","volume":"5","author":"D Boneh","year":"2002","unstructured":"Boneh, D., Shacham, H.: Fast variants of RSA. CryptoBytes 5(1), 1\u20139 (2002)","journal-title":"CryptoBytes"},{"key":"17_CR4","unstructured":"Ciet, M., Koeune, F., Laguillaumie, F., Quisquater, J.J.: Short private exponent attacks on fast variants of RSA. Technical report, UCL Crypto Group Technical Report Series CG-2002\/4, Universit\u00e9 Catholique de Louvain (2002)"},{"key":"17_CR5","unstructured":"Collins, T., Hopkins, D., Langford, S., Sabin, M.: Public key cryptographic apparatus and method, US Patent#5,848,159 (1997)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-68339-9_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1996","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. LNCS, vol. 1070, pp. 178\u2013189. Springer, Heidelberg (1996). doi:\n10.1007\/3-540-68339-9_16"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1996","author":"D Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a univariate modular equation. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 155\u2013165. Springer, Heidelberg (1996). doi:\n10.1007\/3-540-68339-9_14"},{"issue":"4","key":"17_CR8","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. Cryptology 10(4), 233\u2013260 (1997)","journal-title":"J. Cryptology"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-540-24676-3_29","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"J-S Coron","year":"2004","unstructured":"Coron, J.-S.: Finding small roots of bivariate integer polynomial equations revisited. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 492\u2013505. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-24676-3_29"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-74143-5_21","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"J-S Coron","year":"2007","unstructured":"Coron, J.-S.: Finding small roots of bivariate integer polynomial equations: a direct approach. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 379\u2013394. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-74143-5_21"},{"issue":"1","key":"17_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s002000100088","volume":"13","author":"B Weger De","year":"2002","unstructured":"De Weger, B.: Cryptanalysis of RSA with small prime difference. Appl. Algebra Eng. Commun. Comput. 13(1), 17\u201328 (2002)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-540-89255-7_25","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"M Herrmann","year":"2008","unstructured":"Herrmann, M., May, A.: Solving linear equations modulo divisors: on factoring given any bits. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 406\u2013424. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-89255-7_25"},{"issue":"2","key":"17_CR13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1515\/JMC.2008.006","volume":"2","author":"MJ Hinek","year":"2008","unstructured":"Hinek, M.J.: On the security of multi-prime RSA. J. Math. Cryptology 2(2), 117\u2013147 (2008)","journal-title":"J. Math. Cryptology"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-36492-7_25","volume-title":"Selected Areas in Cryptography","author":"MJ Hinek","year":"2003","unstructured":"Hinek, M.J., Low, M.K., Teske, E.: On some attacks on multi-prime RSA. In: Nyberg, K., Heys, H. (eds.) SAC 2002. LNCS, vol. 2595, pp. 385\u2013404. Springer, Heidelberg (2003). doi:\n10.1007\/3-540-36492-7_25"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.) Cryptography and Coding 1997. LNCS, vol. 1355, pp. 131\u2013142. Springer, Heidelberg (1997). doi:\n10.1007\/BFb0024458"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-14623-7_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"E Kiltz","year":"2010","unstructured":"Kiltz, E., O\u2019Neill, A., Smith, A.: Instantiability of RSA-OAEP under chosen-plaintext attack. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 295\u2013313. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-14623-7_16"},{"issue":"4","key":"17_CR17","doi-asserted-by":"crossref","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":"17_CR18","unstructured":"Lenstra Jr., H.W.: Factoring integers with elliptic curves. Ann. Math. 126(3), 649\u2013673 (1987)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-662-48797-6_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"Y Lu","year":"2015","unstructured":"Lu, Y., Zhang, R., Peng, L., Lin, D.: Solving linear equations modulo unknown divisors: revisited. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 189\u2013213. Springer, Heidelberg (2015). doi:\n10.1007\/978-3-662-48797-6_9"},{"issue":"2","key":"17_CR20","doi-asserted-by":"crossref","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":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-39059-3_9","volume-title":"Information Security and Privacy","author":"A Takayasu","year":"2013","unstructured":"Takayasu, A., Kunihiro, N.: Better lattice constructions for solving multivariate linear equations modulo unknown divisors. In: Boyd, C., Simpson, L. (eds.) ACISP 2013. LNCS, vol. 7959, pp. 118\u2013135. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-39059-3_9"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-15943-0_1","volume-title":"Information Security and Cryptology - ICISC 2014","author":"A Takayasu","year":"2015","unstructured":"Takayasu, A., Kunihiro, N.: General bounds for small inverse problems and its applications to multi-prime RSA. In: Lee, J., Kim, J. (eds.) ICISC 2014. LNCS, vol. 8949, pp. 3\u201317. Springer, Cham (2015). doi:\n10.1007\/978-3-319-15943-0_1"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-31448-3_1","volume-title":"Information Security and Privacy","author":"K Tosu","year":"2012","unstructured":"Tosu, K., Kunihiro, N.: Optimal bounds for multi-prime \n            $$\\varPhi $$\n          -hiding assumption. In: Susilo, W., Mu, Y., Seberry, J. (eds.) ACISP 2012. LNCS, vol. 7372, pp. 1\u201314. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-31448-3_1"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-319-45871-7_26","volume-title":"Information Security","author":"J Xu","year":"2016","unstructured":"Xu, J., Hu, L., Sarkar, S., Zhang, X., Huang, Z., Peng, L.: Cryptanalysis of multi-prime \n            $$\\varPhi $$\n          -hiding assumption. In: Bishop, M., Nascimento, A.C.A. (eds.) ISC 2016. LNCS, vol. 9866, pp. 440\u2013453. Springer, Cham (2016). doi:\n10.1007\/978-3-319-45871-7_26"},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-39059-3_4","volume-title":"Information Security and Privacy","author":"H Zhang","year":"2013","unstructured":"Zhang, H., Takagi, T.: Attacks on multi-prime RSA with small prime difference. In: Boyd, C., Simpson, L. (eds.) ACISP 2013. LNCS, vol. 7959, pp. 41\u201356. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-39059-3_4"},{"issue":"7","key":"17_CR26","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1587\/transfun.E97.A.1533","volume":"97","author":"H Zhang","year":"2014","unstructured":"Zhang, H., Takagi, T.: Improved attacks on multi-prime RSA with small prime difference. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97(7), 1533\u20131541 (2014)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60055-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T22:20:58Z","timestamp":1496096458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60055-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319600543","9783319600550"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60055-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}