Massively parallel elliptic curve factoring
Dixon, B.; Lenstra, Arjen K.
1993

Files

Abstract

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

Details

Title Massively parallel elliptic curve factoring
Author(s) Dixon, B. ; Lenstra, Arjen K.
Published in Advances in Cryptology - EUROCRYPT '92
Series Lecture Notes in Computer Science, 656
Pages 183-193
Conference Advances in Cryptology - EUROCRYPT '92. Workshop on the Theory and Applications of Cryptographic Techniques, Balatonfüred, Hungary, May 24–28, 1992
Date 1993
Publisher Berlin, Germany, Springer
Keywords
DOI https://doi.org/10.1007/3-540-47555-9_16
Laboratories LACAL
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LACAL - Laboratory for cryptologic algorithms
Peer-reviewed publications
Work outside EPFL
Conference Papers
Published
Record creation date 2010-06-24

Actions

Preview