Co-Z addition formulæ and binary ladders on elliptic curves. (Extended abstract)
From MaRDI portal
Publication:3583441
Recommendations
- \(\text{Co}_-Z\) addition on elliptic curves over finite fields \(\mathrm{GF}(2^m)\)
- Faster Addition and Doubling on Elliptic Curves
- Memory-constrained implementations of elliptic curve cryptography in co-\(Z\) coordinate repre\-sentation
- Faster side-channel resistant elliptic curve scalar multiplication
- New fast algorithms for elliptic curve arithmetic in affine coordinates
Cited in
(7)- \(\text{Co}_-Z\) addition on elliptic curves over finite fields \(\mathrm{GF}(2^m)\)
- Efficient precomputation schemes of \(kP+lQ\)
- Exceptional Procedure Attack on Elliptic Curve Cryptosystems
- Advances in Cryptology - EUROCRYPT 2004
- Compressed Jacobian coordinates for OEF
- Speeding up regular elliptic curve scalar multiplication without precomputation
- Memory-constrained implementations of elliptic curve cryptography in co-\(Z\) coordinate repre\-sentation
This page was built for publication: Co-\(Z\) addition formulæ and binary ladders on elliptic curves. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3583441)