Conference ProceedingsOPEN ACCESS

Massively parallel elliptic curve factoring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 658 LNCS 183-193
DOI: 10.1007/3-540-47555-9_16
18Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Dixon, B., & Lenstra, A. K. (1993). Massively parallel elliptic curve factoring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 658 LNCS, pp. 183–193). Springer Verlag. https://doi.org/10.1007/3-540-47555-9_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free