Symmetric digit sets for elliptic curve scalar multiplication without precomputation
From MaRDI portal
Publication:2253194
DOI10.1016/j.tcs.2014.06.010zbMath1416.11170OpenAlexW1990726648WikidataQ41986764 ScholiaQ41986764MaRDI QIDQ2253194
Clemens Heuberger, Michela Mazzoli
Publication date: 25 July 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.010
Gaussian integersFrobenius endomorphismEisenstein integerselliptic curve scalar multiplicationinteger digit expansionwidth-\(w\) non-adjacent form
Analysis of algorithms (68W40) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
Cites Work
- Number expansions in lattices
- Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication
- Efficient algorithms for Koblitz curves over fields of characteristic three
- Efficient arithmetic on Koblitz curves
- Faster and Lower Memory Scalar Multiplication on Supersingular Curves in Characteristic Three
- Basic digit sets for radix representation
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item