{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T05:45:35Z","timestamp":1745646335598},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319531762"},{"type":"electronic","value":"9783319531779"}],"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-53177-9_15","type":"book-chapter","created":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T23:35:07Z","timestamp":1486510507000},"page":"287-303","source":"Crossref","is-referenced-by-count":2,"title":["Improved Results on Cryptanalysis of Prime Power RSA"],"prefix":"10.1007","author":[{"given":"Liqiang","family":"Peng","sequence":"first","affiliation":[]},{"given":"Lei","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Yao","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,9]]},"reference":[{"issue":"4","key":"15_CR1","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 d less than N 0.292. IEEE Trans. Inf. Theor. 46(4), 1339\u20131349 (2000)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"3","key":"15_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The magma algebra system I: the user language. J. Symbolic Comput. 24(3), 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"issue":"4","key":"15_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. 10(4), 233\u2013260 (1997)","journal-title":"J. Cryptol."},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-13013-7_5","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"J-C Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C., Marinier, R., Renault, G.: Implicit factoring with shared most significant and middle bits. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 70\u201387. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13013-7_5"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-13013-7_4","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"M Herrmann","year":"2010","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. LNCS, vol. 6056, pp. 53\u201369. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13013-7_4"},{"key":"15_CR6","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: 10.1007\/BFb0024458"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/11935230_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"E Jochemsz","year":"2006","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. LNCS, vol. 4284, pp. 267\u2013282. Springer, Heidelberg (2006). doi: 10.1007\/11935230_18"},{"issue":"4","key":"15_CR8","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":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-319-31301-6_26","volume-title":"Selected Areas in Cryptography - SAC 2015","author":"Y Lu","year":"2016","unstructured":"Lu, Y., Peng, L., Zhang, R., Hu, L., Lin, D.: Towards optimal bounds for implicit factorization problem. In: Dunkelman, O., Keliher, L. (eds.) SAC 2015. LNCS, vol. 9566, pp. 462\u2013476. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-31301-6_26"},{"issue":"3","key":"15_CR10","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. Comm. 7(3), 243\u2013251 (2013)","journal-title":"Adv. Math. Comm."},{"key":"15_CR11","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: 10.1007\/978-3-662-48797-6_9"},{"unstructured":"May, A.: New RSA vulnerabilities using lattice reduction methods. Ph.D. thesis. University of Paderborn (2003)","key":"15_CR12"},{"doi-asserted-by":"crossref","unstructured":"May, A.: Secret exponent attacks on RSA-type schemes with moduli $$N=p^{r}q$$ . In: Bao, F., et al. (eds.) International Workshop on Public KeyCryptography, PKC 2004, LNCS, vol. 2947, pp. 218\u2013230. Springer, Heidelberg (2004)","key":"15_CR13","DOI":"10.1007\/978-3-540-24632-9_16"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00468-1_1","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"A May","year":"2009","unstructured":"May, A., Ritzenhofen, M.: Implicit factoring: on polynomial time factoring given only an implicit hint. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 1\u201314. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-00468-1_1"},{"key":"15_CR15","series-title":"Information Security and Cryptography","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02295-1","volume-title":"The lll Algorithm","author":"PQ Nguyen","year":"2010","unstructured":"Nguyen, P.Q., Vall\u00e9e, B.: The lll Algorithm. Information Security and Cryptography. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Nitaj, A., Rachidi, T.: New attacks on RSA with moduli $$N=p^{r}q$$ . In: International Conference on Codes, Cryptology, and Information Security, pp. 352\u2013360. Springer, Heidelberg (2015)","key":"15_CR16","DOI":"10.1007\/978-3-319-18681-8_28"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-26617-6_6","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2015","author":"L Peng","year":"2015","unstructured":"Peng, L., Hu, L., Lu, Y., Sarkar, S., Xu, J., Huang, Z.: Cryptanalysis of variants of RSA with multiple small secret exponents. In: Biryukov, A., Goyal, V. (eds.) INDOCRYPT 2015. LNCS, vol. 9462, pp. 105\u2013123. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-26617-6_6"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-319-06734-6_11","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2014","author":"L Peng","year":"2014","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. LNCS, vol. 8469, pp. 165\u2013177. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-06734-6_11"},{"issue":"1","key":"15_CR19","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/357980.358017","volume":"26","author":"RL Rivest","year":"1983","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 26(1), 96\u201399 (1983)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Sarkar, S.: Small secret exponent attack on RSA variant with modulus $$N=p^{r}q$$ . Des. Codes Crypt. 73(2), 383\u2013392 (2014)","key":"15_CR20","DOI":"10.1007\/s10623-014-9928-6"},{"key":"15_CR21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.dam.2015.10.003","volume":"203","author":"S Sarkar","year":"2016","unstructured":"Sarkar, S.: Revisiting prime power RSA. Discrete Appl. Math. 203, 127\u2013133 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"15_CR22","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. Inf. Theor. 57(6), 4002\u20134013 (2011)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/BFb0055738","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"T Takagi","year":"1998","unstructured":"Takagi, T.: Fast RSA-type cryptosystem modulo $$p^{k}q$$ . In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 318\u2013326. Springer, Heidelberg (1998). doi: 10.1007\/BFb0055738"},{"issue":"6","key":"15_CR24","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1587\/transfun.E97.A.1259","volume":"97","author":"A Takayasu","year":"2014","unstructured":"Takayasu, A., Kunihiro, N.: Better lattice constructions for solving multivariate linear equations modulo unknown divisors. IEICE Trans. Fund. Electron. Commun. Comput. Sci. 97(6), 1259\u20131272 (2014)","journal-title":"IEICE Trans. Fund. Electron. Commun. Comput. Sci."},{"issue":"3","key":"15_CR25","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"MJ Wiener","year":"1990","unstructured":"Wiener, M.J.: Cryptanalysis of short RSA secret exponents. IEEE Trans. Inf. Theor. 36(3), 553\u2013558 (1990)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"11","key":"15_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11432-015-5409-4","volume":"58","author":"M Zheng","year":"2015","unstructured":"Zheng, M., Hu, H.: Cryptanalysis of prime power RSA with two private exponents. Sci. China Inf. Sci. 58(11), 1\u20138 (2015)","journal-title":"Sci. China Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53177-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T07:30:16Z","timestamp":1568791816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53177-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319531762","9783319531779"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53177-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}