公钥密码体制的算法大多基于有限域的幂指数运算或者离散对数运算。而这些运算一般会采用Montgomery算法来降低运算的复杂度。针对Montgomery算法本身存在可被侧信道攻击利用的信息泄露问题,从理论和实际功耗数据2方面分析了Montgomery...公钥密码体制的算法大多基于有限域的幂指数运算或者离散对数运算。而这些运算一般会采用Montgomery算法来降低运算的复杂度。针对Montgomery算法本身存在可被侧信道攻击利用的信息泄露问题,从理论和实际功耗数据2方面分析了Montgomery算法存在的安全漏洞,并基于该漏洞提出了对使用Montgomery算法实现的模幂运算进行简单能量分析(SPA,simple power analysis)攻击算法。利用该算法对实际模幂运算的能量曲线进行了功耗分析攻击。实验表明该攻击算法是行之有效的。展开更多
SPA(Simple Power Analysis)攻击可能通过泄露的信息获取内存受限制的设备中的密钥,它是通过区分一次点乘运算中点加运算和倍点运算进行的。抗SPA攻击的点乘算法较多,但对于多点乘算法相关措施较少。Sharmir-NAF多点乘算法是一个时间和...SPA(Simple Power Analysis)攻击可能通过泄露的信息获取内存受限制的设备中的密钥,它是通过区分一次点乘运算中点加运算和倍点运算进行的。抗SPA攻击的点乘算法较多,但对于多点乘算法相关措施较少。Sharmir-NAF多点乘算法是一个时间和空间效率都非常优秀的多点乘算法。为此提出一种基于Sharmir-NAF的抗SPA攻击的多点乘算法。新的算法在内存空间消耗和计算速度上较原算法负担增加可以忽略不计,而且能够抗SPA攻击。展开更多
大整数模幂运算的核心是大整数模乘运算,一般采用Montgomery模乘算法实现。针对Montgomery模乘算法实现方式中大整数拆分成多个字节或字相乘存在功耗泄露问题,提出一种选择能产生Montgomery模乘算法的某操作数由多个字节或字为零组成的...大整数模幂运算的核心是大整数模乘运算,一般采用Montgomery模乘算法实现。针对Montgomery模乘算法实现方式中大整数拆分成多个字节或字相乘存在功耗泄露问题,提出一种选择能产生Montgomery模乘算法的某操作数由多个字节或字为零组成的大整数的特定明文,简单功耗分析(simple power analysis,SPA)的方法。通过输入特定明文,一条功耗曲线就能将模幂算法中平方和乘运算位置区分出来,私钥攻击难度下降。在搭建真实的8051智能卡芯片攻击环境下,输入特定明文进行SPA攻击,1024比特私幂指数私钥攻击准确率可达99%。实验结果表明可选特定明文数量多,用单一的屏蔽特殊明文的方法无法有效防范文中提出的SPA攻击,最后给出防范此选择明文SPA攻击的建议。展开更多
Nowadays the modular multiplications in many kinds of smartcards are utilized Montgomery's algorithm modular multiplier, so traditional SPA to RSA becomes invalid. An improved attack method is proposed based on SP...Nowadays the modular multiplications in many kinds of smartcards are utilized Montgomery's algorithm modular multiplier, so traditional SPA to RSA becomes invalid. An improved attack method is proposed based on SPA which just depends on the fact that there exist some subtle differences in each loop during the operation of cd mod n. At same time, compared with the traditional SPA, it doesn't need to select the clear text or some known message. Using this method, attacks can easy to discover the mode of RSA implementation and extract the bits of decryption key just based on a few collected traces. From the real attack test on several main kinds of smartcard, the private keys of RSA stored inside can be analyzed successfully.展开更多
Leakage power analysis(LPA) attacks aim at finding the secret key of a cryptographic device from measurements of its static(leakage) power. This novel power analysis attacks take advantage of the dependence of the lea...Leakage power analysis(LPA) attacks aim at finding the secret key of a cryptographic device from measurements of its static(leakage) power. This novel power analysis attacks take advantage of the dependence of the leakage power of complementary metal oxide semiconductor(CMOS) integrated circuits on the data they process. This paper proposes symmetric dual-rail logic(SDRL), a standard cell LPA attack countermeasure that theoretically resists the LPA attacks. The technique combines standard building blocks to make new compound standard cells, which are close to constant leakage power consumption. Experiment results show SDRL is a promising approach to implement an LPA-resistant crypto processor.展开更多
椭圆曲线公钥密码是公钥密码体制的主流方向之一.由于密钥短、计算速度快,该体制在智能卡和手机存储卡等受限的环境中得到了广泛的应用.椭圆曲线密码体系中最耗时的运算是标量乘.标量乘需要安全、有效、快速的实现算法.Montgomery算法...椭圆曲线公钥密码是公钥密码体制的主流方向之一.由于密钥短、计算速度快,该体制在智能卡和手机存储卡等受限的环境中得到了广泛的应用.椭圆曲线密码体系中最耗时的运算是标量乘.标量乘需要安全、有效、快速的实现算法.Montgomery算法是计算椭圆曲线标量乘的算法之一,它能够有效地抵抗简单能量分析.在Montgomery算法结构的基础上,文中首次利用统一Z坐标技巧和循环中间阶段不计算Y坐标的技巧,改进了有限域GF(3~m)上椭圆曲线的点加和倍点公式,构造了抵抗简单能量攻击的co-Z Montgomery算法.设I,M,C分别表示有限域上的求逆、乘法、立方.当域上的平方和乘法使用相同的算法时,理论分析表明每轮循环中,co-Z Montgomery算法比仿射Montgomery算法快I+C-5 M,比射影Montgomery算法快C+2 M,比使用"Selected Areas in Cryptography"2012上快速点加、倍点公式的Montgomery算法快2C+M.在文章"特征3有限域上椭圆曲线的Montgomery算法"的模拟实验环境下,结果表明该算法比上述算法分别快26.3%、19.0%、20.6%;Sage云平台的实验结果表明该算法比上述算法分别快24.1%、20.1%、23.1%.展开更多
文摘公钥密码体制的算法大多基于有限域的幂指数运算或者离散对数运算。而这些运算一般会采用Montgomery算法来降低运算的复杂度。针对Montgomery算法本身存在可被侧信道攻击利用的信息泄露问题,从理论和实际功耗数据2方面分析了Montgomery算法存在的安全漏洞,并基于该漏洞提出了对使用Montgomery算法实现的模幂运算进行简单能量分析(SPA,simple power analysis)攻击算法。利用该算法对实际模幂运算的能量曲线进行了功耗分析攻击。实验表明该攻击算法是行之有效的。
文摘SPA(Simple Power Analysis)攻击可能通过泄露的信息获取内存受限制的设备中的密钥,它是通过区分一次点乘运算中点加运算和倍点运算进行的。抗SPA攻击的点乘算法较多,但对于多点乘算法相关措施较少。Sharmir-NAF多点乘算法是一个时间和空间效率都非常优秀的多点乘算法。为此提出一种基于Sharmir-NAF的抗SPA攻击的多点乘算法。新的算法在内存空间消耗和计算速度上较原算法负担增加可以忽略不计,而且能够抗SPA攻击。
文摘大整数模幂运算的核心是大整数模乘运算,一般采用Montgomery模乘算法实现。针对Montgomery模乘算法实现方式中大整数拆分成多个字节或字相乘存在功耗泄露问题,提出一种选择能产生Montgomery模乘算法的某操作数由多个字节或字为零组成的大整数的特定明文,简单功耗分析(simple power analysis,SPA)的方法。通过输入特定明文,一条功耗曲线就能将模幂算法中平方和乘运算位置区分出来,私钥攻击难度下降。在搭建真实的8051智能卡芯片攻击环境下,输入特定明文进行SPA攻击,1024比特私幂指数私钥攻击准确率可达99%。实验结果表明可选特定明文数量多,用单一的屏蔽特殊明文的方法无法有效防范文中提出的SPA攻击,最后给出防范此选择明文SPA攻击的建议。
基金supported by the fundamental Research Funds for the Central University under Grant 2013JBM006
文摘Nowadays the modular multiplications in many kinds of smartcards are utilized Montgomery's algorithm modular multiplier, so traditional SPA to RSA becomes invalid. An improved attack method is proposed based on SPA which just depends on the fact that there exist some subtle differences in each loop during the operation of cd mod n. At same time, compared with the traditional SPA, it doesn't need to select the clear text or some known message. Using this method, attacks can easy to discover the mode of RSA implementation and extract the bits of decryption key just based on a few collected traces. From the real attack test on several main kinds of smartcard, the private keys of RSA stored inside can be analyzed successfully.
基金the Software and Integrated CircuitIndustries Development Foundation of Shanghai(No.12Z116010001)
文摘Leakage power analysis(LPA) attacks aim at finding the secret key of a cryptographic device from measurements of its static(leakage) power. This novel power analysis attacks take advantage of the dependence of the leakage power of complementary metal oxide semiconductor(CMOS) integrated circuits on the data they process. This paper proposes symmetric dual-rail logic(SDRL), a standard cell LPA attack countermeasure that theoretically resists the LPA attacks. The technique combines standard building blocks to make new compound standard cells, which are close to constant leakage power consumption. Experiment results show SDRL is a promising approach to implement an LPA-resistant crypto processor.
文摘椭圆曲线公钥密码是公钥密码体制的主流方向之一.由于密钥短、计算速度快,该体制在智能卡和手机存储卡等受限的环境中得到了广泛的应用.椭圆曲线密码体系中最耗时的运算是标量乘.标量乘需要安全、有效、快速的实现算法.Montgomery算法是计算椭圆曲线标量乘的算法之一,它能够有效地抵抗简单能量分析.在Montgomery算法结构的基础上,文中首次利用统一Z坐标技巧和循环中间阶段不计算Y坐标的技巧,改进了有限域GF(3~m)上椭圆曲线的点加和倍点公式,构造了抵抗简单能量攻击的co-Z Montgomery算法.设I,M,C分别表示有限域上的求逆、乘法、立方.当域上的平方和乘法使用相同的算法时,理论分析表明每轮循环中,co-Z Montgomery算法比仿射Montgomery算法快I+C-5 M,比射影Montgomery算法快C+2 M,比使用"Selected Areas in Cryptography"2012上快速点加、倍点公式的Montgomery算法快2C+M.在文章"特征3有限域上椭圆曲线的Montgomery算法"的模拟实验环境下,结果表明该算法比上述算法分别快26.3%、19.0%、20.6%;Sage云平台的实验结果表明该算法比上述算法分别快24.1%、20.1%、23.1%.
