检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:GAO Si CHEN Hua FAN Limin WU Wenling
机构地区:[1]Trusted Computing and Information Assurance Laboratory, Institute of Software Chinese Academy of Sciences [2]Graduate University of Chinese Academy of Sciences
出 处:《Chinese Journal of Electronics》2017年第4期754-759,共6页电子学报(英文版)
基 金:supported by the National Basic Research Program of China(973 Program)(No.2013CB338002)
摘 要:As one of the most popular lightweight ciphers in recent years, LBlock has attracted great attention.Researchers have explored the security of LBlock against various attacks. We focus on fault attack—one of the most important implementation attacks. In the past two years,fault attacks under the random fault model have been successfully applied to LBlock, supposing faults were injected at the end of the 24 th to the 31 st round. If faults are injected at the end of the 23 rd round, previous attacks only work under the semi-random fault model. For the first time, we address this issue and propose a 23 rd round fault attack under the random fault model. Compared with the previous works, our attack extends the fault injection to earlier round, with reasonable time cost and no extra faults. Experiments show that it only takes 10 faults to recover the secret key.As one of the most popular lightweight ciphers in recent years, LBlock has attracted great attention.Researchers have explored the security of LBlock against various attacks. We focus on fault attack—one of the most important implementation attacks. In the past two years,fault attacks under the random fault model have been successfully applied to LBlock, supposing faults were injected at the end of the 24 th to the 31 st round. If faults are injected at the end of the 23 rd round, previous attacks only work under the semi-random fault model. For the first time, we address this issue and propose a 23 rd round fault attack under the random fault model. Compared with the previous works, our attack extends the fault injection to earlier round, with reasonable time cost and no extra faults. Experiments show that it only takes 10 faults to recover the secret key.
关 键 词:Implementation analysis Fault analysis Random fault model
分 类 号:TN918.1[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200