Pseudo 4D projective coordinate-based multi-base scalar multiplication

Ming XU; Liang SHI

doi:10.11959/j.issn.1000-436x.2018078

您当前的位置：

首页 >

文章列表页 >

Pseudo 4D projective coordinate-based multi-base scalar multiplication

Papers | 更新时间：2024-06-05

- Pseudo 4D projective coordinate-based multi-base scalar multiplication
- Journal on Communications Vol. 39, Issue 5, Pages: 74-84(2018)
- 作者机构：
  
  1. 上海海事大学信息工程学院，上海 201306
  2. 同济大学电子与信息工程学院，上海 201804
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61202370);The China Postdoctoral Science Foundation Projects(2014M561512)
- DOI：10.11959/j.issn.1000-436x.2018078
  CLC： TP393
- Online First：2018-05，
  
  Published：25 May 2018
- 稿件说明：
移动端阅览
Ming XU, Liang SHI. Pseudo 4D projective coordinate-based multi-base scalar multiplication[J]. Journal on Communications, 2018, 39(5): 74-84.
DOI：

Ming XU, Liang SHI. Pseudo 4D projective coordinate-based multi-base scalar multiplication[J]. Journal on Communications, 2018, 39(5): 74-84. DOI： 10.11959/j.issn.1000-436x.2018078.

摘要

针对椭圆曲线密码系统的标量乘运算开销较大和易受能量分析攻击的问题，提出基于伪四维投射坐标的快速群运算和基于伪四维投射坐标的多基链标量乘法，对椭圆曲线密码系统的群运算层和标量乘运算层进行优化，旨在提高椭圆曲线密码系统的整体性能并抵御常见的能量分析攻击。实验表明，与现有算法相比，所提算法离散群运算的倍点运算开销降低 5.71%，三倍点运算开销降低 3.17%，五倍点运算开销降低 8.74%。此外，在密钥长度为160位的情况下，所提算法连续群运算的三倍点运算开销降低36.32%，五倍点运算开销降低17.42%，系统整体开销降低8.70%。能量波形分析表明，所提算法可以有效抵御SPA攻击和DPA攻击。

Abstract

In order to address the problem of elliptic curve cryptosystem (ECC) for the expensive cost in scalar multiplication and the vulnerability to the power analysis attacks

a pseudo 4D projective coordinate-based multi-base scalar multiplication was proposed to optimize group operation layer and scalar multiplication operation layer

which aimed at increasing the performance of ECC and resisting common power analysis attacks.Experimental results show that compared with the state-of-the-art algorithms

the proposed algorithm decreases 5.71% of point doubling cost

3.17% of point tripling cost

and 8.74% of point quintupling cost under discrete group operations.When the key length is 160 bit

the proposed algorithm decreases 36.32% of point tripling cost

17.42% of point quintupling cost

and 8.70% of the system cost under continuous group operations.The analyzing of power consumption wave shows that the proposed algorithm can resist SPA and DPA attack.

关键词

Keywords

references

RIVEST R , SHAMIR A , ADLEMAN L . A method for obtaining digital signatures and public-key cryptosystems [J ] . Communications of the ACM , 1983 , 26 ( 1 ): 96 - 99 .

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

MILLER V . Use of elliptic curves in cryptography [J ] . Lecture Notes in Computer Science , 1985 , 218 ( 1 ): 417 - 426 .

SAQIB N , . Key exchange protocol for WSN resilient against man in the middle attack [C ] // IEEE International Conference on Advances in Computer Applications . 2017 : 265 - 269 .

YEH H L , CHEN T H , SHIH W K . Robust smart card secured authentication scheme on SIP using elliptic curve cryptography [J ] . Computer Standards ＆Interfaces , 2014 , 36 ( 2 ): 397 - 402 .

SHENTU Q C , YU J P . A blind-mixing scheme for bitcoin based on an elliptic curve cryptography blind digital signature algorithm [J ] . Computer Science , 2015 : 1 - 17 .

GUERON S , KRASNOV V . Fast prime field elliptic-curve cryptography with 256-bit primes [J ] . Journal of Cryptographic Engineering , 2015 , 5 ( 2 ): 141 - 151 .

IZU T , TAKAGI T . Exceptional procedure attack on elliptic curve cryptosystems [C ] // International Workshop on Public Key Cryptography-pkc . 2003 : 224 - 239 .

MATHER L , OSWALD E . Pinpointing side-channel information leaks in Web applications [J ] . Journal of Cryptographic Engineering , 2012 , 2 ( 3 ): 161 - 177 .

KOCHER P , . Timing attacks on implementations of Diffie-Hellman,RSA,DSS,and other system [C ] // International Cryptology Conference on Advances in Cryptology . 1996 : 104 - 113 .

MESSERGES T . Using second-order power analysis to attack DPA resistant software [J ] . Springer Berlin Heidelberg , 2000 , 1965 : 238 - 251 .

王敏 , 吴震 . 抗 SPA 攻击的椭圆曲线 NAF 标量乘实现算法 [J ] . 通信学报 , 2012 , 33 ( S1 ): 228 - 232 .

WANG M , WU Z . Algorithm of NAF scalar multiplication on ECC against SPA [J ] . Journal on Communications , 2012 , 33 ( S1 ): 228 - 232 .

MAMIYA H , MIYAJI A , MORIMOTO H . Efficient countermeasures against RPA,DPA,and SPA [J ] . Springer Berlin Heidelberg , 2014 , 3156 : 343 - 356 .

MISHRA P , DIMITROV V . Efficient quintuple formulas for elliptic curves and efficient scalar multiplication using multibase number representation [C ] // International Conference on Information Security . 2007 : 390 - 406 .

DANGER J , GUILLEY S , HOOGVORST P , et al . Improving the big mac attack on elliptic curve cryptography [J ] . Springer Berlin Heidelberg , 2016 : 374 - 386 .

LI L , LI S . High-performance pipelined architecture of elliptic curve scalar multiplication over GF(2m) [J ] . IEEE Transactions on Very Large Scale Integration Systems , 2016 , 24 ( 4 ): 1223 - 1232 .

DUBEUF J , HELY D , BEROULLE V . ECDSA passive attacks,leakage sources,and common design mistakes [J ] . ACM Transactions on Design Automation of Electronic Systems , 2016 , 21 ( 2 ): 1 - 24 .

LIU Z , HUANG X , HU Z , et al . On emerging family of elliptic curves to secure Internet of Things:ECC comes of age [J ] . IEEE Transactions on Dependable ＆ Secure Computing , 2017 , 14 ( 3 ): 237 - 248 .

MELONI N , HASAN M . Efficient double bases for scalar multiplication [J ] . IEEE Transactions on Computers , 2015 , 64 ( 8 ): 2204 - 2212 .

CHO S , GWAL S , CHANG H K , et al . Faster elliptic curve arithmetic for triple-base chain by reordering sequences of field operations [J ] . Multimedia Tools ＆Applications , 2016 : 1 - 13 .

PUROHIT G , RAWAT A . Elliptic curve point multiplication using MBNR and point halving [J ] . International Journal of Advanced Networking ＆ Applications , 2012 : 1329 - 1337 .

PAAR C , PELZL J . Understanding cryptography [J ] . Springer Berlin Heidelberg , 2010 : 519 - 551 .

HASAN AE , REYHANIMASOLEH A . New regular radix-8 scheme for elliptic curve scalar multiplication without pre-computation [J ] . IEEE Transactions on Computers , 2013 , 64 ( 2 ): 438 - 451 .

BERNSTEIN D , CHUENGSATIANSUP C , LANGE T . Double-base scalar multiplication revisited [R ] . IACR Cryptology ePrint Archive , 2017 : 1 - 38 .

O’FLYNN C , CHEN Z . ChipWhisperer:an open-source platform for hardware embedded security research [C ] // International Workshop on Constructive Side-Channel Analysis and Secure Design . 2014 : 243 - 260 .

Views

1927

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Power analysis attack of dynamic password token based on SM3

Mutual information power analysis attack of HMAC based on SM3

Improved chosen-plaintext power analysis attack against SM4 at the round-output

Chosen-plaintext power analysis attack against SMS4 with the round-output as the intermediate data

Related Author

Jin-tao RAO

Min WANG

Zhen WU

Zhi-bo DU

Ling-hao ZHANG

Sheng WANG

Min WANG

Jin-tao RAO

Related Institution

College of Information Security Engineering,Chengdu University of Information Technology

State Grid Sichuan Electric Power Research Institute

College of Electronics and Information Engineering,Sichuan University

School of Information Security Engineering,Chengdu University of Information Technology

AI问答

⁰