D. J. Bernstein, T. P. Birkner, M. Joye, T. Lange, and C. Peters, Twisted Edwards curves, vol.5023, pp.389-405, 2008.

D. J. Bernstein and T. Lange, Faster addition and doubling on elliptic curves, Advances in Cryptology -ASIACRYPT 2007. ASIACRYPT 2007. Lecture Notes in Computer Science, 4833, pp.29-50, 2007.

D. J. Bernstein and T. Lange, Explicit-formulas database, 2007.

D. Boneh, G. Durfee, and N. Howgrave-graham, Factoring N = p r q for large r, Advances in Cryptology â?? CRYPTOâ?? 99. CRYPTO 1999. Lecture Notes in Computer Science, 1666, pp.326-337, 1999.

M. Boudabra and A. Nitaj, A new generalization of the KMOV cryptosystem, Journal of Applied Mathematics and Computing, vol.57, pp.229-245, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02320965

D. M. Bressoud, Factorization and Primality Testing, Undergraduate Texts in Mathematics, 1989th Edition, 1989.

, Compaq Computer Corporation: Cryptography Using Compaq MultiPrime Technology in a Parallel Processing Environment, 2000.

D. Coppersmith, Small solutions to polynomial equations, and low exponent RSA vulnerabilities, Journal of Cryptology, vol.10, issue.4, pp.233-260, 1997.

H. M. Edwards, A normal form for elliptic curves, Bulletin of the American Mathematical Society, vol.44, pp.393-422, 2007.

A. Fujioka, T. Okamoto, S. Miyaguchi, and . Esign, An efficient digital signature implementation for smard cards, Lecture Notes in Computer Science, vol.547, pp.446-457, 1991.

K. Ireland and M. Rosen, A Classical Introduction to Modern Number Theory, 1990.

K. Koyama, K. Maurer, U. M. Okamoto, T. Vanstone, and S. A. , New public-key schemes based on elliptic curves over the ring Zn, Advances in Cryptology -CRYPTO'91, pp.252-266, 1991.

H. Lenstra, Factoring integers with elliptic curves, Annals of Mathematics, vol.126, pp.649-673, 1987.

A. K. Lenstra and H. W. Lenstra, The Development of the Number Field Sieve, 1554.

A. Nitaj and T. Rachidi, New attacks on RSA with moduli N = p r q, Codes, Cryptology, and Information Security. C2SI 2015. Lecture Notes in Computer Science, 9084, pp.352-360, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02320969

T. Okamoto and S. Uchiyama, A New public key cryptosystem as secure as factoring, Lecture Notes in Computer Science, vol.1403, pp.308-318, 1998.

R. Rivest, A. Shamir, and L. Adleman, A Method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1978.

S. Sarkar, Revisiting prime power RSA, Discrete Applied Mathematics, 203 Issue C, pp.127-133, 2016.

S. Schmitt and H. G. Zimmer, Elliptic Curves: A Computational Approach, 2003.

T. Takagi, Fast RSA-type cryptosystem modulo p k q, Advances in Cryptology -CRYPTO'98. CRYPTO, vol.1462, 1998.

L. C. Washington, Elliptic Curves: Number Theory and Cryptography, Second Edition, 2008.