On Montgomery-like representations for elliptic curves over GF(2ᵏ)
From MaRDI portal
Publication:4414712
Recommendations
- Differential addition on binary elliptic curves
- Fast multiplication on elliptic curves over GF(2ᵐ) without precomputation
- Efficient arithmetic on elliptic curves in characteristic 2
- Faster Addition and Doubling on Elliptic Curves
- Efficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery of the y-coordinate on a Montgomery-form elliptic curve
Cited in
(7)- The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines
- Arithmetic of the level four theta model of elliptic curves
- Binary Huff Curves
- Montgomery Ladder for All Genus 2 Curves in Characteristic 2
- Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves
- Binary Kummer line
- Kummer and Hessian meet in the field of characteristic 2
This page was built for publication: On Montgomery-like representations for elliptic curves over \(\mathrm{GF}(2^k)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414712)