{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:47Z","timestamp":1759638887657,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319266169"},{"type":"electronic","value":"9783319266176"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26617-6_6","type":"book-chapter","created":{"date-parts":[[2015,11,27]],"date-time":"2015-11-27T00:40:44Z","timestamp":1448584844000},"page":"105-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Cryptanalysis of Variants of RSA with Multiple Small Secret Exponents"],"prefix":"10.1007","author":[{"given":"Liqiang","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santanu","family":"Sarkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhangjie","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,28]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-39059-3_7","volume-title":"Information Security and Privacy","author":"Y Aono","year":"2013","unstructured":"Aono, Y.: Minkowski sum based lattice construction for multivariate simultaneous Coppersmith\u2019s technique and applications to RSA. In: Boyd, C., Simpson, L. (eds.) ACISP. LNCS, vol. 7959, pp. 88\u2013103. Springer, Heidelberg (2013)"},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","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                      \n                        \n                      \n                      $$d$$\n                      \n                        \n                          d\n                        \n                      \n                     less than \n                      \n                        \n                      \n                      $$N^{0.292}$$\n                      \n                        \n                          \n                            N\n                            \n                              0.292\n                            \n                          \n                        \n                      \n                    . IEEE IEEE Trans. Inf. Theory 46(4), 1339\u20131349 (2000)","journal-title":"IEEE IEEE Trans. Inf. Theory"},{"issue":"3\/4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J.J., Playoust, C.: The MAGMA algebra system I: the user language. J. Symbolic Comput. 24(3\/4), 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"key":"6_CR4","unstructured":"Cohn, H., Heninger, N.: Approximate common divisors via lattices. CoRR \n                      abs\/1108.2714\n                      \n                     (2011)"},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","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":"6_CR6","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)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Cryptography and Coding","author":"N Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham, N.: Finding small roots of univariate modular equations revisited. In: Darnell, M.J. (ed.) Cryptography and Coding 1997. LNCS, vol. 1355. Springer, Heidelberg (1997)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-46701-7_14","volume-title":"Secure Networking - CQRE (Secure) \u201999","author":"N Howgrave-Graham","year":"1999","unstructured":"Howgrave-Graham, N., Seifert, J.-P.: Extending Wiener\u2019s attack in the presence of many decrypting exponents. In: Baumgart, R. (ed.) CQRE 1999. LNCS, vol. 1740, pp. 153\u2013166. Springer, Heidelberg (1999)"},{"key":"6_CR9","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)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-74143-5_22","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"E Jochemsz","year":"2007","unstructured":"Jochemsz, E., May, A.: A polynomial time attack on RSA with private CRT-exponents smaller than \n                      \n                        \n                      \n                      $$N^{0.073}$$\n                      \n                        \n                          \n                            N\n                            \n                              0.073\n                            \n                          \n                        \n                      \n                    . In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 395\u2013411. Springer, Heidelberg (2007)"},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","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. Mathematische Annalen 261(4), 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"6_CR12","unstructured":"Lu, Y., Zhang, R., Peng, L., Lin, D.: Solving linear equations modulo unknown divisors: revisited. In: ASIACRYPT 2015 (2015) (to appear). \n                      https:\/\/eprint.iacr.org\/2014\/343"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-24632-9_16","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"A May","year":"2004","unstructured":"May, A.: Secret exponent attacks on RSA-type schemes with moduli \n                      \n                        \n                      \n                      $$N={p}^{r} {q}$$\n                      \n                        \n                          \n                            N\n                            =\n                            \n                              \n                                p\n                              \n                              r\n                            \n                            q\n                          \n                        \n                      \n                    . In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 218\u2013230. Springer, Heidelberg (2004)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11426639_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"PQ Ngu\u00ean","year":"2005","unstructured":"Ngu\u00ean, P.Q., Stehl\u00e9, D.: Floating-point LLL revisited. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 215\u2013233. Springer, Heidelberg (2005)"},{"key":"6_CR15","series-title":"Information Security and Cryptography","volume-title":"The LLL Algorithm - Survey and Applications","year":"2010","unstructured":"Nguyen, P.Q., Vall\u00e9e, B. (eds.): The LLL Algorithm - Survey and Applications. Information Security and Cryptography. Springer, Heidelberg (2010)"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10623-014-9928-6","volume":"73","author":"S Sarkar","year":"2014","unstructured":"Sarkar, S.: Small secret exponent attack on RSA variant with modulus \n                      \n                        \n                      \n                      $$N=p^{r} q$$\n                      \n                        \n                          \n                            N\n                            =\n                            \n                              p\n                              r\n                            \n                            q\n                          \n                        \n                      \n                    . Des. Codes Crypt. 73(2), 383\u2013392 (2014)","journal-title":"Des. Codes Crypt."},{"issue":"8\u20139","key":"6_CR18","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.ipl.2010.02.016","volume":"110","author":"S Sarkar","year":"2010","unstructured":"Sarkar, S., Maitra, S.: Cryptanalysis of RSA with more than one decryption exponent. Inf. Process. Lett. 110(8\u20139), 336\u2013340 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1080\/0161-118391857900","volume":"7","author":"GJ Simmons","year":"1983","unstructured":"Simmons, G.J.: A weak privacy protocol using the RSA cryptalgorithm. Cryptologia 7(2), 180\u2013182 (1983)","journal-title":"Cryptologia"},{"key":"6_CR20","first-page":"53","volume":"2005","author":"H Sun","year":"2005","unstructured":"Sun, H., Wu, M.: An approach towards rebalanced RSA-CRT with short public exponent. IACR Cryptology ePrint Archive 2005, 53 (2005)","journal-title":"IACR Cryptology ePrint Archive"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Takagi, T.: Fast RSA-type cryptosystem modulo \n                      \n                        \n                      \n                      $$p^{k}q$$\n                      \n                        \n                          \n                            \n                              p\n                              k\n                            \n                            q\n                          \n                        \n                      \n                    . In: CRYPTO 1998. vol. 1462, pp. 318\u2013326 (1998)","DOI":"10.1007\/BFb0055738"},{"key":"6_CR22","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. LNCS, vol. 7959, pp. 118\u2013135. Springer, Heidelberg (2013)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/978-3-319-08344-5_12","volume-title":"Information Security and Privacy","author":"A Takayasu","year":"2014","unstructured":"Takayasu, A., Kunihiro, N.: Cryptanalysis of RSA with multiple small secret exponents. In: Susilo, W., Mu, Y. (eds.) ACISP 2014. LNCS, vol. 8544, pp. 176\u2013191. Springer, Heidelberg (2014)"},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","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. Theory 36(3), 553\u2013558 (1990)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology -- INDOCRYPT 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26617-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T14:24:00Z","timestamp":1559312640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26617-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266169","9783319266176"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26617-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}