{"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}
引用次数: 2
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
