Montgomery algorithm on elliptic curves over finite fields of character three
Application of Montgomery algorithm on elliptic curves defined over finite fields of character three was re-searched.Due to the structure of Montgomery algorithm,y-coordinate was ignored,a new formula to compute point ad-dition and point doubling was proposed to accelerate the scalar point multiplic...
Saved in:
Main Authors: | WANG Hong1, LI Bao1, YU Wei2 |
---|---|
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/74654028/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
EDSM:secure and efficient scalar multiplication algorithm on Edwards curves
by: ZHANG Bao-hua1, et al.
Published: (2008-01-01) -
RFID security authentication scheme based on Montgomery-form elliptic curve cryptography
by: Wumei ZHANG
Published: (2016-05-01) -
The SPN Network for Digital Audio Data Based on Elliptic Curve Over a Finite Field
by: Ijaz Khalid, et al.
Published: (2022-01-01) -
An efficient method to generate elliptic curves
by: ZHOU Chang-ying1, et al.
Published: (2001-01-01) -
Chosen message attacks method against ECC implementations
by: Peng LUO, et al.
Published: (2014-05-01)