A note on quantum related-key attacks

被引：39
作者：
Roetteler, Martin [1 ]
Steinwandt, Rainer [2 ]
机构：
[1] Microsoft Res, Redmond, WA 98052 USA
[2] Florida Atlantic Univ, Boca Raton, FL 33431 USA
来源：
INFORMATION PROCESSING LETTERS | 2015年 / 115卷 / 01期
关键词：
Cryptography; Quantum computing; Block ciphers; Related-key attacks; Hidden subgroup problems;
D O I：
10.1016/j.ipl.2014.08.009
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In a basic related-key attack against a block cipher, the adversary has access to encryptions under keys that differ from the target key by bit-flips. In this short note we show that for a quantum adversary such attacks are quite powerful: if the secret key ig (i) uniquely determined by a small number of plaintext-ciphertext pairs, (ii) the block cipher can be evaluated efficiently, and (iii) a superposition of related keys can be queried, then the key can be extracted efficiently. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：40 / 44
页数：5
相关论文
共 21 条
[1]  
Albrecht MR, 2011, LECT NOTES COMPUT SC, V6733, P128
[2]  
[Anonymous], 2004, ARXIVQUANTPH0410184
[3]  
[Anonymous], FED INF PROC STAND P
[4]  
Bellare M, 2003, LECT NOTES COMPUT SC, V2656, P491
[5]   LOGICAL REVERSIBILITY OF COMPUTATION [J].
BENNETT, CH .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1973, 17 (06) :525-532
[6]  
Bernstein DJ., 2009, POSTQUANTUM CRYPTOGR, P1, DOI [DOI 10.1007/978-3-540-88702-7, 10.1007/978-3-540-88702-7, DOI 10.1007/978-3-540-88702-71, 10.1007/978-3-540-88702-7_1, DOI 10.1007/978-3-540-88702-7_1]
[7]  
Biryukov A., INVESTIGATION REPORT
[8]   Random Oracles in a Quantum World [J].
Boneh, Dan ;
Dagdelen, Ozgur ;
Fischlin, Marc ;
Lehmann, Anja ;
Schaffner, Christian ;
Zhandry, Mark .
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2011, 2011, 7073 :41-+
[9]   An exact quantum polynomial-time algorithm for Simon's problem [J].
Brassard, G ;
Hoyer, P .
PROCEEDINGS OF THE FIFTH ISRAELI SYMPOSIUM ON THEORY OF COMPUTING AND SYSTEMS, 1997, :12-23
[10]  
Chuang I. N., 2000, Quantum Computation and Quantum Information
123