Reinforcement-Based Divide-and-Conquer Strategy for Side-Channel Attacks

Shan Jin, R. Bettati
{"title":"Reinforcement-Based Divide-and-Conquer Strategy for Side-Channel Attacks","authors":"Shan Jin, R. Bettati","doi":"10.1109/WIFS49906.2020.9360908","DOIUrl":null,"url":null,"abstract":"Previous works have proven that power consumption side-channel attacks, such as the Template Attack and the Stochastic Model, are effective for small secrets, such as those with 8 or 16 bits. However, directly applying those side-channel attacks on systems with large secrets, for example AES 128, is computationally intractable. Attackers usually apply a divide-and-conquer strategy to partition the secret in order to scale to larger numbers of bits. In the case of AES, divide-and-conquer strategy based side-channel attacks are usually launched on either the first round or the last round of the AES encryption. In this paper, we propose an efficient and pragmatic attack strategy that exploits the samples from multiple rounds, which significantly improves the key recovery compared to standard divide-and-conquer strategies.","PeriodicalId":354881,"journal":{"name":"2020 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Workshop on Information Forensics and Security (WIFS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIFS49906.2020.9360908","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Previous works have proven that power consumption side-channel attacks, such as the Template Attack and the Stochastic Model, are effective for small secrets, such as those with 8 or 16 bits. However, directly applying those side-channel attacks on systems with large secrets, for example AES 128, is computationally intractable. Attackers usually apply a divide-and-conquer strategy to partition the secret in order to scale to larger numbers of bits. In the case of AES, divide-and-conquer strategy based side-channel attacks are usually launched on either the first round or the last round of the AES encryption. In this paper, we propose an efficient and pragmatic attack strategy that exploits the samples from multiple rounds, which significantly improves the key recovery compared to standard divide-and-conquer strategies.
基于强化的分而治之的侧信道攻击策略
以前的工作已经证明,功耗侧信道攻击,如模板攻击和随机模型,对小秘密有效,如8位或16位的秘密。然而,直接将这些侧信道攻击应用于具有大量秘密的系统,例如AES 128,在计算上是难以处理的。攻击者通常采用分而治之的策略对秘密进行分区,以便扩展到更大的比特数。对于AES,基于分而治之策略的侧信道攻击通常在AES加密的第一轮或最后一轮发起。在本文中,我们提出了一种高效实用的攻击策略,利用来自多轮的样本,与标准的分治策略相比,该策略显著提高了密钥恢复。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信