Optimal implementation of elliptic curve cryptography

Hongqiang Lv, Hui Li, Junkai Yi, Hao Lu
{"title":"Optimal implementation of elliptic curve cryptography","authors":"Hongqiang Lv, Hui Li, Junkai Yi, Hao Lu","doi":"10.1109/SOLI.2013.6611377","DOIUrl":null,"url":null,"abstract":"The most time-consuming operation in the Elliptic Curve Cryptography (ECC) calculation is scalar multiplication. Scalar multiplication plays a major role in ECC. Currently, there are several optimization algorithms for point scalar multiplication which have either high computational complexity or additional storage requirement. They are all unsuitable for further applying. In this paper, we present a new compatible optimal algorithm which improves the efficiency by generating a special random number k as the scalar. The experimental results show that the processes of encryption and decryption have been speed up significantly in the same condition.","PeriodicalId":147180,"journal":{"name":"Proceedings of 2013 IEEE International Conference on Service Operations and Logistics, and Informatics","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 2013 IEEE International Conference on Service Operations and Logistics, and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOLI.2013.6611377","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The most time-consuming operation in the Elliptic Curve Cryptography (ECC) calculation is scalar multiplication. Scalar multiplication plays a major role in ECC. Currently, there are several optimization algorithms for point scalar multiplication which have either high computational complexity or additional storage requirement. They are all unsuitable for further applying. In this paper, we present a new compatible optimal algorithm which improves the efficiency by generating a special random number k as the scalar. The experimental results show that the processes of encryption and decryption have been speed up significantly in the same condition.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
椭圆曲线密码的最佳实现
在椭圆曲线密码(ECC)计算中,最耗时的运算是标量乘法。标量乘法在ECC中起着重要的作用。目前,点标量乘法的优化算法要么计算量大,要么需要额外的存储空间。他们都不适合进一步申请。本文提出了一种新的兼容优化算法,该算法通过生成一个特殊的随机数k作为标量来提高效率。实验结果表明,在相同的条件下,加密和解密的速度明显加快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An empirical study of applying Kano model and TRIZ business evolution trends to improve E-commerce service quality Value capture and value creation in high-velocity networked environments Research on personnel assignment in joint operation analysis with a large number of tasks Empirical analysis on operational efficiency and its influential factors of road transportation industry of China Study on revenue sharing contract mechanism in supply chain under non-cooperative decision-making
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1