具有可配置字长ECC算法加速器的高效节能fpga软核处理器

Aiko Iwasaki, Yuichiro Shibata, K. Oguri, Ryuichi Harasawa
{"title":"具有可配置字长ECC算法加速器的高效节能fpga软核处理器","authors":"Aiko Iwasaki, Yuichiro Shibata, K. Oguri, Ryuichi Harasawa","doi":"10.1109/CoolChips.2015.7158664","DOIUrl":null,"url":null,"abstract":"This paper proposes an FPGA-based soft core processor architecture equipped with a configurable accelerator to speed up GF(2m) arithmetic for elliptic curve cryptography (ECC) systems. Focusing on the fact the number of operations required for GF(2m) arithmetic is influenced by the relationship between the irreducible polynomial and the machine word size, we propose an approach where the word size of the accelerator is tailored to a given irreducible polynomial. The evaluation results reveal that the performance and the energy efficiency of GF(2m) multiplication including reduction can be improved by up to 6.67 times and 5.24 times, respectively.","PeriodicalId":358999,"journal":{"name":"2015 IEEE Symposium in Low-Power and High-Speed Chips (COOL CHIPS XVIII)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An energy-efficient FPGA-based soft-core processor with a configurable word size ECC arithmetic accelerator\",\"authors\":\"Aiko Iwasaki, Yuichiro Shibata, K. Oguri, Ryuichi Harasawa\",\"doi\":\"10.1109/CoolChips.2015.7158664\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an FPGA-based soft core processor architecture equipped with a configurable accelerator to speed up GF(2m) arithmetic for elliptic curve cryptography (ECC) systems. Focusing on the fact the number of operations required for GF(2m) arithmetic is influenced by the relationship between the irreducible polynomial and the machine word size, we propose an approach where the word size of the accelerator is tailored to a given irreducible polynomial. The evaluation results reveal that the performance and the energy efficiency of GF(2m) multiplication including reduction can be improved by up to 6.67 times and 5.24 times, respectively.\",\"PeriodicalId\":358999,\"journal\":{\"name\":\"2015 IEEE Symposium in Low-Power and High-Speed Chips (COOL CHIPS XVIII)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Symposium in Low-Power and High-Speed Chips (COOL CHIPS XVIII)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CoolChips.2015.7158664\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Symposium in Low-Power and High-Speed Chips (COOL CHIPS XVIII)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CoolChips.2015.7158664","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文提出了一种基于fpga的软核处理器体系结构,并配备了可配置的加速器来加速椭圆曲线密码(ECC)系统的GF(2m)算法。考虑到GF(2m)算法所需的运算次数受到不可约多项式和机器字长之间关系的影响,我们提出了一种针对给定不可约多项式定制加速器字长的方法。评价结果表明,GF(2m)乘法(含减量)的性能和能效分别可提高6.67倍和5.24倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An energy-efficient FPGA-based soft-core processor with a configurable word size ECC arithmetic accelerator
This paper proposes an FPGA-based soft core processor architecture equipped with a configurable accelerator to speed up GF(2m) arithmetic for elliptic curve cryptography (ECC) systems. Focusing on the fact the number of operations required for GF(2m) arithmetic is influenced by the relationship between the irreducible polynomial and the machine word size, we propose an approach where the word size of the accelerator is tailored to a given irreducible polynomial. The evaluation results reveal that the performance and the energy efficiency of GF(2m) multiplication including reduction can be improved by up to 6.67 times and 5.24 times, respectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信