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"...

Full description

Saved in:
Bibliographic Details
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!