237 search results - page 9 / 48 » MapReduce for Integer Factorization |
ASIACRYPT
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides s...
LATINCRYPT
2010
13 years 7 months ago
2010
This paper improves the price-performance ratio of ECM, the elliptic-curve method of integer factorization. In particular, this paper constructs "a = -1" twisted Edwards ...
CHES
2007
Springer
14 years 4 months ago
2007
Springer
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
EUROCRYPT
2005
Springer
14 years 3 months ago
2005
Springer
We present a new and flexible formulation of Coppersmith’s method for finding small solutions of bivariate polynomials p(x, y) over the integers. Our approach allows to maximiz...
TIP
2002
13 years 9 months ago
2002
Abstract--This paper deals with the design and implementation of an image transform coding algorithm based on the integer wavelet transform (IWT). First of all, criteria are propos...