{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:58:19Z","timestamp":1786982299110,"version":"build-2736575974"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T00:00:00Z","timestamp":1554508800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s12190-019-01257-y","type":"journal-article","created":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T21:11:36Z","timestamp":1554585096000},"page":"431-450","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A new public key cryptosystem based on Edwards curves"],"prefix":"10.1007","volume":"61","author":[{"given":"Maher","family":"Boudabra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0372-1757","authenticated-orcid":false,"given":"Abderrahmane","family":"Nitaj","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"1257_CR1","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Birkner, T.P., Joye, M., Lange, T., Peters, C.: Twisted Edwards curves. In: Vaudenay, S. (ed.) AFRICACRYPT 2008, Springer Lecture Notes in Computer Science, vol. 5023, pp. 389\u2013405. Springer (2008)","DOI":"10.1007\/978-3-540-68164-9_26"},{"key":"1257_CR2","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Kurosawa, K. (eds.) Advances in Cryptology-ASIACRYPT 2007. ASIACRYPT 2007. Lecture Notes in Computer Science, vol. 4833, pp. 29\u201350. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-76900-2_3"},{"key":"1257_CR3","unstructured":"Bernstein, D.J., Lange, T.: Explicit-formulas database. \n                    http:\/\/hyperelliptic.org\/EFD.Citationsinthisdocument\n                    \n                   (2007)"},{"key":"1257_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Durfee, G., Howgrave-Graham, N.: Factoring \n                    \n                      \n                    \n                    $$N = p^rq$$\n                    \n                      \n                        \n                          N\n                          =\n                          \n                            p\n                            r\n                          \n                          q\n                        \n                      \n                    \n                   for large \n                    \n                      \n                    \n                    $$r$$\n                    \n                      \n                        r\n                      \n                    \n                  . In: Wiener, M. (eds.) Advances in Cryptology-CRYPTO\u2019 99. CRYPTO 1999. Lecture Notes in Computer Science, vol. 1666, pp. 326\u2013337. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48405-1_21"},{"issue":"1\u20132","key":"1257_CR5","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":"1257_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4544-5","volume-title":"Factorization and Primality Testing, Undergraduate Texts in Mathematics","author":"DM Bressoud","year":"1989","unstructured":"Bressoud, D.M.: Factorization and Primality Testing, Undergraduate Texts in Mathematics, 1989th edn. Springer, Berlin (1989)","edition":"1989"},{"key":"1257_CR7","unstructured":"Compaq Computer Corporation: Cryptography Using Compaq MultiPrime Technology in a Parallel Processing Environment (2000). \n                    http:\/\/cwcyrix.duckdns.org\/ftp-archives\/ftp.compaq.com\/pub\/solutions\/CompaqMultiPrimeWP.pdf"},{"issue":"4","key":"1257_CR8","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":"1257_CR9","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1090\/S0273-0979-07-01153-6","volume":"44","author":"HM Edwards","year":"2007","unstructured":"Edwards, H.M.: A normal form for elliptic curves. Bull. Am. Math. Soc. 44, 393\u2013422 (2007)","journal-title":"Bull. Am. Math. Soc."},{"key":"1257_CR10","doi-asserted-by":"crossref","unstructured":"Fujioka, A., Okamoto, T., Miyaguchi, S.: ESIGN: an efficient digital signature implementation for smard cards. In: EUROCRYPT 1991, Lecture Notes in Computer Science, vol. 547, pp. 446\u2013457 (1991)","DOI":"10.1007\/3-540-46416-6_38"},{"key":"1257_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2103-4","volume-title":"A Classical Introduction to Modern Number Theory","author":"K Ireland","year":"1990","unstructured":"Ireland, K., Rosen, M.: A Classical Introduction to Modern Number Theory. Springer, Berlin (1990)"},{"key":"1257_CR12","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 \n                    \n                      \n                    \n                    $${\\mathbb{Z}}_n$$\n                    \n                      \n                        \n                          Z\n                          n\n                        \n                      \n                    \n                  . In: Advances in Cryptology-CRYPTO\u201991, Lecture Notes in Computer Science, pp. 252\u2013266. Springer (1991)","DOI":"10.1007\/3-540-46766-1_20"},{"key":"1257_CR13","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H Lenstra","year":"1987","unstructured":"Lenstra, H.: Factoring integers with elliptic curves. Ann. Math. 126, 649\u2013673 (1987)","journal-title":"Ann. Math."},{"key":"1257_CR14","series-title":"Lecture Notes in Mathematics","volume-title":"The development of the number field sieve","year":"1993","unstructured":"Lenstra, A.K., Lenstra Jr., H.W. (eds.): The Development of the Number Field Sieve. Lecture Notes in Mathematics, vol. 1554. Springer, Berlin (1993)"},{"key":"1257_CR15","doi-asserted-by":"crossref","unstructured":"Nitaj, A., Rachidi, T.: New attacks on RSA with moduli \n                    \n                      \n                    \n                    $$N=p^{r}q$$\n                    \n                      \n                        \n                          N\n                          =\n                          \n                            p\n                            r\n                          \n                          q\n                        \n                      \n                    \n                  . In: El Hajji, S., Nitaj, A., Carlet, C., Souidi, E. (eds.) Codes, Cryptology, and Information Security. C2SI 2015. Lecture Notes in Computer Science, vol. 9084, pp. 352\u2013360. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-18681-8_28"},{"key":"1257_CR16","first-page":"308","volume-title":"Lecture Notes in Computer Science","author":"Tatsuaki Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A new public key cryptosystem as secure as factoring. In: EUROCRYPT 1998, Lecture Notes in Computer Science, vol. 1403, pp. 308\u2013318 (1998)"},{"issue":"2","key":"1257_CR17","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"},{"issue":"C","key":"1257_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.dam.2015.10.003","volume":"203","author":"S Sarkar","year":"2016","unstructured":"Sarkar, S.: Revisiting prime power RSA. Discrete Appl. Math. 203(C), 127\u2013133 (2016)","journal-title":"Discrete Appl. Math."},{"key":"1257_CR19","volume-title":"Elliptic Curves: A Computational Approach","author":"S Schmitt","year":"2003","unstructured":"Schmitt, S., Zimmer, H.G.: Elliptic Curves: A Computational Approach. Walter de Gruyter, Berlin (2003)"},{"key":"1257_CR20","doi-asserted-by":"crossref","unstructured":"Takagi, T.: Fast RSA-type cryptosystem modulo \n                    \n                      \n                    \n                    $$p^kq$$\n                    \n                      \n                        \n                          \n                            p\n                            k\n                          \n                          q\n                        \n                      \n                    \n                  . In: Krawczyk, H. (eds) Advances in Cryptology-CRYPTO\u201998. CRYPTO 1998. Lecture Notes in Computer Science, vol. 1462. Springer, Berlin (1998)","DOI":"10.1007\/BFb0055738"},{"key":"1257_CR21","doi-asserted-by":"publisher","DOI":"10.1201\/9781420071474","volume-title":"Elliptic Curves: Number Theory and Cryptography","author":"LC Washington","year":"2008","unstructured":"Washington, L.C.: Elliptic Curves: Number Theory and Cryptography, 2nd edn. CRC Press, Taylor & Francis Group, London (2008)","edition":"2"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-019-01257-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12190-019-01257-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-019-01257-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T19:24:17Z","timestamp":1586028257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12190-019-01257-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,6]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["1257"],"URL":"https:\/\/doi.org\/10.1007\/s12190-019-01257-y","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,6]]},"assertion":[{"value":"26 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}