Speeding up Huff form of elliptic curves
Loading...
Date
2018
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
SPRINGER
Open Access Color
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
Abstract
This paper presents faster inversion-free point addition formulas for the curve y(1+ ax2) = cx(1+ dy2). The proposed formulas improve the point doubling operation count record (I M S D a are arithmetic operations over a field. I: inversion M: multiplication S: squaring D: multiplication by a curve constant a: addition/ subtraction) from 6M + 5S to 8M and mixed addition operation count record from 10M to 8M. Both sets of formulas are shown to be 4-way parallel leading to an effective cost of 2M per either of the group operations.
Description
ORCID
Keywords
Elliptic curves, 2-Isogeny, Efficient, Scalar multiplication, Huff curves, Inversion-free point addition, Parallel computation, TWISTED EDWARDS CURVES, MODEL, Parallel Computation, Efficient, Huff Curves, Inversion-Free Point Addition, 2-isogeny, Scalar Multiplication, Elliptic Curves, Data encryption (aspects in computer science), Algebraic coding theory; cryptography (number-theoretic aspects), inversion-free point addition, Applications to coding theory and cryptography of arithmetic geometry, efficient, 2-isogeny, Cryptography, elliptic curves, Elliptic curves, scalar multiplication, Huff curves, parallel computation
Fields of Science
0102 computer and information sciences, 01 natural sciences, 0101 mathematics
Citation
WoS Q
Scopus Q
OpenCitations Citation Count
5
Source
Designs, Codes and Cryptography
Volume
86
Issue
12
Start Page
2807
End Page
2823
PlumX Metrics
Citations
Scopus : 6
Captures
Mendeley Readers : 17
Google Scholar™
