257 search results - page 2 / 52 » On the Security of RSA Screening |
PKC
2005
Springer
13 years 11 months ago
2005
Springer
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...
ACISP
2010
Springer
13 years 8 months ago
2010
Springer
ASIACRYPT
2006
Springer
13 years 10 months ago
2006
Springer
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...
EUROCRYPT
2001
Springer
13 years 10 months ago
2001
Springer
We propose a threshold RSA scheme which is as efficient as the fastest previous threshold RSA scheme (by Shoup), but where two assumptions needed in Shoup’s and in previous schem...
NDSS
1999
IEEE
13 years 10 months ago
1999
IEEE
We describe an implementation of a distributed algorithm to generate a shared RSA key. At the end of the computation, an RSA modulus N = pq is publicly known. All servers involved...