Bit-parallel coprocessor for standard ECC-GF(2m) on FPGA
Autor(a) principal: | |
---|---|
Data de Publicação: | 2013 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://www.diogenes.bg/ijam/contents/2013-26-2/10/ http://hdl.handle.net/11449/122754 |
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. |
id |
UNSP_7b01a68a322dec093ae03536096cd601 |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/122754 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Bit-parallel coprocessor for standard ECC-GF(2m) on FPGAelliptic curvesGF(2m)cryptographybit-parallelcoprocessorFPGAThis 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.Universidade Estadual Paulista Júlio de Mesquita Filho, Instituto de Biociências Letras e Ciências Exatas de São José do Rio Preto, Sao Jose do Rio Preto, Rua Cristóvão Colombo, 2265, Jardim Nazareth, CEP 15054-000, SP, BrasilUniversidade Estadual Paulista Júlio de Mesquita Filho, Instituto de Biociências Letras e Ciências Exatas de São José do Rio Preto, Sao Jose do Rio Preto, Rua Cristóvão Colombo, 2265, Jardim Nazareth, CEP 15054-000, SP, BrasilDepartment of Mathematics and Computation School of Science and Technology São Paulo State University (UNESP) Roberto Simonsen street, 305 Presidente Prudente, SP, 19060-900, BRAZILDepartment of Computer Engineering and Industrial Automation School of Electrical and Computer Engineering State University of Campinas (UNICAMP) Av. Albert Einstein, 400, Cid. Universitária Zeferino Vaz Distrito Barão Geraldo, Campinas, SP, 13083-852, BRAZILElectronics Department University Alcala DO-217. Polytechnic School Ctra. Madrid - Barcelona km. 33.6 Alcalá de Henares, Madrid, 28871, SPAINUniversidade Estadual Paulista (Unesp)Dias, Maurício AraújoGouveia, Márcio Ricardo Alves [UNESP]Oliveira, José Raimundo deMuñoz, Ignacio Bravo2015-04-27T11:56:00Z2015-04-27T11:56:00Z2013info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article241-262http://www.diogenes.bg/ijam/contents/2013-26-2/10/International Journal of Applied Mathematics, v. 26, n. 1, p. 241-262, 2013.1311-1728http://hdl.handle.net/11449/12275410.12732/ijam.v26i2.1075789441735752392740441033907310Currículo Lattesreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengInternational Journal of Applied Mathematicsinfo:eu-repo/semantics/openAccess2021-10-23T21:56:37Zoai:repositorio.unesp.br:11449/122754Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T20:05:46.623807Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Bit-parallel coprocessor for standard ECC-GF(2m) on FPGA |
title |
Bit-parallel coprocessor for standard ECC-GF(2m) on FPGA |
spellingShingle |
Bit-parallel coprocessor for standard ECC-GF(2m) on FPGA Dias, Maurício Araújo elliptic curves GF(2m) cryptography bit-parallel coprocessor FPGA |
title_short |
Bit-parallel coprocessor for standard ECC-GF(2m) on FPGA |
title_full |
Bit-parallel coprocessor for standard ECC-GF(2m) on FPGA |
title_fullStr |
Bit-parallel coprocessor for standard ECC-GF(2m) on FPGA |
title_full_unstemmed |
Bit-parallel coprocessor for standard ECC-GF(2m) on FPGA |
title_sort |
Bit-parallel coprocessor for standard ECC-GF(2m) on FPGA |
author |
Dias, Maurício Araújo |
author_facet |
Dias, Maurício Araújo Gouveia, Márcio Ricardo Alves [UNESP] Oliveira, José Raimundo de Muñoz, Ignacio Bravo |
author_role |
author |
author2 |
Gouveia, Márcio Ricardo Alves [UNESP] Oliveira, José Raimundo de Muñoz, Ignacio Bravo |
author2_role |
author author author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (Unesp) |
dc.contributor.author.fl_str_mv |
Dias, Maurício Araújo Gouveia, Márcio Ricardo Alves [UNESP] Oliveira, José Raimundo de Muñoz, Ignacio Bravo |
dc.subject.por.fl_str_mv |
elliptic curves GF(2m) cryptography bit-parallel coprocessor FPGA |
topic |
elliptic curves GF(2m) cryptography bit-parallel coprocessor FPGA |
description |
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. |
publishDate |
2013 |
dc.date.none.fl_str_mv |
2013 2015-04-27T11:56:00Z 2015-04-27T11:56:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
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 10.12732/ijam.v26i2.10 7578944173575239 2740441033907310 |
url |
http://www.diogenes.bg/ijam/contents/2013-26-2/10/ http://hdl.handle.net/11449/122754 |
identifier_str_mv |
International Journal of Applied Mathematics, v. 26, n. 1, p. 241-262, 2013. 1311-1728 10.12732/ijam.v26i2.10 7578944173575239 2740441033907310 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
International Journal of Applied Mathematics |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
241-262 |
dc.source.none.fl_str_mv |
Currículo Lattes reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1808129159222788096 |