{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:21:37Z","timestamp":1776442897155,"version":"3.51.2"},"reference-count":46,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:00:00Z","timestamp":1689724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>In this paper, we propose a new scheme based on ephemeral elliptic curves over a finite ring with an RSA modulus. The new scheme is a variant of both the RSA and the KMOV cryptosystems and can be used for both signature and encryption. We study the security of the new scheme and show that it is immune to factorization attacks, discrete-logarithm-problem attacks, sum-of-two-squares attacks, sum-of-four-squares attacks, isomorphism attacks, and homomorphism attacks. Moreover, we show that the private exponents can be much smaller than the ordinary exponents in RSA and KMOV, which makes the decryption phase in the new scheme more efficient.<\/jats:p>","DOI":"10.3390\/cryptography7030037","type":"journal-article","created":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T21:21:46Z","timestamp":1689801706000},"page":"37","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A New RSA Variant Based on Elliptic Curves"],"prefix":"10.3390","volume":"7","author":[{"given":"Maher","family":"Boudabra","sequence":"first","affiliation":[{"name":"Department of Computing and Mathematics, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0372-1757","authenticated-orcid":false,"given":"Abderrahmane","family":"Nitaj","sequence":"additional","affiliation":[{"name":"Department of Mathematics, LMNO, Normandie University, UNICAEN, CNRS, LMNO, 14000 Caen, France"}]}],"member":"1968","published-online":{"date-parts":[[2023,7,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A Method for Obtaining digital signatures and public-key cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Commun. ACM"},{"key":"ref_2","first-page":"203","article-title":"Twenty years of attacks on the RSA cryptosystem","volume":"46","author":"Boneh","year":"1999","journal-title":"Not. Am. Math. Soc."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Hinek, M. (2009). Cryptanalysis of RSA and Its Variants, Chapman & Hall\/CRC Press.","DOI":"10.1201\/9781420075199"},{"key":"ref_4","unstructured":"Brassard, G. (1989, January 20\u201324). Batch RSA. Proceedings of the Crypto 1989, 9th Annual International Cryptology Conference, Santa Barbara, CA, USA. Volume 435 of LNCS."},{"key":"ref_5","unstructured":"Collins, T., Hopkins, D., Langford, S., and Sabin, M. (1997). Public Key Cryptographic Apparatus and Method. (5,848,159), U.S. Patent."},{"key":"ref_6","unstructured":"Krawczyk, H. (1998, January 23\u201327). Fast RSA-type Cryptosystem Modulo pkq. Proceedings of the Crypto 1998, 18th Annual International Cryptology Conference, Santa Barbara, CA, USA. Volume 1462 of LNCS."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1049\/el:19820617","article-title":"Fast Decipherment Algorithm for RSA Public-Key Cryptosystem","volume":"18","author":"Couvreur","year":"1982","journal-title":"Electron. Lett."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/18.54902","article-title":"Cryptanalysis of short RSA secret exponents","volume":"36","author":"Wiener","year":"1990","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2922","DOI":"10.1109\/TIT.2007.901248","article-title":"Dual RSA and its security analysis","volume":"53","author":"Sun","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","first-page":"239","article-title":"New public key cryptosystem based on the dependent RSA problem","volume":"Volume 1592","author":"Stern","year":"1999","journal-title":"Advances in Cryptology-EUROCRYPT\u201999. EUROCRYPT 1999"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","article-title":"Elliptic curve cryptosystems","volume":"48","author":"Koblitz","year":"1987","journal-title":"Math. Comput."},{"key":"ref_12","first-page":"417","article-title":"Use of elliptic curves in cryptography","volume":"Volume 218","author":"Williams","year":"1986","journal-title":"Advances in Cryptology-CRYPTO\u201985"},{"key":"ref_13","unstructured":"(2000). Federal Information Processing Standards Publication, FIPS PUB 186-2."},{"key":"ref_14","unstructured":"Certicom Research (2023, July 10). Standards for Efficient Cryptography, SEC 2: Recommended Elliptic Curve Domain Parameters. 27 January 2010 Version 2.0. Available online: https:\/\/www.secg.org\/sec2-v2.pdf."},{"key":"ref_15","unstructured":"Nakamoto, S. (2023, July 10). Bitcoin: A Peer-to-Peer Electronic Cash System. Available online: https:\/\/bitcoin.org\/bitcoin.pdf."},{"key":"ref_16","unstructured":"Koyama, K., Maurer, U.M., Okamoto, T., and Vanstone, S.A. (1991). Annual International Cryptology Conference, Springer. Lecture Notes in Computer Science 576."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Helleseth, T. (1994). Advances in Cryptology\u2014EUROCRYPT\u201993: Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques, Lofthus, Norway, 23\u201327 May 1993, Springer. Lecture Notes in Computer Science 765.","DOI":"10.1007\/3-540-48285-7"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"26","author":"Shor","year":"1997","journal-title":"SIAM J. Comput."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/978-3-540-68164-9_12","article-title":"Another generalization of Wiener\u2019s attack on RSA","volume":"Volume 5023","author":"Vaudenay","year":"2008","journal-title":"International Conference on Cryptology in Africa, AFRICACRYPT 2008"},{"key":"ref_20","unstructured":"Hardy, G.H., and Wright, E.M. (1979). An Introduction to Theory of Numbers, The Clarendon Press Oxford University Press. [5th ed.]."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s001459900030","article-title":"Small solutions to polynomial equations, and low exponent RSA vulnerabilities","volume":"10","author":"Coppersmith","year":"1997","journal-title":"J. Cryptol."},{"key":"ref_22","first-page":"1","article-title":"Cryptanalysis of RSA with private key d less than N0.292","volume":"Volume 1592","author":"Boneh","year":"1999","journal-title":"Advances in Cryptology-EUROCRYPT\u201999: Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, 2\u20136 May 1999"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Takayasu, A., and Kunihiro, N. (2014). Proceedings of the Information Security and Cryptology\u2014ICISC 2014, Seoul, Korea, 3\u20135 December 2014, Springer.","DOI":"10.1007\/978-3-319-15943-0_1"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s002000100088","article-title":"Cryptanalysis of RSA with small prime difference","volume":"13","year":"2002","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"ref_25","unstructured":"Husem\u00f6ller, D. (2004). Elliptic Curves, Springer. [2nd ed.]."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Schmitt, S., Zimmer, H.G., and ProQuest (Firm) (2003). Elliptic Curves: A Computational Approach, Walter de Gruyter.","DOI":"10.1515\/9783110198010"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Silverman, J.H. (1986). The Arithmetic of Elliptic Curves, Springer. Graduate Texts in Mathematics.","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Washington, L.C. (2003). Elliptic Curves: Number Theory and Cryptography, Chapman & Hall\/CRC.","DOI":"10.4324\/9780203484029"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Ireland, K., and Rosen, M. (1990). A Classical Introduction to Modern Number Theory, Springer. [2nd ed.]. Volume 84 of Graduate Texts in Mathematics.","DOI":"10.1007\/978-1-4757-2103-4"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"649","DOI":"10.2307\/1971363","article-title":"Factoring integers with elliptic curves","volume":"126","author":"Lenstra","year":"1987","journal-title":"Ann. Math."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Du, D.Z., Eades, P., Estivill-Castro, V., Lin, X., and Sharma, A. (2000). Proceedings of the Computing and Combinatorics. 6th Annual International Conference, COCOON 2000, Sydney, Australia, 26\u201328 July 2000, Springer. Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-44968-X"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Wiener, M. (1999). Crypto\u201999, Springer. Lecture Notes in Computer Science 1666.","DOI":"10.1007\/3-540-48405-1"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., and Lenstra, H.W. (1993). The Development of the Number Field Sieve, Springer. Lecture Notes in Mathematics 1554.","DOI":"10.1007\/BFb0091534"},{"key":"ref_34","unstructured":"Pomerance, C. (1985). Workshop on the Theory and Application of Cryptographic Techniques, Springer."},{"key":"ref_35","unstructured":"Rabin, M.O. (Digital Signatures and Public Key Functions as Intractable as Factoring, 1979). Digital Signatures and Public Key Functions as Intractable as Factoring, MIT Technical Report, MIT\/LCS\/TR-212."},{"key":"ref_36","unstructured":"Elia, M. (2019). Continued Fractions and Factoring. arXiv."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S0893-9659(00)00159-2","article-title":"Computing the order of points on an elliptic curve modulo N is as difficult as factoring N","volume":"14","author":"Morillo","year":"2001","journal-title":"Appl. Math. Lett."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Blake, I., Seroussi, G., and Smart, N. (1999). Elliptic Curves in Cryptography, Cambridge University Press.","DOI":"10.1017\/CBO9781107360211"},{"key":"ref_39","unstructured":"Kunihiro, N., and Koyama, K. (1998). LNCS 1403, Proceedings of the Eurocrypt 1998."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1080\/09720529.2019.1587827","article-title":"A new attack on RSA and Demytko\u2019s elliptic curve cryptosystem","volume":"22","author":"Nitaj","year":"2019","journal-title":"J. Discret. Math. Sci. Cryptogr."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s10623-015-0146-7","article-title":"Recent progress on the elliptic curve discrete logarithm problem","volume":"78","author":"Galbraith","year":"2016","journal-title":"Des. Codes Cryptogr."},{"key":"ref_42","first-page":"329","article-title":"Fast RSA type scheme based on singular cubic curve y2 + axy = x3 (mod n)","volume":"Volume 921","author":"Koyama","year":"1995","journal-title":"Advances in Cryptology\u2014EUROCRYPT\u201995: Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, Saint-Malo, France, 21\u201325 May 1995"},{"key":"ref_43","first-page":"27","article-title":"A new RSA-type scheme based on singular cubic curves y2 = x3 + bx2 (mod n)","volume":"E78-A","author":"Kuwakado","year":"1995","journal-title":"IEICE Trans. Fundam."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/3-540-44448-3_44","article-title":"Trapdooring Discrete Logarithms on Elliptic Curves over Rings","volume":"Volume 1976","author":"Okamoto","year":"2000","journal-title":"Advances in Cryptology\u2013ASIACRYPT 2000"},{"key":"ref_45","unstructured":"Bleichenbacher, D. (1997). Annual International Cryptology Conference, Springer."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(94)00179-3","article-title":"Low exponent attack against elliptic curve RSA","volume":"53","author":"Kurosawa","year":"1995","journal-title":"Inf. Process. Lett."}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/7\/3\/37\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:14:47Z","timestamp":1760127287000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/7\/3\/37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,19]]},"references-count":46,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,9]]}},"alternative-id":["cryptography7030037"],"URL":"https:\/\/doi.org\/10.3390\/cryptography7030037","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,19]]}}}