{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:34:18Z","timestamp":1765355658441,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296932"},{"type":"electronic","value":"9783642296949"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-29694-9_7","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T16:49:27Z","timestamp":1343321367000},"page":"139-168","source":"Crossref","is-referenced-by-count":9,"title":["Diophantine and Lattice Cryptanalysis of the RSA Cryptosystem"],"prefix":"10.1007","author":[{"given":"Abderrahmane","family":"Nitaj","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions. In: STOC 1998, pp. 10\u201319 (1998)","DOI":"10.1145\/276698.276705"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24632-9_1","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"J. Bl\u00f6mer","year":"2004","unstructured":"Bl\u00f6mer, J., May, A.: A Generalized Wiener Attack on RSA. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 1\u201313. Springer, Heidelberg (2004)"},{"key":"7_CR3","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)"},{"issue":"2","key":"7_CR4","first-page":"203","volume":"46","author":"D. Boneh","year":"1999","unstructured":"Boneh, D.: Twenty years of attacks on the RSA cyptosystem. Notices of the AMS\u00a046(2), 203\u2013213 (1999)","journal-title":"Notices of the AMS"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with Private Key d Less than N 0.292. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 1\u201311. Springer, Heidelberg (1999)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"C. Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.A.: Computationally Private Information Retrieval with Polylogarithmic Communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 402\u2013414. Springer, Heidelberg (1999)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, vol.\u00a0138. Springer (1993)","DOI":"10.1007\/978-3-662-02945-9"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. Journal of Cryptology\u00a010(4), 233\u2013260","DOI":"10.1007\/s001459900030"},{"issue":"5","key":"7_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022(5), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"7_CR10","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers. Oxford University Press, London"},{"key":"7_CR11","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":"7_CR12","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":"7_CR13","series-title":"Cryptography and Network Security Series","doi-asserted-by":"publisher","DOI":"10.1201\/9781420075199","volume-title":"Cryptanalysis of RSA and Its Variants","author":"M. Hinek","year":"2009","unstructured":"Hinek, M.: Cryptanalysis of RSA and Its Variants. Cryptography and Network Security Series. Chapman, Hall\/CRC, Boca Raton (2009)"},{"key":"7_CR14","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.J. (ed.) Cryptography and Coding 1997. LNCS, vol.\u00a01355, pp. 131\u2013142. Springer, Heidelberg (1997)"},{"key":"7_CR15","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)"},{"key":"7_CR16","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":"7_CR17","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen, vol.\u00a0261, pp. 513\u2013534.","DOI":"10.1007\/BF01457454"},{"key":"7_CR18","unstructured":"May, A.: New RSA Vulnerabilities Using Lattice Reduction Methods. Ph.D. thesis, Paderborn (2003), http:\/\/www.cits.rub.de\/imperia\/md\/content\/may\/paper\/bp.ps"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Nassr, D.I., Bahig, H.M., Bhery, A., Daoud, S.S.: A new RSA vulnerability using continued fractions. In: Proceedings of AICCSA, pp. 694\u2013701 (2008)","DOI":"10.1109\/AICCSA.2008.4493604"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-02384-2_7","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"A. Nitaj","year":"2009","unstructured":"Nitaj, A.: Cryptanalysis of RSA Using the Ratio of the Primes. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol.\u00a05580, pp. 98\u2013115. Springer, Heidelberg (2009)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A Method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126","DOI":"10.1145\/359340.359342"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"de Weger, B.: Cryptanalysis of RSA with small prime difference. Applicable Algebra in Engineering, Communication and Computing\u00a013(1), 17\u201328","DOI":"10.1007\/s002000100088"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Wiener, M.: Cryptanalysis of short RSA secret exponents. IEEE Transactions on Information Theory\u00a036, 553\u2013558","DOI":"10.1109\/18.54902"},{"key":"7_CR24","unstructured":"Yan, S.Y.: Cryptanalytic Attacks on RSA. Springer (2008)"}],"container-title":["Studies in Computational Intelligence","Artificial Intelligence, Evolutionary Computing and Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29694-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T14:29:06Z","timestamp":1743863346000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29694-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642296932","9783642296949"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29694-9_7","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}