Further Cryptanalysis of a CRT-RSA Algorithm at CCS 2003

Ming Li, Baodong Qin, Fanyu Kong, Daxing Li
{"title":"Further Cryptanalysis of a CRT-RSA Algorithm at CCS 2003","authors":"Ming Li, Baodong Qin, Fanyu Kong, Daxing Li","doi":"10.1109/NPC.2007.97","DOIUrl":null,"url":null,"abstract":"At CCS 2003, Blomer, Otto, and Seifert proposed a new CRT-RSA signature algorithm, which was claimed to be secure against hardware fault attack. Unfortunately, one year later, Wagner presented a simple and practical fault attack on the so-called BOS algorithm. In this paper, we give a further cryptanalysis of the BOS algorithm and can completely break the security of it with a probability at least 25%. Compared to Wagner's attack, the new attack is much simpler and requires fewer faulty signatures. We further conclude that the BOS algorithm is not safe for use in its present form.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NPC.2007.97","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

At CCS 2003, Blomer, Otto, and Seifert proposed a new CRT-RSA signature algorithm, which was claimed to be secure against hardware fault attack. Unfortunately, one year later, Wagner presented a simple and practical fault attack on the so-called BOS algorithm. In this paper, we give a further cryptanalysis of the BOS algorithm and can completely break the security of it with a probability at least 25%. Compared to Wagner's attack, the new attack is much simpler and requires fewer faulty signatures. We further conclude that the BOS algorithm is not safe for use in its present form.
CRT-RSA算法的进一步密码分析,ccsc2003
在CCS 2003会议上,Blomer、Otto和Seifert提出了一种新的CRT-RSA签名算法,声称该算法可以防止硬件故障攻击。不幸的是,一年后,Wagner针对所谓的BOS算法提出了一种简单实用的故障攻击。在本文中,我们对BOS算法进行了进一步的密码分析,并以至少25%的概率完全破坏了它的安全性。与Wagner的攻击相比,新的攻击更简单,需要的错误签名也更少。我们进一步得出结论,BOS算法在目前的形式下使用是不安全的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信