论文信息 - Massively Parallel Elliptic Curve Factorin - 字舞流文

Massively Parallel Elliptic Curve Factorin

We describe our massively parallel implementations of the elliptic curve factoring method. One of our implementations is based on a new systolic version of Montgomery multiplication.

Arjen K. Lenstra | Brandon Dixon

[1] Arjen K. Lenstra,et al. Systolic Montgomery multiplication , 1992 .

[2] Ueli Maurer,et al. Non-interactive Public-Key Cryptography , 1991, EUROCRYPT.

[3] Robert D. Silverman,et al. A practical analysis of the elliptic curve factoring algorithm , 1993 .

[4] G. Marsaglia,et al. A New Class of Random Number Generators , 1991 .

[5] J. L. Selfridge,et al. Factorizations of b[n]±1, b=2, 3, 5, 6, 7, 10, 11, 12 up to high powers , 1985 .

[6] H. W. Lenstra,et al. Factoring integers with elliptic curves , 1987 .

[7] Arjen K. Lenstra,et al. Factoring by Electronic Mail , 1990, EUROCRYPT.

[8] P. L. Montgomery. Modular multiplication without trial division , 1985 .

[9] P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization , 1987 .