dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2015-04-27T11:56:00Z
dc.date.available2015-04-27T11:56:00Z
dc.date.created2015-04-27T11:56:00Z
dc.date.issued2013
dc.identifierInternational Journal of Applied Mathematics, v. 26, n. 1, p. 241-262, 2013.
dc.identifier1311-1728
dc.identifierhttp://hdl.handle.net/11449/122754
dc.identifier10.12732/ijam.v26i2.10
dc.identifier7578944173575239
dc.identifier2740441033907310
dc.description.abstractThis 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.languageeng
dc.relationInternational Journal of Applied Mathematics
dc.rightsAcesso aberto
dc.sourceCurrículo Lattes
dc.subjectelliptic curves
dc.subjectGF(2m)
dc.subjectcryptography
dc.subjectbit-parallel
dc.subjectcoprocessor
dc.subjectFPGA
dc.titleBit-parallel coprocessor for standard ECC-GF(2m) on FPGA
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución