A Novel SPA Attack on SM2 with Regular Point Multiplication

WANG Li-hui; ZHAO Bing; LI Qing; LIANG Xiao-bing; LIU Jing

Chinese

您当前的位置：

首页 >

文章列表页 >

A Novel SPA Attack on SM2 with Regular Point Multiplication

更新时间：2026-09-04

- A Novel SPA Attack on SM2 with Regular Point Multiplication
- Vol. 35, Issue 8, Pages: 26-30(2018)
- 作者机构：
  
  1. 上海复旦微电子集团股份有限公司,上海,200433
  2. 中国电力科学研究院机构,北京,100192
  3. 国网宁夏电力公司电力科学研究院,宁夏,银川,750002
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2018
- 稿件说明：
移动端阅览
王立辉, 赵兵, 李清, 梁晓兵, 刘静. 一种针对SM2规整点乘算法的新型SPA攻击[J]. 微电子学与计算机, 2018, 35(8): 26-30.

WANG Li-hui, ZHAO Bing, LI Qing, et al. A Novel SPA Attack on SM2 with Regular Point Multiplication[J]. 2018, 35(8): 26-30.
王立辉, 赵兵, 李清, 梁晓兵, 刘静. 一种针对SM2规整点乘算法的新型SPA攻击[J]. 微电子学与计算机, 2018, 35(8): 26-30. DOI：

WANG Li-hui, ZHAO Bing, LI Qing, et al. A Novel SPA Attack on SM2 with Regular Point Multiplication[J]. 2018, 35(8): 26-30. DOI：

摘要

相比于RSA密码算法

SM2在同样的安全强度下需要更短的密钥长度

因此更适合于应用到资源受限的智能卡中.为了SM2应用的安全性

人们研究出多种具有抗侧道攻击能力的SM2点乘算法.本文提出了一种基于条件减法的新型简单功耗分析方法

可以对常用的两种防护实现进行密钥的破解.实验结果表明

该方法只需要一条功耗曲线

即可在几秒钟内破解出SM2密钥.同时本文也给出了几种可以抵御该攻击的防护方法.

Abstract

Compared with the RSA

the shorter key length is needed in the same security strength

so SM2 is more suitable for the application to the resource limited smart card. For the security of application of SM2

people study the variety point multiplication algorithms with countermeasures to resist the side channel attacks. This paper proposes a new simple side-channel analysis (SPA) method based conditional subtraction to attack two usual SM2 algorithms with countermeasures. Experimental results show that this method only needs a power trace

which can be used to break the SM2 key in a few seconds. At the same time

this paper also demonstrates some countermeasures to resist the attack.

关键词

Keywords

references

GM/T 0003-2012. SM2 elliptic curve public key cryptographic algorithms [S]. China:Chinese Cryptograpy Administration, 2010.

Kocher P. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems[M]. Springer Berlin Heidelberg, 1996(1109) :104-113. DOI: 104

Montgomery P L. Speeding the pollard and elliptic curve methodsfor factorizations[J]. Mathematics of Computation, 1987, 177(48):243-264. DOI: 243

IEEE Std-1363-2000: Standard Specifications for Public KeyCryptography[S]. IEEE, DOI: 10. 1109/IEEESTD.2004.94612, 2000.

Walter C D. Simple power analysis of unified code for ECC double and Add[C]//CHES 2004. Springer, Berlin, Heidelberg, 2004(3156): 86-115.

Koblitz N. Elliptic curve cryptosystems [J]. Mathematics of Computation, 1987, 177(48):203-209. DOI: 203

Coron J S. Resistance against differential power analysis for elliptic curvecryptosystems[C]//CHES99, LNCS 1717.Berlin, Springer Verlag, 1999: 292-302.

Lopez J, Dahab R. Fast multiplication on elliptic curves overGF(2m) without precomputation[C]//CHES99 LNCS 1717.Berlin, Springer Verlag, 1999: 316-327.

Miller V S. Use of elliptic curves in cryptography [J].Proceedings of Crypto 85, LNCS 218, Springer, 1986, 19 (3) :173-193. DOI: 173

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A High Speed Structure for Dual -Field Montgomery Modular Multiplication in SM 2

Aerial vehicle detection algorithm based on multi-scale fusion and small-object enhancement

Implementation and verification of a dual-chain power gating strategy for low power design

Simulation on the DC characteristics of double heterojunction p-GaN HEMT with AlN/GaN hybrid buffer layer

Research on the design of blockchain-based AI-generated content traceability framework

Related Author

GUO Xiao

JIANG An-ping

ZONG Yu

Related Institution

Beijing Microelectronics Technology Institute

AI问答

Postal code：100079
Tel：（010）53879206 Email：tmw@bjxintong.com.cn
Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09082226号-64 京公网安备11010602201714号
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰