• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >On fault-based attacks and countermeasures for elliptic curve cryptosystems.
【24h】

On fault-based attacks and countermeasures for elliptic curve cryptosystems.

机译：椭圆曲线密码系统的基于故障的攻击和对策。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

For some applications, elliptic curve cryptography (ECC) is an attractive choice because it achieves the same level of security with a much smaller key size in comparison with other schemes such as those that are based on integer factorization or discrete logarithm. Unfortunately, cryptosystems including those based on elliptic curves have been subject to attacks. For example, fault-based attacks have been shown to be a real threat in today's cryptographic implementations. In this thesis, we consider fault-based attacks and countermeasures for ECC. We propose a new fault-based attack against the Montgomery ladder elliptic curve scalar multiplication (ECSM) algorithm. For security reasons, especially to provide resistance against fault-based attacks, it is very important to verify the correctness of computations in ECC applications. We deal with protections to fault attacks against ECSM at two levels: module and algorithm. For protections at the module level, where the underlying scalar multiplication algorithm is not changed, a number of schemes and hardware structures are presented based on re-computation or parallel computation. It is shown that these structures can be used for detecting errors with a very high probability during the computation of ECSM. For protections at the algorithm level, we use the concepts of point verification (PV) and coherency check (CC). We investigate the error detection coverage of PV and CC for the Montgomery ladder ECSM algorithm. Additionally, we propose two algorithms based on the double-and-add-always method that are resistant to the safe error (SE) attack. We demonstrate that one of these algorithms also resists the sign change fault (SCF) attack.
机译：对于某些应用程序，椭圆曲线密码术（ECC）是一个有吸引力的选择，因为与基于整数分解或离散对数的其他方案相比，它以较小的密钥大小实现了相同的安全级别。不幸的是，包括基于椭圆曲线的密码系统已经受到攻击。例如，在当今的加密实施中，基于故障的攻击已被证明是真正的威胁。在本文中，我们考虑了基于故障的ECC攻击和对策。我们针对蒙哥马利阶梯椭圆曲线标量乘法（ECSM）算法提出了一种基于故障的新攻击。出于安全原因，尤其是为了抵抗基于故障的攻击，验证ECC应用程序中计算的正确性非常重要。我们从两个级别处理针对ECSM的故障攻击的保护：模块和算法。对于模块级别的保护，其中基本的标量乘法算法没有更改，基于重新计算或并行计算，提出了许多方案和硬件结构。结果表明，这些结构可用于在ECSM计算过程中以很高的概率检测错误。对于算法级别的保护，我们使用点验证（PV）和一致性检查（CC）的概念。我们研究了蒙哥马利阶梯ECSM算法的PV和CC的错误检测范围。此外，我们提出了两种基于始终添加和删除方法的算法，它们可以抵抗安全错误（SE）攻击。我们证明了这些算法之一也可以抵抗符号更改故障（SCF）攻击。

著录项

  • 作者

    Dominguez Oviedo, Agustin.;

  • 作者单位

    University of Waterloo (Canada).;

  • 授予单位 University of Waterloo (Canada).;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2008
  • 页码 206 p.
  • 总页数 206
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号