Factorization and Malleability of RSA Moduli, and Counting Points on Elliptic Curves Modulo <i>N</i>

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 <...

Ful tanımlama

Detaylı Bibliyografya
Asıl Yazarlar: Luis V. Dieulefait, Jorge Urroz
Materyal Türü: Makale
Dil:English
Baskı/Yayın Bilgisi: MDPI AG 2020-11-01
Seri Bilgileri:Mathematics
Konular:
factorization
malleability
elliptic curves
coppersmith algorithm
Online Erişim:https://www.mdpi.com/2227-7390/8/12/2126

Internet

https://www.mdpi.com/2227-7390/8/12/2126

Benzer Materyaller