首页> 外文期刊>Microprocessors and microsystems >Design and leakage assessment of side channel attack resistant binary edwards Elliptic Curve digital signature algorithm architectures
【24h】

Design and leakage assessment of side channel attack resistant binary edwards Elliptic Curve digital signature algorithm architectures

机译:抗侧信道攻击的二进制爱德华椭圆曲线数字签名算法架构的设计与泄漏评估

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

摘要

Considering that Elliptic Curve Digital Signature Algorithm (ECDSA) implementations need to be efficient, flexible and Side Channel Attack (SCA) resistant, in this paper, a design approach and architecture for ECDSA and the underlined scalar multiplication operation is proposed for GF(2(k)), satisfying the above three directives. To achieve that, in the paper, Binary Edwards Curves (BECs) are adopted as an alternative to traditional Weierstrass Elliptic Curves (ECs) for GF(2(k)) since they offer intrinsic SCA resistance against simple attacks due to their uniformity, operation regularity and completeness. To achieve high performance and flexibility, we propose a hardware/software ECDSA codesign approach where scalar multiplication is implemented in hardware and integrated in the ECDSA functionality through appropriate drivers of an ECDSA software stack. To increase BEC scalar multiplier performance and introduce SCA resistance we adopt and expand a parallelism design strategy/methodology where GF(2(k)) operations of a scalar multiplier round for both point operations performed in this round are reordered and assigned into parallelism layer in order to be executed concurrently. Within this strategy we include hardware and software based SCA countermeasures that rely on masking/randomization and hiding. While scalar randomization is realized by the ECDSA software stack in an easy way, in order to achieve resistance using hardware means, we propose and introduce in every scalar multiplier round, within the parallelism layers, projective coordinates randomization of all the round's output points. So, in our approach, considering that with the proposed parallelism plan in every scalar multiplier round BEC point operations are performed in parallel and that the round's output points are randomized with a different number in each round, we manage to achieve maximum SCA resistance. To validate this resistance, we introduce and realize a leakage assessment process on BEC scalar multipliers for the first time in research literature. This process is based on real measurements collected from a controlled SAKURA X environment with a GF(2(233)) based scalar multiplier implementation. Using Welch's t-test we investigate possible information leakage of the multiplier's input point and scalar and after an extended analysis we find trivial leakage. Finally, we validate the ECDSA architecture and its scalar multiplier efficiency by implementing it on a Zynq 7000 series FPGA Avnet Zedboard and collecting very promising, well balanced, results on speed and hardware resources in comparison with other works. (C) 2018 Elsevier B.V. All rights reserved.
机译:考虑到椭圆曲线数字签名算法(ECDSA)的实现需要高效,灵活和抗侧信道攻击(SCA),本文针对GF(2( k)),满足上述三个指令。为此,在本文中,采用二进制爱德华兹曲线(BEC)作为GF(2(k))的传统Weierstrass椭圆曲线(EC)的替代方法,因为它们由于其均匀性,操作性而具有抵抗简单攻击的固有SCA抵抗力规律性和完整性。为了实现高性能和灵活性,我们提出了一种硬件/软件ECDSA代码签名方法,其中,标量乘法在硬件中实现,并通过ECDSA软件堆栈的适当驱动程序集成到ECDSA功能中。为了提高BEC标量乘法器性能并引入SCA抵抗力,我们采用并扩展了并行度设计策略/方法,其中,对本轮中执行的两个点运算的标量乘法器回合的GF(2(k))运算进行了重新排序,并分配给了并发执行。在此策略中,我们包括基于硬件和软件的SCA对策,这些对策依赖于掩蔽/随机化和隐藏。尽管通过ECDSA软件堆栈以简单的方式实现标量随机化,但是为了使用硬件手段实现抵抗力,我们在并行层中的每个标量乘法器回合中提议并引入了所有回合输出点的投影坐标随机化。因此,在我们的方法中,考虑到在每个标量乘法器回合中建议的并行性计划中,BEC点操作都是并行执行的,并且回合的输出点在每个回合中均以不同的数量随机化,因此我们设法实现了最大的SCA抗性。为了验证这种抵抗力,我们在研究文献中首次引入并实现了BEC标量乘法器的泄漏评估过程。此过程基于从受控SAKURA X环境收集的实际测量结果,该环境使用基于GF(2(233))的标量乘法器实现。使用Welch的t检验,我们研究了乘法器输入点和标量的可能信息泄漏,并且在进行了扩展分析之后,我们发现了微不足道的泄漏。最后,我们通过在Zynq 7000系列FPGA Avnet Zedboard上实现ECDSA体系结构及其标量乘法器效率,并与其他工作相比,在速度和硬件资源上收集了非常有希望的,很好平衡的结果,来验证ECDSA体系结构及其标量乘法器效率。 (C)2018 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号