Factorization and Malleability of RSA Moduli, and Counting Points on Elliptic Curves Modulo <i>N</i>
In this paper we address two different problems related with the factorization of an RSA (Rivest–Shamir–Adleman cryptosystem) modulus <i>N</i>. First we show that factoring is equivalent, in deterministic polynomial time, to counting points on a pair of twisted Elliptic curves modulo <i>N</i>. The s...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
MDPI AG
2020-11-01
|
| Collection: | Mathematics |
| Sujets: | |
| Accès en ligne: | https://www.mdpi.com/2227-7390/8/12/2126 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|