Elliptic scalar multiplication using point halving
From MaRDI portal
Recommendations
Cited in
(17)- Extractors for binary elliptic curves
- The trace spectra of polynomial bases for \(\mathbb F_{2^n}\)
- On the polynomial basis of \(\mathrm{GF}(2^n)\) having a small number of trace-one elements
- Speeding up elliptic curve discrete logarithm computations with point halving
- Koblitz curves over quadratic fields
- An efficient deterministic test for Kloosterman sum zeros
- Elliptic curve scalar multiplication with x-coordinate
- Faster Halvings in Genus 2
- Determining the $2$-Sylow subgroup of an elliptic curve over a finite field
- Improving ECDLP computation in characteristic 2
- Information Security and Privacy
- Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic
- Public Key Cryptography – PKC 2004
- Halving for the 2-Sylow subgroup of genus 2 curves over binary fields
- Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication
- A prime-order group with complete formulas from even-order elliptic curves
- Fast elliptic scalar multiplication using new double-base chain and point halving
This page was built for publication: Elliptic scalar multiplication using point halving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4502494)