An improved algorithm for arithmetic on a family of elliptic curves
Applications in cryptography on elliptic curves over finite fields are based on integer multiples \(nP\) of a point \(P\) on the curve. The author discusses efficiency improvements of this scalar multiplication. These speedups originate from the following facts. i) One can choose the elliptic curve and the field of constants over which the curve is defined in an appropriate way. ii) Subtraction and addition on elliptic curves are equally efficient. iii) Elliptic curves over finite fields have endomorphisms which are not scalar multiplications. A very important one is the Frobenius endomorphism. The author considers the elliptic curves in characteristic 2 given by \[ y^2+ y= x+ \tfrac 1x+a \] with \(a=0\), \(1\in \mathbb{F}_2\). The representation of \(n\) using ii) and iii) combined with precomputation and storage yields a considerable efficiency improvement of scalar multiplication on the above-mentioned elliptic curves. For the entire collection see [Zbl 0870.00047].
- Non-commutative digit expansions for arithmetic on supersingular elliptic curves
- Koblitz curve cryptosystems
- Analysis of width-w non-adjacent forms to imaginary quadratic bases
- Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves
- Symmetric digit sets for elliptic curve scalar multiplication without precomputation
- Koblitz curves over quadratic fields
- Existence and optimality of \(w\)-non-adjacent forms with an algebraic integer base
- Efficient arithmetic on elliptic curves in characteristic 2
- An Improvement of the Elliptic Net Algorithm
- scientific article; zbMATH DE number 2085439 (Why is no real title available?)
- Efficient arithmetic on subfield elliptic curves over small finite fields of odd characteristic
- Endomorphisms on elliptic curves for optimal subspaces and applications to differential equations and nonlinear cryptography
- Analysis of the width-w non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices
- Optimality of the width-w non-adjacent form: general characterisation and the case of imaginary quadratic bases
- scientific article; zbMATH DE number 708816 (Why is no real title available?)
- scientific article; zbMATH DE number 1116612 (Why is no real title available?)
- scientific article; zbMATH DE number 1950618 (Why is no real title available?)
- scientific article; zbMATH DE number 2009969 (Why is no real title available?)
- Improving the parallelized Pollard lambda search on anomalous binary curves
- Non-minimality of the width-\(w\) non-adjacent form in conjunction with trace one \(\tau\)-adic digit expansions and Koblitz curves in characteristic two
- Koblitz Curves and Integer Equivalents of Frobenius Expansions
- The GPS Identification Scheme Using Frobenius Expansions
- Improved Tripling on Elliptic Curves
- Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour
- On the distribution of the coefficients of normal forms for Frobenius expansions
- Analysis of low Hamming weight products
This page was built for publication: An improved algorithm for arithmetic on a family of elliptic curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4364563)
