22 search results - page 1 / 5 » Factorization of a 768-Bit RSA Modulus |
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
CCS
1998
ACM
13 years 9 months ago
1998
ACM
This paper describes a new public-key cryptosystem based on the hardness of computing higher residues modulo a composite RSA integer. We introduce two versions of our scheme, one d...
ASIACRYPT
2003
Springer
13 years 10 months ago
2003
Springer
We estimate the yield of the number field sieve factoring algorithm when applied to the 1024-bit composite integer RSA-1024 and the parameters as proposed in the draft version [17...
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
2010
Springer
13 years 10 months ago
2010
Springer