计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2015年
5期
153-158
,共6页
微处理器%分组密码%LBlock算法%侧信道攻击%踪迹驱动Cache攻击%时间复杂度%数据复杂度
微處理器%分組密碼%LBlock算法%側信道攻擊%蹤跡驅動Cache攻擊%時間複雜度%數據複雜度
미처리기%분조밀마%LBlock산법%측신도공격%종적구동Cache공격%시간복잡도%수거복잡도
microprocessor%block cipher%LBlock algorithm%side channel attack%trace driven Cache attack%time complexity%data complexity
LBlock是一种轻量级分组密码算法，其由于优秀的软硬件实现性能而备受关注。目前针对LBlock的安全性研究多侧重于抵御传统的数学攻击。缓存( Cache)攻击作为一种旁路攻击技术，已经被证实对密码算法的工程实现具有实际威胁，其中踪迹驱动Cache攻击分析所需样本少、分析效率高。为此，根据LBlock的算法结构及密钥输入特点，利用访问Cache过程中密码泄露的旁路信息，给出针对LBlock算法的踪迹驱动Cache攻击。分析结果表明，该攻击选择106个明文，经过约27.71次离线加密时间即可成功恢复LBlock的全部密钥。与LBlock侧信道立方攻击和具有Feistel结构的DES算法踪迹驱动Cache攻击相比，其攻击效果更明显。
LBlock是一種輕量級分組密碼算法，其由于優秀的軟硬件實現性能而備受關註。目前針對LBlock的安全性研究多側重于牴禦傳統的數學攻擊。緩存( Cache)攻擊作為一種徬路攻擊技術，已經被證實對密碼算法的工程實現具有實際威脅，其中蹤跡驅動Cache攻擊分析所需樣本少、分析效率高。為此，根據LBlock的算法結構及密鑰輸入特點，利用訪問Cache過程中密碼洩露的徬路信息，給齣針對LBlock算法的蹤跡驅動Cache攻擊。分析結果錶明，該攻擊選擇106箇明文，經過約27.71次離線加密時間即可成功恢複LBlock的全部密鑰。與LBlock側信道立方攻擊和具有Feistel結構的DES算法蹤跡驅動Cache攻擊相比，其攻擊效果更明顯。
LBlock시일충경량급분조밀마산법，기유우우수적연경건실현성능이비수관주。목전침대LBlock적안전성연구다측중우저어전통적수학공격。완존( Cache)공격작위일충방로공격기술，이경피증실대밀마산법적공정실현구유실제위협，기중종적구동Cache공격분석소수양본소、분석효솔고。위차，근거LBlock적산법결구급밀약수입특점，이용방문Cache과정중밀마설로적방로신식，급출침대LBlock산법적종적구동Cache공격。분석결과표명，해공격선택106개명문，경과약27.71차리선가밀시간즉가성공회복LBlock적전부밀약。여LBlock측신도립방공격화구유Feistel결구적DES산법종적구동Cache공격상비，기공격효과경명현。
As a new lightweight block cipher,LBlock cipher receives much attention since its excellent performance on hardware and software platforms. Currently, the secure evaluation on LBlock cipher heavy relies on the traditional mathematical attacks. The cache attack is a type of side channel attacks, and it has actual threat to the secure implementation of ciphers algorithm. In all kinds of Cache attacks,trace driven Cache attack has the advantage of using less samples and having higher efficiency. Based on the structure of the cipher algorithm and the property of its key schedule,this paper proposes a trace driven Cache attack on the LBlock algorithm. This attack recovers the secret key by capturing the leaked information in the process of accessing to the Cache. Analysis result shows that this attack requires a data complexity of about 106 chosen plaintexts,and a time complexity of about 27. 71 encryption operations. Compared with the proposed side channel cube attacks on LBlock and trace driven Cache attack on DES which also has the structure of Feistel,the attack is more favorable.
