{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T19:05:23Z","timestamp":1771614323285,"version":"3.50.1"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031823794","type":"print"},{"value":"9783031823800","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-82380-0_8","type":"book-chapter","created":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T10:16:21Z","timestamp":1739873781000},"page":"239-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A New Public Key Cryptosystem Based on\u00a0the\u00a0Cubic Pell Curve"],"prefix":"10.1007","author":[{"given":"Michel","family":"Seck","sequence":"first","affiliation":[]},{"given":"Abderrahmane","family":"Nitaj","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,19]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/b97610","volume-title":"Pell Equation, Chapter 7: The Cubic Analogue of Pell Equation","author":"EJ Barbeau","year":"2003","unstructured":"Barbeau, E.J.: Pell Equation, Chapter 7: The Cubic Analogue of Pell Equation. Springer, New York (2003)"},{"issue":"2","key":"8_CR2","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":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bos J., et al.: CRYSTALS-Kyber: a CCA-secure module-latticebased KEM. In: 2018 IEEE European Symposium on Security and Privacy (EuroSP), pp. 353\u2013367. IEEE (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-49649-1_3","volume-title":"Advances in Cryptology \u2014 ASIACRYPT\u201998","author":"D Boneh","year":"1998","unstructured":"Boneh, D., Durfee, G., Frankel, Y.: An attack on RSA given a small fraction of the private key bits. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 25\u201334. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49649-1_3"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Durfee, G., Howgrave-Graham, N.: Factoring $$N=p^rq$$ for large $$r$$. CRYPTO 1999, 326\u2013337 (1999)","DOI":"10.1007\/3-540-48405-1_21"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key $$d$$ less than $$N^{0.292}$$. In: Advances in Cryptology-Eurocrypt 1999, LNCs, vol. 1592, pp. 1\u201311. Springer, Cham (1999)","DOI":"10.1007\/3-540-48910-X_1"},{"issue":"1\u20132","key":"8_CR7","first-page":"229","volume":"57","author":"M Boudabra","year":"2017","unstructured":"Boudabra, M., Nitaj, A.: A new generalization of the KMOV cryptosystem. J. Appl. Math. Comput. 57(1\u20132), 229\u2013245 (2017)","journal-title":"J. Appl. Math. Comput."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s12190-019-01257-y","volume":"61","author":"M Boudabra","year":"2019","unstructured":"Boudabra, M., Nitaj, A.: A new public key cryptosystem based on Edwards curves. J. Appl. Math. Comput. 61, 431\u2013450 (2019)","journal-title":"J. Appl. Math. Comput."},{"issue":"4","key":"8_CR9","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":"8_CR10","doi-asserted-by":"crossref","unstructured":"Demytko, N.: A new elliptic curve based analogue of RSA. In: Helleseth, T. (ed.), EUROCRYPT 1993, LNCS, vol. 765, pp. 40\u201349. Springer, Cham (1994)","DOI":"10.1007\/3-540-48285-7_4"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. Institute of Electrical and Electronics Engineers, vol. IT-22. Trans. Inf. Theory, no. 6, 1976, pp. 644\u2013654 (1976)","DOI":"10.1109\/TIT.1976.1055638"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Dutto, S., Murru, N.: On the cubic Pell equation over finite fields, arXiv:2203.05290 (2022)","DOI":"10.2989\/16073606.2022.2144531"},{"key":"8_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139012843","volume-title":"Mathematics of Public Key Cryptography","author":"S Galbraith","year":"2012","unstructured":"Galbraith, S.: Mathematics of Public Key Cryptography. Cambridge University Press, Cambridge (2012)"},{"key":"8_CR14","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to Theory of Numbers, 5th edn. The Clarendon Press, Oxford University Press, New York (1979)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: On using RSA with low exponent in a public key network. In: Advances in Cryptology-CRYPTO\u201985 Proceedings 5, pp. 403-408. Springer, Heidelberg (1986)","DOI":"10.1007\/3-540-39799-X_29"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Koyama, K.: Fast RSA type scheme based on singular cubic curve $$y^{2}+axy=x^{3}~(mod \\; n)$$. In: Proceedings of Eurocrypt\u201995, LNCS, vol. 921, pp. 329\u2013339. Springer, Cham (1995)","DOI":"10.1007\/3-540-49264-X_27"},{"key":"8_CR17","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, LNCS, vol. 576, pp. 252\u2013266. pp. 252\u2013266 (1991)","DOI":"10.1007\/3-540-46766-1_20"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Kuwakado H., Koyama K., Tsuruoka, Y.: A new RSA-type scheme based on singular cubic curves $$y^{2}\\equiv x^{3}+bx^{2}~(mod \\; n)$$. IEICE Trans. Fundamentals, E78-A, 27\u201333 (1995)","DOI":"10.1007\/3-540-49264-X_27"},{"key":"8_CR19","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":"8_CR20","doi-asserted-by":"crossref","unstructured":"Lim, S., Kim, S., Yie, I., Lee, H.: A generalized Takagi-cryptosystem with a modulus of the form $$p^rq^s$$, in: Indocrypt, Springer, pp. 283\u2013294 (2000)","DOI":"10.1007\/3-540-44495-5_25"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"V. Lyubashevsky, V. , C. Peikert, C., and O. Regev, O.: On ideal lattices and learning with errors over rings. J. ACM (JACM), 60(6), 1\u201335 (2013)","DOI":"10.1145\/2535925"},{"key":"8_CR22","doi-asserted-by":"crossref","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., Pomykala, J. (eds.) Number-Theoretic Methods in Cryptology. NuTMiC 2017. LNCS, vol. 10737. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-76620-1_6"},{"key":"8_CR23","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"},{"issue":"51","key":"8_CR24","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.4134\/BKMS.2014.51.5.1347","volume":"2014","author":"A Nitaj","year":"2014","unstructured":"Nitaj, A.: A new attack on the KMOV cryptosystem. Bull. Korean Math. Soc. 2014(51), 1347\u20131356 (2014)","journal-title":"Bull. Korean Math. Soc."},{"key":"8_CR25","doi-asserted-by":"crossref","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., Rafols, C. (eds.) Progress in Cryptology, LATINCRYPT 2021. LNCS, vol. 12912 (2021)","DOI":"10.1007\/978-3-030-88238-9_8"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Uchiyama, U.: A new public-key cryptosystem as secure as factoring. In: Advances in Cryptology - EUROCRYPT 1998, LNCS. vol. 1403, pp. 308\u2013318. Springer, Berlin (1998)","DOI":"10.1007\/BFb0054135"},{"key":"8_CR27","unstructured":"Okamoto, T., Uchiyama, U., Fujisaki, E.: EPOC: efficient probabilistic public-key encryption (1998)"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Ding, C., Pei, D., Salomaa, A.: Chinese Remainder Theorem: Applications in Computing, Coding. World Scientific, Cryptography (1996)","DOI":"10.1142\/9789812779380"},{"key":"8_CR29","unstructured":"Rabin, M. O.: Digitalized signatures and public key functions as intractable as factorisation. MIT\/LCS\/TR-212 MIT Laboratory for Computer Science (1979)"},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography, ser. STOC\u201905. New York, NY, USA: Association for Computing Machinery, 2005, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"issue":"2","key":"8_CR31","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":"8_CR32","unstructured":"Rosen, K.H.: Elementary Number Theory and Its Applications, 3rd edn., pp. 285\u2013302. Addison-Wesley, Reading (1993)"},{"key":"8_CR33","unstructured":"SageMath, the Sage Mathematics Software System (Version 10.1), The Sage Developers (2023). https:\/\/www.sagemath.org"},{"key":"8_CR34","unstructured":"Seck, M.: Proof of concept implementation of the proposed encryption scheme. Available on GitHub at https:\/\/github.com\/mseckept\/schemesecknitaj.git"},{"key":"8_CR35","unstructured":"SimulaMath, A Software for learning, teaching and research in mathematics (Version 1.1), The SimulaMath Developers (2023). https:\/\/simulamath.org"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Schmidt-Samoa, K.: A new Rabin-type trapdoor permutation equivalent to factoring, Electronic Notes in Theoretical Computer Science, Elsevier, vol.157, no. 3, pp. 79\u201394 (2006). https:\/\/eprint.iacr.org\/2005\/278.pdf","DOI":"10.1016\/j.entcs.2005.09.039"},{"key":"8_CR37","unstructured":"P. Schwabe, R., et al.: Technical report, National Institute of Standards and Technology (2017). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-1-submissions"},{"key":"8_CR38","unstructured":"A. Szepieniec. Ramstake. Technical report, National Institute of Standards and Technology (2017). https:\/\/csrc.nist.gov\/projects\/post-quantumcryptography\/round-1-submissions"},{"key":"8_CR39","doi-asserted-by":"crossref","unstructured":"Takagi, T.: Fast RSA-type cryptosystem modulo $$p^kq$$. In: Crypto 1998, LNCS, vol. 1462, pp. 318\u2013326 (1998)","DOI":"10.1007\/BFb0055738"},{"key":"8_CR40","unstructured":"Teseleanu, G., Cotan, P.: Small private key attack against a family of RSA-like Cryptosystems, Cryptology ePrint Archive, Paper 2023\/1356 (2023). https:\/\/eprint.iacr.org\/2023\/1356"},{"issue":"1","key":"8_CR41","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s002000100088","volume":"13","author":"B de Weger","year":"2002","unstructured":"de Weger, B.: Cryptanalysis of RSA with small prime difference. Appl. Algebra Eng. Commun. Comput. 13(1), 17\u201328 (2002)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"8_CR42","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":"8_CR43","doi-asserted-by":"crossref","unstructured":"Williams, H. C.: An M3 public-key encryption scheme. In Conference on the Theory and Application of Cryptographic Techniques, pp. 358\u2013368. Springer, Heidelberg (1985)","DOI":"10.1007\/3-540-39799-X_26"},{"key":"8_CR44","unstructured":"Zeugmann, T.: Taking Discrete Roots in the Field $$\\mathbb{Z}_{p}$$ and in the Ring $$\\mathbb{Z}_{p^{e}}$$, Division of Computer Science Report Series A (2019)"}],"container-title":["Lecture Notes in Computer Science","Number-Theoretic Methods in Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82380-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T10:16:37Z","timestamp":1739873797000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82380-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031823794","9783031823800"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82380-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"19 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NuTMiC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Number-Theoretic Methods in Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Szczecin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"24 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"numtmic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nutmic2024.usz.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}