dc.contributor | Universidade Estadual Paulista (Unesp) | |
dc.date.accessioned | 2015-04-27T11:56:00Z | |
dc.date.available | 2015-04-27T11:56:00Z | |
dc.date.created | 2015-04-27T11:56:00Z | |
dc.date.issued | 2013 | |
dc.identifier | International Journal of Applied Mathematics, v. 26, n. 1, p. 241-262, 2013. | |
dc.identifier | 1311-1728 | |
dc.identifier | http://hdl.handle.net/11449/122754 | |
dc.identifier | 10.12732/ijam.v26i2.10 | |
dc.identifier | 7578944173575239 | |
dc.identifier | 2740441033907310 | |
dc.description.abstract | 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. | |
dc.language | eng | |
dc.relation | International Journal of Applied Mathematics | |
dc.rights | Acesso aberto | |
dc.source | Currículo Lattes | |
dc.subject | elliptic curves | |
dc.subject | GF(2m) | |
dc.subject | cryptography | |
dc.subject | bit-parallel | |
dc.subject | coprocessor | |
dc.subject | FPGA | |
dc.title | Bit-parallel coprocessor for standard ECC-GF(2m) on FPGA | |
dc.type | Artículos de revistas | |