Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA

@inproceedings{Dormale2007CollisionSF,
  title={Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA},
  author={Guerric Meurice de Dormale and Philippe Bulens and Jean-Jacques Quisquater},
  booktitle={CHES},
  year={2007}
}
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… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS