20 search results - page 2 / 4 » Factorization of a 512-Bit RSA Modulus |
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
IJNSEC
2008
13 years 5 months ago
2008
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...
EUROCRYPT
2009
Springer
14 years 5 months ago
2009
Springer
We show that a generic ring algorithm for breaking RSA in ZN can be converted into an algorithm for factoring the corresponding RSA-modulus N. Our results imply that any attempt at...
NDSS
1999
IEEE
13 years 9 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...
CHES
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Efficient implementations of RSA on computationally limited devices, such as smartcards, often use the CRT technique in combination with Garner’s algorithm in order to ...