{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:53:59Z","timestamp":1773932039223,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540892540","type":"print"},{"value":"9783540892557","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89255-7_25","type":"book-chapter","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T02:27:00Z","timestamp":1228098420000},"page":"406-424","source":"Crossref","is-referenced-by-count":58,"title":["Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits"],"prefix":"10.1007","author":[{"given":"Mathias","family":"Herrmann","sequence":"first","affiliation":[]},{"given":"Alexander","family":"May","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (Extended Abstract). In: STOC, pp. 10\u201319 (1998)","DOI":"10.1145\/276698.276705"},{"issue":"4","key":"25_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 0.292. IEEE Transactions on Information Theory\u00a046(4), 1339 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Bleichenbacher, D., May, A.: New Attacks on RSA with Small Secret CRT-Exponents. In: Public Key Cryptography, pp. 1\u201313 (2006)","DOI":"10.1007\/11745853_1"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"M.J. Coster","year":"1992","unstructured":"Coster, M.J., Joux, A., LaMacchia, B.A., Odlyzko, A.M., Schnorr, C.-P., Stern, J.: Improved Low-Density Subset Sum Algorithms. Computational Complexity\u00a02, 111\u2013128 (1992)","journal-title":"Computational Complexity"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s00145-006-0433-6","volume":"20","author":"J.-S. Coron","year":"2007","unstructured":"Coron, J.-S., May, A.: Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring. J. Cryptology\u00a020(1), 39\u201350 (2007)","journal-title":"J. Cryptology"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-68339-9_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 178\u2013189. Springer, Heidelberg (1996)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"issue":"4","key":"25_CR8","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\u00a010(4), 233\u2013260 (1997)","journal-title":"J. Cryptology"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-74143-5_21","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"J.-S. Coron","year":"2007","unstructured":"Coron, J.-S.: Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 379\u2013394. Springer, Heidelberg (2007)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-69053-0_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"M. Girault","year":"1997","unstructured":"Girault, M., Misarsky, J.-F.: Selective Forgery of RSA Signatures Using Redundancy. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 495\u2013507. Springer, Heidelberg (1997)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/0-387-34799-2_9","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"M. Girault","year":"1990","unstructured":"Girault, M., Toffin, P., Vall\u00e9e, B.: Computation of approximate L-th roots modulo n and application to cryptography. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 100\u2013117. Springer, Heidelberg (1990)"},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1137\/0217019","volume":"17","author":"J. Hastad","year":"1988","unstructured":"Hastad, J.: Solving Simultaneous Modular Equations of Low Degree. SIAM Journal on Computing\u00a017(2), 336\u2013341 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Howgrave-Graham, N.: Finding Small Roots of Univariate Modular Equations Revisited. In: Proceedings of the 6th IMA International Conference on Cryptography and Coding, pp. 131\u2013142 (1997)","DOI":"10.1007\/BFb0024458"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-44670-2_6","volume-title":"Cryptography and Lattices","author":"N. Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N.: Approximate Integer Common Divisors. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 51\u201366. Springer, Heidelberg (2001)"},{"issue":"4","key":"25_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"},{"issue":"3\/4","key":"25_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01206320","volume":"5","author":"U.M. Maurer","year":"1995","unstructured":"Maurer, U.M.: On the Oracle Complexity of Factoring Integers. Computational Complexity\u00a05(3\/4), 237\u2013247 (1995)","journal-title":"Computational Complexity"},{"key":"25_CR17","unstructured":"May, A.: New RSA Vulnerabilities Using Lattice Reduction Methods. PhD thesis, University of Paderborn (2003)"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-28628-8_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"A. May","year":"2004","unstructured":"May, A.: Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 213\u2013219. Springer, Heidelberg (2004)"},{"key":"25_CR19","unstructured":"Minkowski, H.: Geometrie der Zahlen. Teubner (1910)"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-24676-3_33","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"P.Q. Nguyen","year":"2004","unstructured":"Nguyen, P.Q.: Can We Trust Cryptographic Software? Cryptographic Flaws in GNU Privacy Guard v1.2.3. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 555\u2013570. Springer, Heidelberg (2004)"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"P.Q. Nguyen","year":"2001","unstructured":"Nguyen, P.Q., Stern, J.: The Two Faces of Lattices in Cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 146\u2013180. Springer, Heidelberg (2001)"},{"key":"25_CR22","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":"P.Q. Nguyen","year":"2005","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Floating-Point LLL Revisited. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 215\u2013233. Springer, Heidelberg (2005)"},{"key":"25_CR23","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)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89255-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T17:50:09Z","timestamp":1557942609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89255-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540892540","9783540892557"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89255-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}