{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T10:18:49Z","timestamp":1768385929547,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T00:00:00Z","timestamp":1757289600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T00:00:00Z","timestamp":1757289600000},"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":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s40314-025-03392-8","type":"journal-article","created":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T09:48:54Z","timestamp":1757411334000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A generalized attack on a new variant of the RSA cryptosystem"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-7251-3322","authenticated-orcid":false,"given":"Mohammed","family":"Rahmani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abderrahmane","family":"Nitaj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mhammed","family":"Ziane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,8]]},"reference":[{"key":"3392_CR1","doi-asserted-by":"crossref","unstructured":"Boneh D, Durfee G (1999) Cryptanalysis of RSA with private key $$d$$ less than $$N^{0.292}$$, Advances in Cryptology-Eurocrypt\u201999, Lecture Notes in Computer Science 1592, pp. 1\u201311,Springer, Berlin, Heidelberg,","DOI":"10.1007\/3-540-48910-X_1"},{"issue":"12","key":"3392_CR2","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 (2018) A new generalization of the KMOV cryptosystem. J Appl Math Comput 57(12):229\u2013245","journal-title":"J Appl Math Comput"},{"key":"3392_CR3","unstructured":"Collins T, Hopkins D, Langford S, Sabin M (1997) Public key cryptographic apparatus and Method. US Patent #5,848,159,"},{"issue":"4","key":"3392_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith D (1997) Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J Cryptol 10(4):233\u2013260","journal-title":"J Cryptol"},{"key":"3392_CR5","doi-asserted-by":"crossref","unstructured":"Cotan P, Te\u015feleanu G (2022) 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. Springer, Cham, 589\u2013605,","DOI":"10.1007\/978-3-031-21280-2_33"},{"key":"3392_CR6","doi-asserted-by":"crossref","unstructured":"Feng Y, Nitaj A, Pan Y (2024) Partial prime factor exposure attacks on some RSA variants. Theoretical Computer Science, 999, pp. 114549, Elsevier,","DOI":"10.1016\/j.tcs.2024.114549"},{"key":"3392_CR7","doi-asserted-by":"crossref","unstructured":"Howgrave-Graham N (1997) Finding small roots of univariate modular equations revisited, In: IMA International Conference on Cryptography and Coding, LNCS, Springer, Berlin, Heidelberg, 1355 131\u2013142,","DOI":"10.1007\/BFb0024458"},{"key":"3392_CR8","unstructured":"HPC-MARWAN, National Center for Scientific and Technical Research (CNRST), Rabat, Morocco. https:\/\/hpc.marwan.ma\/index.php\/en\/"},{"key":"3392_CR9","doi-asserted-by":"crossref","unstructured":"Jochemsz E, May A (2006) A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants, In: ASIACRYPT 2006, LNCS, Springer-Verlag, 4284, 267\u2013282,","DOI":"10.1007\/11935230_18"},{"key":"3392_CR10","doi-asserted-by":"crossref","unstructured":"Koyama K, Maurer UM, Okamoto T, Vanstone SA (1991) New public-key schemes based on elliptic curves over the ring $$\\mathbb{ Z} _n$$, in: Proceedings of CRYPTO 1991, Lecture Notes in Computer Science 576, 1991, 252\u2013266,","DOI":"10.1007\/3-540-46766-1_20"},{"key":"3392_CR11","doi-asserted-by":"publisher","unstructured":"Kunihiro N (2012) On Optimal Bounds of Small Inverse Problems and Approximate GCD Problems with Higher Degree. In: Gollmann, D., Freiling, F.C. (eds) Information Security. ISC 2012. Lecture Notes in Computer Science, vol 7483. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-33383-5_4,","DOI":"10.1007\/978-3-642-33383-5_4"},{"key":"3392_CR12","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra AK, Lenstra HW, Lov\u00e1sz L (1982) Factoring polynomials with rational coefficients. Math Ann 261:513\u2013534","journal-title":"Math Ann"},{"key":"3392_CR13","unstructured":"May A (2003) New RSA Vulnerabilities Using Lattice Reduction Methods. PhD thesis, University of Paderborn"},{"key":"3392_CR14","doi-asserted-by":"crossref","unstructured":"Murru N, Saettone FM (2018) A novel RSA-like cryptosystem based on a generalization of the r\u00e9dei rational functions. In: Kaczorowski J., Pieprzyk J., Pomykala J. (eds) Number-Theoretic Methods in Cryptology. NuTMiC 2017. Lecture Notes in Computer Science, Springer, Cham, 10737, 91\u2013103,","DOI":"10.1007\/978-3-319-76620-1_6"},{"key":"3392_CR15","doi-asserted-by":"crossref","unstructured":"Nitaj A (2008) Another generalization of Wiener\u2019s attack on RSA, In: Vaudenay, S. (Ed.) Africacrypt 2008. LNCS, Springer, Heidelberg, 5023, 174\u2013190","DOI":"10.1007\/978-3-540-68164-9_12"},{"key":"3392_CR16","doi-asserted-by":"crossref","unstructured":"Nitaj A, Ariffin MRBK, Adenan NNH, Abu NA (2021) Classical Attacks on a Variant of the RSA Cryptosystem. In: Longa, P., R\u00e0fols, C. (eds) Progress in Cryptology LATINCRYPT 2021. LATINCRYPT 2021. Lecture Notes in Computer Science, vol 12912. Springer, Cham,","DOI":"10.1007\/978-3-030-88238-9_8"},{"key":"3392_CR17","doi-asserted-by":"crossref","unstructured":"Nitaj A, Adenan NNH, Ariffin MRK (2024) Cryptanalysis of a New Variant of the RSA Cryptosystem. In: Vaudenay, S., Petit, C. (eds) Progress in Cryptology\u00a0- AFRICACRYPT 2024. AFRICACRYPT 2024. Lecture Notes in Computer Science, vol 14861. Springer, Cham,","DOI":"10.1007\/978-3-031-64381-1_15"},{"key":"3392_CR18","doi-asserted-by":"crossref","unstructured":"Peng L, Hu L, Lu Y, Wei H (2016) An improved analysis on three variants of the RSA cryptosystem. International Conference on Information Security and Cryptology Springer 10143:140\u2013149","DOI":"10.1007\/978-3-319-54705-3_9"},{"issue":"21","key":"3392_CR19","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"JJ Quisquater","year":"1982","unstructured":"Quisquater JJ, Couvreur C (1982) Fast decipherment algorithm for RSA public-key cryptosystem. Electron Lett 18(21):905\u2013907","journal-title":"Electron Lett"},{"issue":"44","key":"3392_CR20","first-page":"2024","volume":"8","author":"M Rahmani","year":"2024","unstructured":"Rahmani M, Nitaj A, Ziane M (2024) Partial exposure attacks on a new RSA variant. Cryptography 8(44):2024","journal-title":"Cryptography"},{"issue":"2","key":"3392_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 (1978) A Method for Obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120\u2013126","journal-title":"Commun ACM"},{"key":"3392_CR22","doi-asserted-by":"crossref","unstructured":"Shi G, Wang G, Gu D (2022) 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,","DOI":"10.1007\/978-3-031-22390-7_9"},{"issue":"1","key":"3392_CR23","first-page":"94","volume":"87","author":"T Takagi","year":"2004","unstructured":"Takagi T (2004) A fast RSA-type public-key primitive modulo $$p^kq$$ using Hensel lifting. IEICE Trans Fundam Electron Commun Comput Sci 87(1):94\u2013101","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"issue":"3","key":"3392_CR24","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"M Wiener","year":"1990","unstructured":"Wiener M (1990) Cryptanalysis of short RSA secret exponents. IEEE Trans Inf Theory 36(3):553\u2013558","journal-title":"IEEE Trans Inf Theory"},{"key":"3392_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 (2021) Cryptanalysis of the RSA variant based on cubic Pell equation. Theor Comput Sci 889:135\u2013144","journal-title":"Theor Comput Sci"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03392-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03392-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03392-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T05:31:53Z","timestamp":1768368713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03392-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["3392"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03392-8","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,8]]},"assertion":[{"value":"2 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"11"}}