在GF(p)上实现高速标量乘法

Yufei Xing, Shuguo Li
{"title":"在GF(p)上实现高速标量乘法","authors":"Yufei Xing, Shuguo Li","doi":"10.1109/EDSSC.2017.8126445","DOIUrl":null,"url":null,"abstract":"Elliptic curve cryptography(ECC) has gained tremendous popularity and the selection of coordinate systems has a significant impact on basic point doubling and point addition operations. In this paper, we investigate into the best suited coordinate systems corresponding to scalar multiplication with a fixed point as well as with an unfixed point and give out implementation schemes in both cases. Besides, we look into parameter selection involved in both schemes, which impacts both the speed of scalar multiplication and storage requirement.","PeriodicalId":163598,"journal":{"name":"2017 International Conference on Electron Devices and Solid-State Circuits (EDSSC)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Towards high speed scalar multiplication over GF(p)\",\"authors\":\"Yufei Xing, Shuguo Li\",\"doi\":\"10.1109/EDSSC.2017.8126445\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Elliptic curve cryptography(ECC) has gained tremendous popularity and the selection of coordinate systems has a significant impact on basic point doubling and point addition operations. In this paper, we investigate into the best suited coordinate systems corresponding to scalar multiplication with a fixed point as well as with an unfixed point and give out implementation schemes in both cases. Besides, we look into parameter selection involved in both schemes, which impacts both the speed of scalar multiplication and storage requirement.\",\"PeriodicalId\":163598,\"journal\":{\"name\":\"2017 International Conference on Electron Devices and Solid-State Circuits (EDSSC)\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Electron Devices and Solid-State Circuits (EDSSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDSSC.2017.8126445\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Electron Devices and Solid-State Circuits (EDSSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDSSC.2017.8126445","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

椭圆曲线密码学(ECC)得到了广泛的应用,其坐标系统的选择对基本的点加倍和点相加运算有着重要的影响。本文研究了定点和不定点标量乘法对应的最适合坐标系,并给出了两种情况下的实现方案。此外,我们还研究了两种方案中所涉及的参数选择,这对标量乘法的速度和存储需求都有影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Towards high speed scalar multiplication over GF(p)
Elliptic curve cryptography(ECC) has gained tremendous popularity and the selection of coordinate systems has a significant impact on basic point doubling and point addition operations. In this paper, we investigate into the best suited coordinate systems corresponding to scalar multiplication with a fixed point as well as with an unfixed point and give out implementation schemes in both cases. Besides, we look into parameter selection involved in both schemes, which impacts both the speed of scalar multiplication and storage requirement.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信