EDSM:secure and efficient scalar multiplication algorithm on Edwards curves
Investigate the secure and efficient algorithm for scalar multiplication on Edwards curves.First,several new addition and doubling formulas were proposed.Analysis shows that our new formulas are more efficient than existed formulas.Then a new scalar multiplication algorithm was forwarded,called EDSM...
Saved in:
Main Authors: | ZHANG Bao-hua1, YIN Xin-chun2, ZHANG Hai-ling2 |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2008-01-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/74654876/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Montgomery algorithm on elliptic curves over finite fields of character three
by: WANG Hong1, et al.
Published: (2008-01-01) -
Chosen message attacks method against ECC implementations
by: Peng LUO, et al.
Published: (2014-05-01) -
Pseudo 4D projective coordinate-based multi-base scalar multiplication
by: Ming XU, et al.
Published: (2018-05-01) -
RFID security authentication scheme based on Montgomery-form elliptic curve cryptography
by: Wumei ZHANG
Published: (2016-05-01) -
Research and simulation of timing attacks on ECC
by: Hui-hui JIA, et al.
Published: (2016-04-01)