首页> 外文期刊>電子情報通信学会技術研究報告. 情報セキュリティ. Information Security >An SPA attack breaks the randomized addition-subtraction chains method at CHES 2001
【24h】

An SPA attack breaks the randomized addition-subtraction chains method at CHES 2001

机译:SPA攻击打破了CHES 2001的随机加减链方法

获取原文
获取原文并翻译 | 示例
           

摘要

We show that a randomized addition-subtraction chains countermeasure against side channel attacks is vulnerable to SPA attack, a kind of side channel attack, under distinguishability between addition and doubling. A side channel attack is an attack that takes advantage of information leaked during execution of a cryptographic procedure. The randomized addition-subtraction chains countermeasure has been proposed by Oswald-Aigner, and is a random decision inserted into computations. However, its immunity to side channel attacks is still controversial. As for timing attack, a kind of side channel attack, the randomized addition-subtraction chains countermeasure is also vulnerable. Moreover, compared with other countermeasures against side channel attacks, the randomized addition-subtraction chains countermeasure, after being improved to prevent side channel attacks, is much slower.
机译:我们表明,在加法和加倍之间的可区分性下,针对副信道攻击的随机加减链对策很容易受到SPA攻击(一种副信道攻击)的攻击。边信道攻击是一种利用在执行加密过程期间泄漏的信息的攻击。 Oswald-Aigner提出了随机的加减链对策,这是一种插入到计算中的随机决策。但是,其对旁道攻击的免疫力仍存在争议。至于定时攻击,一种边信道攻击,随机的加减链对策也很脆弱。此外,与其他针对侧信道攻击的对策相比,随机加减链对策在经过改进以防止侧信道攻击之后要慢得多。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号