模幂算法的功耗攻击及双线性对密码算法的故障攻击研究

发布时间：2018-09-12 17:33

【摘要】：密码系统在移动互联网、物联网、金融、国防等信息安全领域的广泛应用对密码系统的安全性提出了很高的要求。公钥密码是密码系统的重要分支,在密码领域得到了广泛应用。随着旁路攻击的出现,许多算法的硬件实现已不再安全,因此对已有算法的安全性研究变得非常重要,为算法增加防御措施已成为密码产品在设计之前必须考虑的问题。模幂算法作为许多古典公钥密码系统的核心运算,其安全性一直以来倍受关注。与此同时,一些新型的公钥密码系统也在不断涌现,学术界针对这些算法的安全性研究尚处于初始阶段。其中,双线性对密码算法以其优良的特性以及更高的安全性受到了广泛研究。针对模幂算法,本文进行了功耗分析攻击研究,在N-1攻击的基础上,提出了扩展的攻击方法,并利用硬件设计的安全监测平台对两种模幂算法的ASIC实现进行了攻击实验。针对双线性对密码算法,本文进行了故障攻击研究,提出了基于分支的故障攻击方法,并用Magma软件证明了攻击的正确性。本文主要有以下几方面的工作和创新:1)本文深入研究了N-1攻击,提出扩展的N-1攻击方法。在一定条件下,只要符合2=1的x值,均可以用于选择明文功耗攻击。利用这些值,本文成功攻击了Boscher的从右到左模幂算法和蒙哥马利阶梯算法。2)提出了针对扩展N-1攻击的防御措施。3)提出了针对双线性对密码算法中Miller循环的分支故障攻击方法,此分支故障攻击方法适用于含有Miller循环的所有双线性对密码算法,此分支故障攻击方法具有植入错误方式多样的优点。4)提出了有针对性的防御措施,为保障双线性对密码系统的物理安全性提供参考。
[Abstract]:The wide application of cryptography in the fields of mobile Internet, Internet of things, finance, national defense and other information security fields has put forward high requirements for the security of cryptographic systems. Public key cryptography is an important branch of cryptosystem, and has been widely used in the field of cryptography. With the emergence of bypass attacks, the hardware implementation of many algorithms is no longer secure, so it is very important to study the security of existing algorithms. Adding defense measures to the algorithms has become a problem that must be considered before the design of cryptographic products. Modular power algorithm is the core operation of many classical public key cryptosystems, and its security has been paid more and more attention. At the same time, some new public key cryptosystems are emerging, and the research on the security of these algorithms is still in the initial stage. Among them, bilinear pair cryptography algorithm has been widely studied for its excellent characteristics and higher security. Based on the N-1 attack, the extended attack method is proposed, and the ASIC implementation of the two modular power algorithms is tested by using the security monitoring platform designed by hardware. For the bilinear pairwise cipher algorithm, the fault attack method based on branch is proposed, and the correctness of the attack is proved by Magma software. This paper mainly has the following work and innovation: 1) in this paper, the N-1 attack is studied in depth, and an extended N-1 attack method is proposed. Under certain conditions, as long as the x value of 2kW 1 is satisfied, it can be used to select the plaintext power attack. Using these values, the right-to-left power algorithm and Montgomery ladder algorithm of Boscher are successfully attacked. The defense measures against extended N-1 attack are proposed. 3) the branch fault attack method of Miller loop in bilinear pair cipher algorithm is proposed. This branch fault attack method is suitable for all bilinear pair cipher algorithms with Miller loop. This branch fault attack method has the advantage of implanting errors in a variety of ways. It provides a reference for the physical security of the bilinear pair cryptosystem.
【学位授予单位】：天津大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN918.1

【相似文献】