边信道密码分析与顺序译码
On Side Channel Cryptanalysis and Sequential Decoding
摘要:
本文提出了一种基于序列译码方法的迭代近似贝叶斯推理的边信道密码分析方法。关于子密钥假设的可靠性信息以似然的形式生成,并且子密钥假设似然的集合被最优地组合成密钥比特对数似然比。利用多轮加密方案中扩展密钥的冗余性来纠正轮密钥估计错误。这是通过顺序解码来实现的,其中子密钥候选者通过概率路径度量进行排序并迭代扩展。M-算法作为一个具体的实施例,具有确定性的运行时行为。所得到的算法包含以前的硬判决差分分析作为单轮分析和M=1的特殊情况,否则严格更准确。估计精度和复杂度之间的权衡是可缩放的参数选择。所提出的算法模拟示出在一个示例场景中,以减少所需的侧信道的数量相比,标准差分分析的一个因素,当运行合理的复杂性,为整个调查的信噪比范围。
英文摘要:
This paper presents an approach for side channel cryptanalysis with iterative approximate Bayesian inference, based on sequential decoding methods. Reliability information about subkey hypotheses is generated in the form of likelihoods, and sets of subkey hypothesis likelihoods are optimally combined into key bit log likelihood ratios. The redundancy of expanded keys in multi-round cryptographic schemes is exploited to correct round key estimation errors. This is achieved by sequential decoding, where subkey candidates are sorted by a probabilistic path metric and iteratively extended. The M-algorithm is presented as a concrete implementation example with deterministic run-time behaviour. The resulting algorithm contains previous hard decision differential analysis as special case for single-round analysis and M=1, and is strictly more accurate otherwise. The trade-off between estimation accuracy and complexity is scalable by parameter choice. The proposed algorithm is simulatively shown in an example scenario to reduce the number of required side channel traces compared to standard differential analysis by a factor of two when run with reasonable complexity, for the whole investigated signal-to-noise ratio range.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。