{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:51:15Z","timestamp":1779900675080,"version":"3.53.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319075358","type":"print"},{"value":"9783319075365","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07536-5_10","type":"book-chapter","created":{"date-parts":[[2014,6,4]],"date-time":"2014-06-04T19:14:16Z","timestamp":1401909256000},"page":"151-162","source":"Crossref","is-referenced-by-count":10,"title":["New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents"],"prefix":"10.1007","author":[{"given":"Yao","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11745853_1","volume-title":"Public Key Cryptography - PKC 2006","author":"D. Bleichenbacher","year":"2006","unstructured":"Bleichenbacher, D., May, A.: New attacks on RSA with small secret CRT-exponents. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 1\u201313. Springer, Heidelberg (2006)"},{"issue":"4","key":"10_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 d less than \n                    \n                      \n                    \n                    $\\textit{{N}}^{0.292}$\n                  . IEEE Transactions on Information Theory\u00a046(4), 1339\u20131349 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"10_CR3","unstructured":"Boneh, D., Durfee, G., Frankel, Y.: Exposing an RSA private key given a small fraction of its bits. In: Full Version of the work from Asiacrypt, vol.\u00a098 (1998)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Durfee, G., Howgrave-Graham, N.: Factoring n\u2009=\u2009p\n                  \n                    r\n                  \n                  q for large r. In: Advances in Cryptology\u2013CRYPTO 1999, p. 787. Springer (1999)","DOI":"10.1007\/3-540-48405-1_21"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/11426639_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M. Ernst","year":"2005","unstructured":"Ernst, M., Jochemsz, E., May, A., de Weger, B.: Partial key exposure attacks on RSA up to full size exponents. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 371\u2013386. Springer, Heidelberg (2005)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11506157_24","volume-title":"Information Security and Privacy","author":"S.D. Galbraith","year":"2005","unstructured":"Galbraith, S.D., Heneghan, C., McKee, J.F.: Tunable balancing of RSA. In: Boyd, C., Gonz\u00e1lez Nieto, J.M. (eds.) ACISP 2005. LNCS, vol.\u00a03574, pp. 280\u2013292. Springer, Heidelberg (2005)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-21969-6_6","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2011","author":"M. Herrmann","year":"2011","unstructured":"Herrmann, M.: Improved cryptanalysis of the multi-prime \u03c6 - hiding assumption. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol.\u00a06737, pp. 92\u201399. Springer, Heidelberg (2011)"},{"key":"10_CR8","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.\u00a05350, pp. 406\u2013424. Springer, Heidelberg (2008)"},{"key":"10_CR9","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.\u00a06056, pp. 53\u201369. Springer, Heidelberg (2010)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"N. Howgrave-Graham","year":"1997","unstructured":"Howgrave-Graham, N.: Finding small roots of univariate modular equations revisited. In: M\u00f6hring, R.H. (ed.) WG 1997. LNCS, vol.\u00a01335, pp. 131\u2013142. Springer, Heidelberg (1997)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-45146-4_2","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Bl\u00f6mer","year":"2003","unstructured":"Bl\u00f6mer, J., May, A.: New partial key exposure attacks on RSA. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 27\u201343. Springer, Heidelberg (2003)"},{"key":"10_CR12","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                    $\\textit{{N}}^{0.073}$\n                  . In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 395\u2013411. Springer, Heidelberg (2007)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-29101-2_25","volume-title":"Information Security Practice and Experience","author":"M. Joye","year":"2012","unstructured":"Joye, M., Lepoint, T.: Partial key exposure on RSA with private exponents larger than n. In: Ryan, M.D., Smyth, B., Wang, G. (eds.) ISPEC 2012. LNCS, vol.\u00a07232, pp. 369\u2013380. Springer, Heidelberg (2012)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-28496-0_16","volume-title":"Selected Areas in Cryptography","author":"N. Kunihiro","year":"2012","unstructured":"Kunihiro, N., Shinohara, N., Izu, T.: A unified framework for small secret exponent attack on RSA. In: Miri, A., Vaudenay, S. (eds.) SAC 2011. LNCS, vol.\u00a07118, pp. 260\u2013277. Springer, Heidelberg (2012)"},{"issue":"4","key":"10_CR15","doi-asserted-by":"publisher","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. Mathematische Annalen\u00a0261(4), 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-45708-9_16","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"A. May","year":"2002","unstructured":"May, A.: Cryptanalysis of unbalanced RSA with small CRT-exponent. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 242\u2013256. Springer, Heidelberg (2002)"},{"key":"10_CR17","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                    $\\textit{{N}}= p^{r}q$\n                  . In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 218\u2013230. Springer, Heidelberg (2004)"},{"issue":"21","key":"10_CR18","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"J.-J. Quisquater","year":"1982","unstructured":"Quisquater, J.-J.: Chantal Couvreur. Fast decipherment algorithm for RSA public-key cryptosystem. Electronics Letters\u00a018(21), 905\u2013907 (1982)","journal-title":"Electronics Letters"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-642-01957-9_29","volume-title":"Applied Cryptography and Network Security","author":"S. Sarkar","year":"2009","unstructured":"Sarkar, S., Maitra, S.: Partial key exposure attack on CRT-RSA. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol.\u00a05536, pp. 473\u2013484. Springer, Heidelberg (2009)"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/BFb0055738","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"T. Takagi","year":"1998","unstructured":"Takagi, T.: Fast RSA-type cryptosystem modulo p\n                  \n                    k\n                  \n                  q. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 318\u2013326. Springer, Heidelberg (1998)"},{"key":"10_CR21","doi-asserted-by":"crossref","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.\u00a07959, pp. 118\u2013135. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-39059-3_9"},{"key":"10_CR22","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 \u03c6-hiding assumption. In: Susilo, W., Mu, Y., Seberry, J. (eds.) ACISP 2012. LNCS, vol.\u00a07372, pp. 1\u201314. Springer, Heidelberg (2012)"},{"key":"#cr-split#-10_CR23.1","doi-asserted-by":"crossref","unstructured":"Cannon, J., Bosma, W., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput.\u00a024(3-4), 235-265 (1997)","DOI":"10.1006\/jsco.1996.0125"},{"key":"#cr-split#-10_CR23.2","unstructured":"Computational algebra and number theory, London (1993)"},{"issue":"3","key":"10_CR24","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a036(3), 553\u2013558 (1990)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07536-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T20:15:25Z","timestamp":1558901725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07536-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075358","9783319075365"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07536-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}