A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks

详细信息    查看全文

• 刊名：Lecture Notes in Computer Science
• 出版年：2017
• 出版时间：2017
• 年：2017
• 卷：10159
• 期：1
• 页码：311-327
• 丛书名：Topics in Cryptology ?CT-RSA 2017
• ISBN：978-3-319-52153-4
• 卷排序：10159

文摘

Enumeration of cryptographic keys in order of likelihood based on side-channel leakages has a significant importance in cryptanalysis. The best optimal-order key enumeration algorithms have a huge space complexity of \(\varOmega (n^{d/2})\) when there are d subkeys and n candidate values per subkey. In this paper, we present a parallelizable algorithm that enumerates the keys in near-optimal order but enjoys a much better space complexity of \(O(d^2w+dn)\) for a design parameter w which can be tuned to available RAM.