Massively parallel elliptic curve factoring

  • Authors:
  • B. Dixon;A. K. Lenstra

  • Affiliations:
  • Department of Computer Science, Princeton University, Princeton, NJ;Bellcore, Morristown, NJ

  • Venue:
  • EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

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.