{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T02:52:52Z","timestamp":1775271172994,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319067339","type":"print"},{"value":"9783319067346","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06734-6_12","type":"book-chapter","created":{"date-parts":[[2014,5,21]],"date-time":"2014-05-21T00:22:02Z","timestamp":1400631722000},"page":"178-198","source":"Crossref","is-referenced-by-count":21,"title":["New Attacks on the RSA Cryptosystem"],"prefix":"10.1007","author":[{"given":"Abderrahmane","family":"Nitaj","sequence":"first","affiliation":[]},{"given":"Muhammad Rezal Kamel","family":"Ariffin","sequence":"additional","affiliation":[]},{"given":"Dieaa I.","family":"Nassr","sequence":"additional","affiliation":[]},{"given":"Hatem M.","family":"Bahig","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"ANSI Standard X9.31-1998, Digital Signatures Using Reversible Public Key Cryptography for the Financial Services Industry (rDSA)"},{"key":"12_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":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48910-X_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\n                  0.292. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 1\u201311. Springer, Heidelberg (1999)"},{"issue":"4","key":"12_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":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/3-540-39799-X_29","volume-title":"Advances in Cryptology","author":"J. H\u00e5stad","year":"1986","unstructured":"H\u00e5stad, J.: On using RSA with low exponent in a public key network. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 403\u2013408. Springer, Heidelberg (1986)"},{"key":"12_CR6","unstructured":"Hinek, J.: On the Security of Some Variants of RSA, Phd. Thesis, Waterloo, Ontario, Canada (2007)"},{"key":"12_CR7","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":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-46701-7_14","volume-title":"Secure Networking - CQRE (Secure) \u201999","author":"N. Howgrave-Graham","year":"1999","unstructured":"Howgrave-Graham, N., Seifert, J.-P.: Extending Wiener\u2019s attack in the presence of many decrypting exponents. In: Baumgart, R. (ed.) CQRE 1999. LNCS, vol.\u00a01740, pp. 153\u2013166. Springer, Heidelberg (1999)"},{"key":"12_CR9","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":"12_CR10","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Lenstra, H.W., L. Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a0261, 513\u2013534 (1982)","DOI":"10.1007\/BF01457454"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ipl.2009.11.016","volume":"110","author":"S. Sarkar","year":"2010","unstructured":"Sarkar, S., Maitra, S.: Cryptanalysis of RSA with two decryption exponents. Information Processing Letters\u00a0110, 178\u2013181 (2010)","journal-title":"Information Processing Letters"},{"key":"12_CR12","unstructured":"May, A.: New RSA Vulnerabilities Using Lattice Reduction Methods. Ph.D. thesis, University of Paderborn (2003)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-68164-9_12","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"A. Nitaj","year":"2008","unstructured":"Nitaj, A.: Another generalization of Wiener\u2019s attack on RSA. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol.\u00a05023, pp. 174\u2013190. Springer, Heidelberg (2008)"},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","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 (1978)","journal-title":"Communications of the ACM"},{"issue":"3-4","key":"12_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s00200-004-0164-6","volume":"15","author":"R. Steinfeld","year":"2004","unstructured":"Steinfeld, R., Zheng, Y.: On the Security of RSA with Primes Sharing Least-Significant Bits. Appl. Algebra Eng. Commun. Comput.\u00a015(3-4), 179\u2013200 (2004)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-45353-9_5","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"R. Steinfeld","year":"2001","unstructured":"Steinfeld, R., Zheng, Y.: An advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant Bits. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 52\u201362. Springer, Heidelberg (2001)"},{"issue":"3-4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s00200-004-0164-6","volume":"15","author":"R. Steinfeld","year":"2004","unstructured":"Steinfeld, R., Zheng, Y.: On the Security of RSA with Primes Sharing Least-Significant Bits. Appl. Algebra Eng. Commun. Comput.\u00a015(3-4), 179\u2013200 (2004)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-89641-8_4","volume-title":"Cryptology and Network Security","author":"H.-M. Sun","year":"2008","unstructured":"Sun, H.-M., Wu, M.-E., Steinfeld, R., Guo, J., Wang, H.: Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits. In: Franklin, M.K., Hui, L.C.K., Wong, D.S. (eds.) CANS 2008. LNCS, vol.\u00a05339, pp. 49\u201363. Springer, Heidelberg (2008)"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"M. Wiener","year":"1990","unstructured":"Wiener, M.: Cryptanalysis of short RSA secret exponents. IEEE Transactions on Information Theory\u00a036, 553\u2013558 (1990)","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-540-75496-1_15","volume-title":"Information Security","author":"Y.-D. Zhao","year":"2007","unstructured":"Zhao, Y.-D., Qi, W.-F.: Small private-exponent attack on RSA with primes sharing bits. In: Garay, J.A., Lenstra, A.K., Mambo, M., Peralta, R. (eds.) ISC 2007. LNCS, vol.\u00a04779, pp. 221\u2013229. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06734-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T17:32:50Z","timestamp":1558891970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06734-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319067339","9783319067346"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06734-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}