A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA
[chapter]
Lecture Notes in Computer Science
In this last decade, Elliptic Curve Cryptography (ECC) has gained increasing acceptance in the industry and the academic community and has been the subject of several standards. This interest is mainly due to the high level of security with relatively small keys provided by ECC. Indeed, no sub-exponential algorithms are known to solve the underlying hard problem: the Elliptic Curve Discrete Logarithm. The aim of this work is to explore the possibilities of dedicated hardware implementing the
doi:10.1007/978-3-540-74735-2_26
fatcat:yzgvk7kc35flbnel7rw6h7yxnu