Massively parallel elliptic curve factoring

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


Published in:
Advances in Cryptology - EUROCRYPT '92. Workshop on the Theory and Applications of Cryptographic Techniques. Proceedings, 183 - 93
Presented at:
Advances in Cryptology - EUROCRYPT '92. Workshop on the Theory and Applications of Cryptographic Techniques. Proceedings, Berlin, Germany
Year:
1993
Keywords:
Laboratories:




 Record created 2010-06-24, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)