25 search results - page 2 / 5 » A variant of Wiener's attack on RSA |
ACNS
2007
Springer
13 years 11 months ago
2007
Springer
In the RSA system, balanced modulus N denotes a product of two large prime numbers p and q, where q < p < 2q. Since IntegerFactorization is difficult, p and q are simply esti...
AFRICACRYPT
2008
Springer
13 years 11 months ago
2008
Springer
PKC
2004
Springer
13 years 10 months ago
2004
Springer
AAECC
2004
Springer
13 years 5 months ago
2004
Springer
Abstract. We investigate the security of a variant of the RSA public-key cryptosystem called LSBS-RSA, in which the modulus primes share a large number of least-significant bits.We...
PKC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...