{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:39:41Z","timestamp":1775839181857,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642390586","type":"print"},{"value":"9783642390593","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39059-3_5","type":"book-chapter","created":{"date-parts":[[2013,6,13]],"date-time":"2013-06-13T21:33:17Z","timestamp":1371159197000},"page":"57-71","source":"Crossref","is-referenced-by-count":9,"title":["Factoring Multi-power RSA Modulus N\u2009=\u2009p r q with Partial Known Bits"],"prefix":"10.1007","author":[{"given":"Yao","family":"Lu","sequence":"first","affiliation":[]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"5_CR1","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                  0.292. IEEE Transactions on Information Theory\u00a046(4), 1339\u20131349 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-48405-1_21","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G., Howgrave-Graham, N.: Factoring n\u2009=\u2009p\n                  \n                    r\n                  \n                  q for large r. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 326\u2013337. Springer, Heidelberg (1999)"},{"issue":"1","key":"5_CR3","first-page":"1","volume":"5","author":"D. Boneh","year":"2002","unstructured":"Boneh, D., Shacham, H.: Fast variants of RSA. CryptoBytes\u00a05(1), 1\u20139 (2002)","journal-title":"CryptoBytes"},{"issue":"4","key":"5_CR4","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. Journal of Cryptology\u00a010(4), 233\u2013260 (1997)","journal-title":"Journal of Cryptology"},{"key":"5_CR5","unstructured":"The EPOC and the ESIGN\u00a0Algorithms. IEEE P1363: Protocols from Other Families of Public-Key Algorithms (1998), \n                    \n                      http:\/\/grouper.ieee.org\/groups\/1363\/StudyGroup\/NewFam.html"},{"key":"5_CR6","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)"},{"issue":"5","key":"5_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/1506409.1506429","volume":"52","author":"J.A. Halderman","year":"2009","unstructured":"Halderman, J.A., Schoen, S.D., Heninger, N., Clarkson, W., Paul, W., Calandrino, J.A., Feldman, A.J., Appelbaum, J., Felten, E.W.: Lest we remember: cold-boot attacks on encryption keys. Communications of the ACM\u00a052(5), 91\u201398 (2009)","journal-title":"Communications of the ACM"},{"key":"5_CR8","unstructured":"Herrmann, D.I.M.: Lattice-based Cryptanalysis using Unravelled Linearization. PhD thesis (2011)"},{"key":"5_CR9","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":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BFb0024458","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. (ed.) Cryptography and Coding 1997. LNCS, vol.\u00a01355, pp. 131\u2013142. Springer, Heidelberg (1997)"},{"key":"5_CR11","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.\u00a04284, pp. 267\u2013282. Springer, Heidelberg (2006)"},{"key":"5_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                  0.073. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 395\u2013411. Springer, Heidelberg (2007)"},{"issue":"4","key":"5_CR13","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":"5_CR14","unstructured":"May, A.: New RSA vulnerabilities using lattice reduction methods. PhD thesis (2003)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"May, A.: Using lll-reduction for solving RSA and factorization problems. In: The LLL algorithm, pp. 315\u2013348 (2010)","DOI":"10.1007\/978-3-642-02295-1_10"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 308\u2013318. Springer, Heidelberg (1998)"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-39805-8_3","volume-title":"Advances in Cryptology - EUROCRYPT \u201985","author":"R.L. Rivest","year":"1986","unstructured":"Rivest, R.L., Shamir, A.: Efficient factoring based on partial information. In: Pichler, F. (ed.) EUROCRYPT 1985. LNCS, vol.\u00a0219, pp. 31\u201334. Springer, Heidelberg (1986)"},{"issue":"8","key":"5_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. Information Processing Letters\u00a0110(8), 336\u2013340 (2010)","journal-title":"Information Processing Letters"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-17401-8_2","volume-title":"Progress in Cryptology - INDOCRYPT 2010","author":"S. Sarkar","year":"2010","unstructured":"Sarkar, S., Sen Gupta, S., Maitra, S.: Partial key exposure attack on RSA \u2013 improvements for limited lattice dimensions. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol.\u00a06498, pp. 2\u201316. Springer, Heidelberg (2010)"},{"key":"5_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)"}],"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-642-39059-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T23:59:46Z","timestamp":1557791986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39059-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390586","9783642390593"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39059-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}