3 search results - page 1 / 1 » On Splitting a Point with Summation Polynomials in Binary El... |
EUROCRYPT
2012
Springer
11 years 6 months ago
2012
Springer
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
COMSWARE
2007
IEEE
13 years 10 months ago
2007
IEEE
The Elliptic Curve Digital Signature Algorithm admits a natural parallelization wherein the point multiplication step can be split in two parts and executed in parallel. Further pa...
JUCS
2008
13 years 4 months ago
2008
We present an algorithm that by using the and -1 Frobenius operators concurrently allows us to obtain a parallelized version of the classical -and-add scalar multiplication algor...