| Title | An Efficient FPGA Implementation of ECC Modular Inversion over F256 |
| Publication Type | Conference Paper |
| Year of Publication | 2018 |
| Authors | Dong, Xiuze, Zhang, Li, Gao, Xianwei |
| Conference Name | Proceedings of the 2Nd International Conference on Cryptography, Security and Privacy |
| Publisher | ACM |
| Conference Location | New York, NY, USA |
| ISBN Number | 978-1-4503-6361-7 |
| Keywords | Elliptic curve cryptography, Extended Euclidean Algorithm, FPGA, Metrics, modular inversion, pubcrawl, Resiliency, Scalability |
| Abstract | Elliptic Curve Cryptography (ECC) provides high security levels with shorter keys than other public-key cryptosystems such as RSA. Usually modular inversion operation is a choke point in realizing the public-key cryptosystem. Based on the Extended Euclidean Algorithm, this work proposes an efficient FPGA implementation of ECC modular inversion over F256. According to this proposed algorithm, one modular inversion requires 320 clock cycles with a maximum clock frequency of 144.011MHz on a Xilinx Virtex-7 FPGA device which gives a computation time of 2.22ms. On the other words, our scenario can perform 450 thousand times division operations in one second approximately. Compared to other available literature, our scheme presented in this paper provides a high performance FPGA implementation of 256-bit modular inversion over F256. This makes the elliptic curve cryptography have important practical value in hardware implementation. |
| URL | http://doi.acm.org/10.1145/3199478.3199491 |
| DOI | 10.1145/3199478.3199491 |
| Citation Key | dong_efficient_2018 |
An Efficient FPGA Implementation of ECC Modular Inversion over F256