• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Parallel and Distributed Systems >Improved Differential Fault Analysis on LED with Constraint Equations: Towards Reaching its Limit
【24h】

Improved Differential Fault Analysis on LED with Constraint Equations: Towards Reaching its Limit

机译：改进了带有约束方程的LED的差分故障分析：达到其极限

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The block cipher LED is well suited for resource-constrained scenarios. However, it is vulnerable to the recent fault attacks and different results have been achieved even under the same fault model. In this paper, a comprehensive investigation is conducted on the fault analysis on LED. A novel differential fault analysis is proposed, which is based on the so-called constraint equations. The proposed attack can combine constraint equations at different levels, pushing the differential fault analysis on LED towards its limit in terms of the time complexity, the data complexity and the remained key search space. Under random nibble fault model, SINGLE fault injection can reduce the key search space of LED-64 to 2~(7.90) within 1.89s, compared to 2~(17.65) within 7 minutes in prior finest contributions. As to DFA on LED-128, TWO fault injections can reduce the key search space to 2~(15.82) within 247.88s, compared to 2~(21.96) within 16 minutes in previous work. To the best of our knowledge, the scheme that we proposed is the most efficient fault attack on LED cryptosystems.
机译：块密码LED非常适合资源受限场景。但是，它很容易受到最近的故障攻击，即使在相同的故障模型下也已经实现了不同的结果。本文对LED的故障分析进行了全面调查。提出了一种新的差分故障分析，基于所谓的约束方程。所提出的攻击可以将约束方程组合在不同的级别，在时间复杂度，数据复杂性和剩余的密钥搜索空间中推动对其限制的差分故障分析。在随机蚕板故障模型下，单个故障注入可以将LED-64至2〜（7.90）的关键搜索空间减少到1.89年内，而在经过最优选的贡献的7分钟内相比，在7分钟内比较2〜（17.65）。对于LED-128上的DFA，两个故障注射可以在247.88年内将钥匙搜索空间减少到2〜（15.82），而在以前的工作16分钟内相比2〜（21.96）。据我们所知，我们提出的方案是对LED密码系统上最有效的故障攻击。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号