首页> 外文会议>IEEE International Conference on Recent Advances and Innovations in Engineering >Fault attack for scalar multiplication over finite field (E(Fq)) on Elliptic Curve Digital Signature Algorithm
【24h】

Fault attack for scalar multiplication over finite field (E(Fq)) on Elliptic Curve Digital Signature Algorithm

机译:椭圆曲线数字签名算法的有限域标量乘法(E(Fq))的故障攻击

获取原文

摘要

Elliptic Curve Cryptosystems are very much delicate to attacks or physical attacks. This paper aims to correctly implementing the fault injection attack against Elliptic Curve Digital Signature Algorithm. More specifically, the proposed algorithm concerns to fault attack which is implemented to sufficiently alter signature against vigilant periodic sequence algorithm that supports the efficient speed up and security perspectives with most prominent and well known scalar multiplication algorithm for ECDSA. The purpose is to properly injecting attack whether any probable countermeasure threatening the pseudo code is determined by the attack model according to the predefined methodologies. We show the results of our experiment with bits acquire from the targeted implementation to determine the reliability of our attack.
机译:椭圆曲线密码系统对于攻击或物理攻击非常微妙。本文旨在针对椭圆曲线数字签名算法正确实施故障注入攻击。更具体地,所提出的算法与故障攻击有关,该故障攻击被实现为针对警惕的周期性序列算法充分地改变签名,该算法以用于ECDSA的最著名和众所周知的标量乘法算法来支持有效的加速和安全性观点。目的是根据预先定义的方法,通过攻击模型确定是否威胁到伪代码的任何可能的对策适当地注入了攻击。我们用从目标实现中获取的比特来展示我们的实验结果,以确定攻击的可靠性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号