保护数字签名算法免受侧信道攻击

Mohamed Hassan, A. Abo-Taleb, M. Shalaby
{"title":"保护数字签名算法免受侧信道攻击","authors":"Mohamed Hassan, A. Abo-Taleb, M. Shalaby","doi":"10.1145/3394941.3394947","DOIUrl":null,"url":null,"abstract":"Many software implementations for the schemes used for public key cryptosystems, of which elliptic curve cryptography is the most powerful, has been concerned with performance and efficiency. However, the advent of side channel attacks with their diverse categories, such as timing, fault and power analysis attacks, impose us to reconsider new strategies in implementing more secured elliptic curve algorithms to thwart any information leakage that leads to break the security of these algorithms. In this paper, we propose a new optimization on the algorithmic level for computing the arithmetic of elliptic curve point over prime fields to countermeasure side channel attacks that threaten elliptic curve cryptosystems. Indeed, these attacks present nowadays a realistic threat to cryptographic applications and have been proved to be very effective against most cryptosystems. To develop a digital signature algorithm that targets performance and security against side channel attacks, we built a library for the underlying prime fields arithmetic for the common fields specialized by NIST and SECG. Our work can be employed in numerous applications such as, E-health, E-banking, E-commerce and E-governance.","PeriodicalId":143754,"journal":{"name":"Proceedings of the 2020 International Conference on Industrial Engineering and Industrial Management","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Securing Digital Signature Algorithm against Side Channel Attacks\",\"authors\":\"Mohamed Hassan, A. Abo-Taleb, M. Shalaby\",\"doi\":\"10.1145/3394941.3394947\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many software implementations for the schemes used for public key cryptosystems, of which elliptic curve cryptography is the most powerful, has been concerned with performance and efficiency. However, the advent of side channel attacks with their diverse categories, such as timing, fault and power analysis attacks, impose us to reconsider new strategies in implementing more secured elliptic curve algorithms to thwart any information leakage that leads to break the security of these algorithms. In this paper, we propose a new optimization on the algorithmic level for computing the arithmetic of elliptic curve point over prime fields to countermeasure side channel attacks that threaten elliptic curve cryptosystems. Indeed, these attacks present nowadays a realistic threat to cryptographic applications and have been proved to be very effective against most cryptosystems. To develop a digital signature algorithm that targets performance and security against side channel attacks, we built a library for the underlying prime fields arithmetic for the common fields specialized by NIST and SECG. Our work can be employed in numerous applications such as, E-health, E-banking, E-commerce and E-governance.\",\"PeriodicalId\":143754,\"journal\":{\"name\":\"Proceedings of the 2020 International Conference on Industrial Engineering and Industrial Management\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2020 International Conference on Industrial Engineering and Industrial Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3394941.3394947\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 International Conference on Industrial Engineering and Industrial Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3394941.3394947","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

许多用于公钥密码体制的软件实现都关注于性能和效率,其中椭圆曲线密码体制是最强大的。然而,随着各种类型的侧信道攻击的出现,如定时攻击、故障攻击和功率分析攻击,我们不得不重新考虑新的策略,以实现更安全的椭圆曲线算法,以阻止任何导致这些算法安全性被破坏的信息泄露。本文在算法层面上提出了一种新的优化算法,用于计算素域上椭圆曲线点的算法,以对抗威胁椭圆曲线密码系统的侧信道攻击。事实上,这些攻击现在对加密应用程序构成了现实的威胁,并且已被证明对大多数密码系统都非常有效。为了开发一种针对侧信道攻击的性能和安全性的数字签名算法,我们为NIST和SECG专门用于公共字段的底层基本字段算法构建了一个库。我们的工作可以应用于电子医疗、电子银行、电子商务和电子政务等众多应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Securing Digital Signature Algorithm against Side Channel Attacks
Many software implementations for the schemes used for public key cryptosystems, of which elliptic curve cryptography is the most powerful, has been concerned with performance and efficiency. However, the advent of side channel attacks with their diverse categories, such as timing, fault and power analysis attacks, impose us to reconsider new strategies in implementing more secured elliptic curve algorithms to thwart any information leakage that leads to break the security of these algorithms. In this paper, we propose a new optimization on the algorithmic level for computing the arithmetic of elliptic curve point over prime fields to countermeasure side channel attacks that threaten elliptic curve cryptosystems. Indeed, these attacks present nowadays a realistic threat to cryptographic applications and have been proved to be very effective against most cryptosystems. To develop a digital signature algorithm that targets performance and security against side channel attacks, we built a library for the underlying prime fields arithmetic for the common fields specialized by NIST and SECG. Our work can be employed in numerous applications such as, E-health, E-banking, E-commerce and E-governance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信