Iterative side-channel cube attack on KeeLoq

摘要：

　　KeeLoq is a 528-round lightweight block cipher which has a 64-bit secret key and a 32-bit block length.The cube attack,proposed by Dinur and Shamir,is a new type of attacking method.In this paper,we investigate the security of KeeLoq against iterative side-channel cube attack which is an enhanced attack scheme.Based on structure of typical block ciphers,we give the model of iterative side-channel cube attack.Using the traditional single-bit leakage model,we assume that the attacker can exactly possess the information of one bit leakage after round 23.The new attack model costs a data complexity of 211.00 chosen plaintexts to recover the 23-bit key of KeeLoq.Our attack will reduce the key searching space to 241 by considering an error-free bit from internal states.

关键词： KeeLoq cube attack block cipher algebraic attack side-channel attack iterative attack leakage model

作者: Yunfei Ma Tao Wang Hao Chen Dong Lei

作者单位: Department of Information Engineering Ordnance Engineering College Shijiazhuang 050003, China

会议类型: 国际会议

会议名称: 2016 Sixth International Conference on Instrumentation and Measurement,Computer,Communication and Control (IMCCC2016)(第六届仪器测量、计算机通信与控制国际会议)

会议地点: 哈尔滨

会议语种:英文

页码: 53-56

在线出版日期: 2016-07-21（万方平台首次上网日期，不代表论文的发表时间）