{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T19:05:26Z","timestamp":1771614326277,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031643804","type":"print"},{"value":"9783031643811","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-64381-1_15","type":"book-chapter","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T23:01:56Z","timestamp":1719961316000},"page":"327-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cryptanalysis of\u00a0a\u00a0New Variant of\u00a0the\u00a0RSA Cryptosystem"],"prefix":"10.1007","author":[{"given":"Abderrahmane","family":"Nitaj","sequence":"first","affiliation":[]},{"given":"Nurul Nur Hanisah","family":"Adenan","sequence":"additional","affiliation":[]},{"given":"Muhammad Rezal Kamel","family":"Ariffin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"issue":"2","key":"15_CR1","first-page":"203","volume":"46","author":"D Boneh","year":"1999","unstructured":"Boneh, D.: Twenty years of attacks on the RSA cryptosystem. Notices Amer. Math. Soc. 46(2), 203\u2013213 (1999)","journal-title":"Notices Amer. Math. Soc."},{"key":"15_CR2","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 \u2014 EUROCRYPT \u201999","author":"D Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key d less than N0.292. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 1\u201311. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_1"},{"issue":"1\u20132","key":"15_CR3","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s12190-017-1103-6","volume":"57","author":"M Boudabra","year":"2018","unstructured":"Boudabra, M., Nitaj, A.: A new generalization of the KMOV cryptosystem. J. Appl. Math. Comput. 57(1\u20132), 229\u2013245 (2018)","journal-title":"J. Appl. Math. Comput."},{"key":"15_CR4","unstructured":"Collins, T., Hopkins, D., Langford, S., Sabin, M.: Public key cryptographic apparatus and Method. US Patent #5,848,159, Jan. 1997 (1997)"},{"issue":"4","key":"15_CR5","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. Cryptol. 10(4), 233\u2013260 (1997)","journal-title":"J. Cryptol."},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Cotan, P., Te\u015feleanu, G.: Continued fractions applied to a family of RSA-like cryptosystems. In: Su, C., Gritzalis, D., Piuri, V. (eds.) Information Security Practice and Experience. ISPEC 2022. Lecture Notes in Computer Science, vol. 13620, pp. 589\u2013605. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-21280-2_33","DOI":"10.1007\/978-3-031-21280-2_33"},{"key":"15_CR7","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. Chapman & Hall\/CRC, Cryptography and Network Security Series, Boca Raton (2009)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Crytography 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. 1355, pp. 131\u2013142. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0024458"},{"key":"15_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. 4284, pp. 267\u2013282. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11935230_18"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Koyama, K., Maurer, U.M., Okamoto, T., Vanstone, S.A.: New public-key schemes based on elliptic curves over the ring $$\\mathbb{Z}_n$$. In: Proceedings of CRYPTO 1991, Lecture Notes in Computer Science, vol. 576, pp. 252\u2013266 (1991)","DOI":"10.1007\/3-540-46766-1_20"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-33383-5_4","volume-title":"Information Security","author":"N Kunihiro","year":"2012","unstructured":"Kunihiro, N.: On optimal bounds of small inverse problems and approximate GCD problems with higher degree. In: Gollmann, D., Freiling, F.C. (eds.) ISC 2012. LNCS, vol. 7483, pp. 55\u201369. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33383-5_4"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 513\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"May, A.: Using LLL-reduction for solving RSA and factorization problems: a survey. In: Nguyen, P., Vall\u00e9e, B. (eds.) LLL+25 Conference in Honour of the 25th Birthday of the LLL Algorithm. Springer, Berlin, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-642-02295-1_10","DOI":"10.1007\/978-3-642-02295-1_10"},{"key":"15_CR14","unstructured":"May, A.: New RSA vulnerabilities using lattice reduction methods. PhD Thesis, University of Paderborn (2003). https:\/\/digital.ub.uni-paderborn.de\/ubpb\/urn\/urn:nbn:de:hbz:466-20030101205"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-76620-1_6","volume-title":"Number-Theoretic Methods in Cryptology","author":"N Murru","year":"2018","unstructured":"Murru, N., Saettone, F.M.: A novel RSA-like cryptosystem based on a generalization of the r\u00e9dei rational functions. In: Kaczorowski, J., Pieprzyk, J., Pomyka\u0142a, J. (eds.) NuTMiC 2017. LNCS, vol. 10737, pp. 91\u2013103. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76620-1_6"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.tcs.2022.05.010","volume":"923","author":"DI Nassr","year":"2022","unstructured":"Nassr, D.I., Anwar, M., Bahig, H.M.: Improving small private exponent attack on the Murru-Saettone cryptosystem. Theor. Comput. Sci. 923, 222\u2013234 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-68164-9_12","volume-title":"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. 5023, pp. 174\u2013190. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68164-9_12"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-88238-9_8","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2021","author":"A Nitaj","year":"2021","unstructured":"Nitaj, A., Ariffin, M.R.B.K., Adenan, N.N.H., Abu, N.A.: Classical attacks on a variant of the RSA cryptosystem. In: Longa, P., R\u00e0fols, C. (eds.) LATINCRYPT 2021. LNCS, vol. 12912, pp. 151\u2013167. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88238-9_8"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"53788","DOI":"10.1109\/ACCESS.2022.3175519","volume":"10","author":"A Nitaj","year":"2022","unstructured":"Nitaj, A., Ariffin, M.R.B.K., Adenan, N.N.H., Lau, T.S.C., Chen, J.: Security issues of novel RSA variant. IEEE Access 10, 53788\u201353796 (2022)","journal-title":"IEEE Access"},{"issue":"21","key":"15_CR20","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"JJ Quisquater","year":"1982","unstructured":"Quisquater, J.J., Couvreur, C.: Fast decipherment algorithm for RSA public-key cryptosystem. Electron. Lett. 18(21), 905\u2013907 (1982)","journal-title":"Electron. Lett."},{"issue":"2","key":"15_CR21","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. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"15_CR22","doi-asserted-by":"publisher","unstructured":"Shi, G., Wang, G., Gu, D.: Further cryptanalysis of a type of RSA variants. In: Susilo, W., Chen, X., Guo, F., Zhang, Y., Intan, R. (eds.) Information Security. ISC 2022. Lecture Notes in Computer Science, vol. 13640. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22390-7_9","DOI":"10.1007\/978-3-031-22390-7_9"},{"key":"15_CR23","unstructured":"Takagi, T.: A fast RSA-type public-key primitive modulo $$p^kq$$ using Hensel lifting. IEICE Trans. 87-A, 94\u2013101 (2004)"},{"key":"15_CR24","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 Trans. Inf. Theory 36, 553\u2013558 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2021.08.001","volume":"889","author":"M Zheng","year":"2021","unstructured":"Zheng, M., Kunihiro, N., Yao, Y.: Cryptanalysis of the RSA variant based on cubic Pell equation. Theoret. Comput. Sci. 889, 135\u2013144 (2021)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64381-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T23:04:02Z","timestamp":1719961442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64381-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031643804","9783031643811"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64381-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Douala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cameroon","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}