Efficient Scalar Multiplication of ECC Using Lookup Table and Fast Repeating Point Doubling
Reducing the computation time of scalar multiplication for elliptic curve cryptography is a significant challenge. This study proposes an efficient scalar multiplication method for elliptic curves over finite fields <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML"...
Saved in:
| Main Authors: | Fu-Jung Kan, Yan-Haw Chen, Jeng-Jung Wang, Chong-Dao Lee |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-03-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/6/924 |
| 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) -
An Improved GN-AK Protocol Using Double-Base Scalar Multiplication and Point Halving over Elliptic Curves
by: Nicolae Constantinescu, et al.
Published: (2025-07-01) -
Area-Time-Efficient Secure Comb Scalar Multiplication Architecture Based on Recoding
by: Zhantao Zhang, et al.
Published: (2024-10-01) -
An ECC-Based Anonymous and Fast Handover Authentication Protocol for Internet of Vehicles
by: Yiming Kong, et al.
Published: (2025-05-01) -
Montgomery algorithm on elliptic curves over finite fields of character three
by: WANG Hong1, et al.
Published: (2008-01-01)