Bit-parallel coprocessor for standard ECC-GF(2m) on FPGA
Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
---|---|
Data(s) |
27/04/2015
27/04/2015
2013
|
Resumo |
This paper presents the design of a high-speed coprocessor for Elliptic Curve Cryptography over binary Galois Field (ECC- GF(2m)). The purpose of our coprocessor is to accelerate the scalar multiplication performed over elliptic curve points represented by affine coordinates in polynomial basis. Our method consists of using elliptic curve parameters over GF(2163) in accordance with international security requirements to implement a bit-parallel coprocessor on field-programmable gate-array (FPGA). Our coprocessor performs modular inversion by using a process based on the Stein's algorithm. Results are presented and compared to results of other related works. We conclude that our coprocessor is suitable for comparing with any other ECC-hardware proposal, since its speed is comparable to projective coordinate designs. |
Formato |
241-262 |
Identificador |
http://www.diogenes.bg/ijam/contents/2013-26-2/10/ International Journal of Applied Mathematics, v. 26, n. 1, p. 241-262, 2013. 1311-1728 http://hdl.handle.net/11449/122754 http://dx.doi.org/10.12732/ijam.v26i2.10 7578944173575239 |
Idioma(s) |
eng |
Relação |
International Journal of Applied Mathematics |
Direitos |
openAccess |
Palavras-Chave | #elliptic curves #GF(2m) #cryptography #bit-parallel #coprocessor #FPGA |
Tipo |
info:eu-repo/semantics/article |