{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:33:34Z","timestamp":1725557614093},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144226"},{"type":"electronic","value":"9783642144233"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14423-3_5","type":"book-chapter","created":{"date-parts":[[2010,6,18]],"date-time":"2010-06-18T08:13:34Z","timestamp":1276848814000},"page":"65-72","source":"Crossref","is-referenced-by-count":0,"title":["Factoring Unbalanced Moduli with Known Bits"],"prefix":"10.1007","author":[{"given":"Eric","family":"Brier","sequence":"first","affiliation":[]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[]},{"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Bauer, A.: Toward a rigorous generalization of Coppersmith\u2019s methods for finding small roots of multivariate polynomial equations, Ph.D. thesis, Universit\u00e9 de Versailles Saint-Quentin (September 2008)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-540-72540-4_21","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"A. Bauer","year":"2007","unstructured":"Bauer, A., Joux, A.: Toward a rigorous variation of Coppersmith\u2019s algorithm on three variables. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 361\u2013378. Springer, Heidelberg (2007)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-48405-1_21","volume-title":"Advances in Cryptology - CRYPTO 1999","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)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1109\/18.850673","volume":"46","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than n\n                  0.292. IEEE Transactions on Information Theory\u00a046, 1339\u20131349 (1999)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR5","unstructured":"Coppersmith, D.: Factoring with a hint, IBM Research Report RC 19905 (1995)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a univariate modular equation. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 155\u2013165. Springer, Heidelberg (1996)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/3-540-36563-X_28","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"C. Cr\u00e9peau","year":"2003","unstructured":"Cr\u00e9peau, C., Slakmon, A.: Simple backdoors for rsa key generation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 403\u2013416. Springer, Heidelberg (2003)"},{"key":"5_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":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/3-540-47555-9_35","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"U. Maurer","year":"1993","unstructured":"Maurer, U.: Factoring with an Oracle. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 429\u2013436. Springer, Heidelberg (1993)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"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.\u00a05443, pp. 1\u201314. Springer, Heidelberg (2009)"},{"key":"5_CR11","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. Rivest","year":"1986","unstructured":"Rivest, R., Shamir, A.: Efficient factoring based on partial information. In: Pichler, F. (ed.) EUROCRYPT 1985. LNCS, vol.\u00a0219, pp. 31\u201334. Springer, Heidelberg (1986)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/11958239_8","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"B. Santoso","year":"2006","unstructured":"Santoso, B., Kunihiro, N., Kanayama, N., Ohta, K.: Factorization of square-free integers with high bits known. In: Nguy\u00ean, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 115\u2013130. Springer, Heidelberg (2006)"},{"issue":"3","key":"5_CR13","first-page":"1","volume":"1","author":"A. Shamir","year":"1990","unstructured":"Shamir, A.: RSA for paranoids. RSA Laboratories CryptoBytes\u00a01(3), 1\u20134 (1990)","journal-title":"RSA Laboratories CryptoBytes"}],"container-title":["Lecture Notes in Computer Science","Information, Security and Cryptology \u2013 ICISC 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14423-3_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:26:57Z","timestamp":1619771217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14423-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144226","9783642144233"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14423-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}