Fatoração de números inteiros usando curvas elíticas

AUTOR(ES)
DATA DE PUBLICAÇÃO

2003

RESUMO

The Integer Factoring Problem has obtained considerable attention for its utilization in modern cryptographic systems which have its security based on the difficulty of factoring large numbers. In this work, we present the description of a method for integer factorization, the Elliptic Curve Method - ECM, invented by H. W. Lenstra [Len87], which uses elliptic curves. It is based on another method for integer factorization, the Pollard p − 1 method [Pol74]. The Pollard p − 1 method uses the structure of the multiplicative group Z*p, while the Elliptic Curve Method uses the group structure of the points of an elliptic curve.

ASSUNTO(S)

elliptic curves fatoração factorization ciencia da computacao curvas elíticas

Documentos Relacionados