Elliptic Curve Cryptography on FPGA for Low-Power Applications

@article{Keller2009EllipticCC,
  title={Elliptic Curve Cryptography on FPGA for Low-Power Applications},
  author={Maurice Keller and Andrew Byrne and William P. Marnane},
  journal={TRETS},
  year={2009},
  volume={2},
  pages={2:1-2:20}
}
Elliptic curve cryptography has generated a lot of research interest due to its ability to provide greater security per bit compared to public key systems such as RSA. The designer of an elliptic curve hardware accelerator is faced with many choices at design time, each of which can impact the performance of the accelerator in different ways. There are many examples in the literature of how these design choices can effect the area and/or speed of an elliptic curve hardware accelerator. The… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

Comparative analysis of flexible cryptographic implementations

2016 11th International Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC) • 2016
View 6 Excerpts
Highly Influenced

The design space of ultra-low energy asymmetric cryptography

2014 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS) • 2014
View 2 Excerpts

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Optimised Montgomery domain inversion on FPGA

Proceedings of the 2005 European Conference on Circuit Theory and Design, 2005. • 2005
View 5 Excerpts
Highly Influenced

Recommended elliptic curves for federal government use

NIST.
National Institute of Standards and Technology. NIST Special Publication. • 1999
View 5 Excerpts
Highly Influenced

Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS’07)

S. KUMAR, T. WOLLINGER, C. PAAR
Lecture Notes in Computer Science, • 2006
View 3 Excerpts
Highly Influenced

IEEE standard specifications for public-key cryptography

IEEE.
IEEE Std 1363-2000. ITOH, T. AND TSUJII, S. 1988. A fast algorithm for computing multiplicative inverses in G F(2) using normal bases. Inform. Comput. 78, 171–177. • 2000
View 3 Excerpts
Highly Influenced

Finite fields for Computer Scientists and Engineers [Book Review]

IEEE Transactions on Information Theory • 1993
View 3 Excerpts
Highly Influenced

Modular multiplication without trial division

P. L. MONTGOMERY
Math. Comput. 44, 519–521. • 1985
View 2 Excerpts
Highly Influenced