一种新的扩展的RSA故障分析方法

Caisen Chen, Tao Wang
{"title":"一种新的扩展的RSA故障分析方法","authors":"Caisen Chen, Tao Wang","doi":"10.1145/1966913.1966980","DOIUrl":null,"url":null,"abstract":"As the preceding fault analysis on RSA Square-and-Multiple implementation which is based on modifying the public modulus N, is difficult to be executed in practice. This paper proposes a new method to execute fault analysis by regulating the voltage supply of the system to inject transient faults into multiplication operation instead of modifying the modulus N. In order to improve the feasibility of attack, we suggest an extension of fault analysis with recovering the key segment by segment instead of bit by bit. In the end, the complexity of the algorithm is analyzed. The expansibility and feasibility of algorithm are proved by demonstrating in theory and simulation experiments. The results of experiment show that the new fault analysis algorithm is more effective in practice.","PeriodicalId":72308,"journal":{"name":"Asia CCS '22 : proceedings of the 2022 ACM Asia Conference on Computer and Communications Security : May 30-June 3, 2022, Nagasaki, Japan. ACM Asia Conference on Computer and Communications Security (17th : 2022 : Nagasaki-shi, Japan ; ...","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A new and extended fault analysis on RSA\",\"authors\":\"Caisen Chen, Tao Wang\",\"doi\":\"10.1145/1966913.1966980\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As the preceding fault analysis on RSA Square-and-Multiple implementation which is based on modifying the public modulus N, is difficult to be executed in practice. This paper proposes a new method to execute fault analysis by regulating the voltage supply of the system to inject transient faults into multiplication operation instead of modifying the modulus N. In order to improve the feasibility of attack, we suggest an extension of fault analysis with recovering the key segment by segment instead of bit by bit. In the end, the complexity of the algorithm is analyzed. The expansibility and feasibility of algorithm are proved by demonstrating in theory and simulation experiments. The results of experiment show that the new fault analysis algorithm is more effective in practice.\",\"PeriodicalId\":72308,\"journal\":{\"name\":\"Asia CCS '22 : proceedings of the 2022 ACM Asia Conference on Computer and Communications Security : May 30-June 3, 2022, Nagasaki, Japan. ACM Asia Conference on Computer and Communications Security (17th : 2022 : Nagasaki-shi, Japan ; ...\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-03-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Asia CCS '22 : proceedings of the 2022 ACM Asia Conference on Computer and Communications Security : May 30-June 3, 2022, Nagasaki, Japan. ACM Asia Conference on Computer and Communications Security (17th : 2022 : Nagasaki-shi, Japan ; ...\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1966913.1966980\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asia CCS '22 : proceedings of the 2022 ACM Asia Conference on Computer and Communications Security : May 30-June 3, 2022, Nagasaki, Japan. ACM Asia Conference on Computer and Communications Security (17th : 2022 : Nagasaki-shi, Japan ; ...","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1966913.1966980","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

由于前面对RSA平方乘数实现基于修改公共模N的故障分析,在实践中很难执行。本文提出了一种新的故障分析方法,即通过调整系统的电压供应,将暂态故障注入到乘法运算中,而不是修改模n来进行故障分析。为了提高攻击的可行性,我们提出了一种故障分析的扩展方法,即通过逐段恢复关键,而不是逐位恢复关键。最后,对算法的复杂度进行了分析。通过理论和仿真实验验证了算法的可扩展性和可行性。实验结果表明,新的故障分析算法在实际应用中更加有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new and extended fault analysis on RSA
As the preceding fault analysis on RSA Square-and-Multiple implementation which is based on modifying the public modulus N, is difficult to be executed in practice. This paper proposes a new method to execute fault analysis by regulating the voltage supply of the system to inject transient faults into multiplication operation instead of modifying the modulus N. In order to improve the feasibility of attack, we suggest an extension of fault analysis with recovering the key segment by segment instead of bit by bit. In the end, the complexity of the algorithm is analyzed. The expansibility and feasibility of algorithm are proved by demonstrating in theory and simulation experiments. The results of experiment show that the new fault analysis algorithm is more effective in practice.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信