New Point Addition Formulae for ECC Applications
From MaRDI portal
Recommendations
- New fast algorithms for elliptic curve arithmetic in affine coordinates
- Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
- A fast and secure elliptic curve scalar multiplication algorithm based on special addition chains
- Efficient arithmetic on elliptic curves in characteristic 2
- Elliptic Curve Scalar Multiplication Combining Yao’s Algorithm and Double Bases
Cited in
(12)- Speeding up regular elliptic curve scalar multiplication without precomputation
- Jacobian coordinates on genus 2 curves
- Memory-constrained implementations of elliptic curve cryptography in co-Z coordinate repre\-sentation
- Random Euclidean addition chain generation and its application to point multiplication
- Improved precomputation scheme for scalar multiplication on elliptic curves
- Efficient precomputation schemes of \(kP+lQ\)
- Small scalar multiplication on Weierstrass curves using division polynomials
- \(\text{Co}_-Z\) addition on elliptic curves over finite fields \(\mathrm{GF}(2^m)\)
- A formula for disaster: a unified approach to elliptic curve special-point-based attacks
- New versions of Miller-loop secured against side-channel attacks
- Space-efficient and noise-robust quantum factoring
- Space-efficient and noise-robust quantum factoring
This page was built for publication: New Point Addition Formulae for ECC Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5426090)
