{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:30:23Z","timestamp":1764981023363,"version":"3.46.0"},"reference-count":27,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,11,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The idea of extending the classical RSA protocol using algebraic number fields was introduced by Takagi and Naito (Construction of RSA cryptosystem over the algebraic field using ideal theory and investigation of its security. Electron Commun Japan Part III Fund Electr Sci. 2000;83:19\u201329). Recently, Zheng et al. proposed the use of the ring of algebraic integers of an algebraic number field and the lattice theory to present a high-dimensional form of RSA. The authors claim that their proposal is post-quantum and is significant both from the theoretical and practical point of view. In this article, we prove that the security of Zheng et al.\u2019s scheme is still based on the factorization problem, and we present a practical quantum attack on this proposed scheme, our attack is a quantum polynomial time algorithm that employs Shor\u2019s algorithm as a subroutine.<\/jats:p>","DOI":"10.1515\/jmc-2024-0007","type":"journal-article","created":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T04:13:03Z","timestamp":1731298383000},"source":"Crossref","is-referenced-by-count":0,"title":["On the quantum security of high-dimensional RSA protocol"],"prefix":"10.1515","volume":"18","author":[{"given":"Nour-eddine","family":"Rahmani","sequence":"first","affiliation":[{"name":"ACSA Laboratory, Faculty of Sciences, Mohammed Premier University , Oujda , Morocco"}]},{"given":"Taoufik","family":"Serraj","sequence":"additional","affiliation":[{"name":"ACSA Laboratory, Faculty of Sciences, Mohammed Premier University , Oujda , Morocco"}]},{"given":"Moulay Chrif","family":"Ismaili","sequence":"additional","affiliation":[{"name":"ACSA Laboratory, Faculty of Sciences, Mohammed Premier University , Oujda , Morocco"}]},{"given":"Abdelmalek","family":"Azizi","sequence":"additional","affiliation":[{"name":"ACSA Laboratory, Faculty of Sciences, Mohammed Premier University , Oujda , Morocco"}]}],"member":"374","published-online":{"date-parts":[[2024,11,11]]},"reference":[{"key":"2025120600251197854_j_jmc-2024-0007_ref_001","doi-asserted-by":"crossref","unstructured":"Grover LK. A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. STOC \u201996. New York, NY, USA: Association for Computing Machinery; 1996. p. 212\u20139. 10.1145\/237814.237866.","DOI":"10.1145\/237814.237866"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_002","doi-asserted-by":"crossref","unstructured":"Shor PW. Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science; 1994. p. 124\u201334.","DOI":"10.1109\/SFCS.1994.365700"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_003","doi-asserted-by":"crossref","unstructured":"Regev O. On lattices, learning with errors, random linear codes, and cryptography. New York, NY, USA: Association for Computing Machinery; 2005. 10.1145\/1060590.1060603.","DOI":"10.1145\/1060590.1060603"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_004","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings. In: Gilbert H, editor. Advances in cryptology - EUROCRYPT 2010. Berlin, Heidelberg: Springer Berlin Heidelberg; 2010. p. 1\u201323.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_005","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9 D, Steinfeld R, Tanaka K, Xagawa K. Efficient public key encryption based on ideal lattices. In: Matsui M, editor. Advances in cryptology - ASIACRYPT 2009. Berlin, Heidelberg: Springer Berlin Heidelberg; 2009. p. 617\u201335.","DOI":"10.1007\/978-3-642-10366-7_36"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_006","doi-asserted-by":"crossref","unstructured":"Lindner R, Peikert C. Better key sizes (and attacks) for LWE-based encryption. In: Kiayias A, editor. Topics in Cryptology - CT-RSA 2011. Berlin, Heidelberg: Springer; 2011. p. 319\u201339.","DOI":"10.1007\/978-3-642-19074-2_21"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_007","doi-asserted-by":"crossref","unstructured":"Peikert C. A decade of lattice cryptography; 2016. http:\/\/dx.doi.org\/10.1561\/0400000074.","DOI":"10.1561\/9781680831139"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_008","doi-asserted-by":"crossref","unstructured":"Peikert C, Pepin Z. Algebraically structured LWE, Revisited. In: Hofheinz D, Rosen A, editors. Theory of Cryptography. Cham: Springer International Publishing; 2019. p. 1\u201323.","DOI":"10.1007\/978-3-030-36030-6_1"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_009","unstructured":"Fouque PA, Hoffstein J, Kirchner P, Lyubashevsky V, Pornin T, Prest T, et al. Falcon: Fast-Fourier lattice-based compact signatures over NTRU. Submission to the NIST\u2019s post-quantum cryptography standardization process. 2018;36(5):1\u201375."},{"key":"2025120600251197854_j_jmc-2024-0007_ref_010","doi-asserted-by":"crossref","unstructured":"Ducas L, Kiltz E, Lepoint T, Lyubashevsky V, Schwabe P, Seiler G, et al. CRYSTALS-Dilithium: A lattice-based digital signature scheme. Transactions on cryptographic hardware and embedded systems. 2018;2018(1):238\u201368.","DOI":"10.46586\/tches.v2018.i1.238-268"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_011","doi-asserted-by":"crossref","unstructured":"Bos J, Ducas L, Kiltz E, Lepoint T, Lyubashevsky V, Schanck JM, et al. CRYSTALS - Kyber: A CCA-Secure module-lattice-based KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroS&P); 2018. p. 353\u201367.","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_012","doi-asserted-by":"crossref","unstructured":"Alagic G, Apon D, Cooper D, Dang Q, Dang T, Kelsey J, et al. Status report on the third round of the NIST post-quantum cryptography standardization process. USA: US Department of Commerce, NIST. 2022.","DOI":"10.6028\/NIST.IR.8413"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_013","doi-asserted-by":"crossref","unstructured":"Lenstra AK, Lenstra HW, Lov\u00e1sz LM. Factoring polynomials with rational coefficients. Mathematische Annalen. 1982;261:515\u201334. https:\/\/api.semanticscholar.org\/CorpusID:5701340.","DOI":"10.1007\/BF01457454"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_014","doi-asserted-by":"crossref","unstructured":"Zhao Z, Ding J. Practical improvements on BKZ algorithm. In: Dolev S, Gudes E, Paillier P, editors. Cyber Security, Cryptology, and Machine Learning. Cham: Springer Nature Switzerland; 2023. p. 273\u201384.","DOI":"10.1007\/978-3-031-34671-2_19"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_015","doi-asserted-by":"crossref","unstructured":"Albrecht M, Ducas L, Herold G, Kirshanova E, Postlethwaite E, Stevens M. The General Sieve Kernel and New Records in Lattice Reduction. In: EUROCRYPT 2019. Lecture Notes in Computer Science. Springer; 2019. p. 717\u201346.","DOI":"10.1007\/978-3-030-17656-3_25"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_016","doi-asserted-by":"crossref","unstructured":"Kirchner P, Fouque PA. Revisiting lattice attacks on overstretched NTRU parameters. In: Coron JS, Nielsen JB, editors. Advances in cryptology - EUROCRYPT 2017. Cham: Springer International Publishing; 2017. p. 3\u201326.","DOI":"10.1007\/978-3-319-56620-7_1"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_017","doi-asserted-by":"crossref","unstructured":"Micheli GD, Heninger N, Shani B. Characterizing overstretched NTRU attacks. J Math Cryptol. 2020;14(1):110\u20139. 10.1515\/jmc-2015-0055 [cited 2024-07-09].","DOI":"10.1515\/jmc-2015-0055"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_018","doi-asserted-by":"crossref","unstructured":"Takagi T, Naito S. Construction of RSA cryptosystem over the algebraic field using ideal theory and investigation of its security. Electron Commun Japan Part III Fund Electr Sci. 2000;83:19\u201329. https:\/\/api.semanticscholar.org\/CorpusID:119513671.","DOI":"10.1002\/(SICI)1520-6440(200008)83:8<19::AID-ECJC3>3.0.CO;2-0"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_019","doi-asserted-by":"crossref","unstructured":"Zhiyong Z, Fengxia L, Man C. On the high-dimensional RSA algorithm\u2013a public key cryptosystem based on lattice and algebraic number theory. In: Zheng Z, editor. Proceedings of the Second International Forum on Financial Mathematics and Financial Technology. Singapore: Springer Nature Singapore; 2023. p. 169\u201389.","DOI":"10.1007\/978-981-99-2366-3_9"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_020","doi-asserted-by":"crossref","unstructured":"Lang S. Algebraic number theory. Graduate texts in mathematics. Springer-Verlag; 1994.","DOI":"10.1007\/978-1-4612-0853-2"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_021","doi-asserted-by":"crossref","unstructured":"Washington LC. Introduction to Cyclotomic Fields. Graduate Texts in Mathematics. New York: Springer; 1997.","DOI":"10.1007\/978-1-4612-1934-7"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_022","unstructured":"Murty MR, Esmonde J. Problems in algebraic number theory. vol. 190. Springer Science & Business Media; 2005."},{"key":"2025120600251197854_j_jmc-2024-0007_ref_023","unstructured":"Cohen H. A course in computational algebraic number theory. Graduate Texts in Mathematics. Berlin Heidelberg: Springer; 2000. https:\/\/books.google.co.ma\/books?id=hXGr-9l1DXcC."},{"key":"2025120600251197854_j_jmc-2024-0007_ref_024","unstructured":"Regev O. On the complexity of lattice problems with polynomial approximation factors. In: Nguyen PQ, Vall\u00e9e B, editors. Berlin, Heidelberg: Springer Berlin Heidelberg; 2010. p. 475\u201396. 10.1007\/978-3-642-02295-1_15."},{"key":"2025120600251197854_j_jmc-2024-0007_ref_025","doi-asserted-by":"crossref","unstructured":"Schnorr CP. A hierarchy of polynomial time lattice basis reduction algorithms. Theoretic Comput Sci. 1987;53(2):201\u201324. https:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397587900648.","DOI":"10.1016\/0304-3975(87)90064-8"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_026","doi-asserted-by":"crossref","unstructured":"Hoffstein J, Pipher J, Silverman JH. NTRU: A ring-based public key cryptosystem. In: International Workshop on Ant Colony Optimization and Swarm Intelligence; 1998.","DOI":"10.1007\/BFb0054868"},{"key":"2025120600251197854_j_jmc-2024-0007_ref_027","unstructured":"PARI\/GP version 2.15.4. Univ. Bordeaux; 2023. http:\/\/pari.math.u-bordeaux.fr\/."}],"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2024-0007\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2024-0007\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:25:29Z","timestamp":1764980729000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2024-0007\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,1]]},"references-count":27,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,2,14]]},"published-print":{"date-parts":[[2024,2,14]]}},"alternative-id":["10.1515\/jmc-2024-0007"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2024-0007","relation":{},"ISSN":["1862-2984"],"issn-type":[{"type":"electronic","value":"1862-2984"}],"subject":[],"published":{"date-parts":[[2024,1,1]]},"article-number":"20240007"}}