Fast scalar multiplication for elliptic curves over binary fields by efficiently computable formulas
From MaRDI portal
Publication:1746841
Recommendations
- Efficient scalar multiplication for elliptic curves over binary fields
- scientific article; zbMATH DE number 1612501
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
- Fast point multiplication algorithms for binary elliptic curves with and without precomputation
- New fast algorithms for elliptic curve arithmetic in affine coordinates
Cited in
(11)- Fast multiplication on elliptic curves over small fields of characteristic two
- scientific article; zbMATH DE number 1612501 (Why is no real title available?)
- Fast point multiplication algorithms for binary elliptic curves with and without precomputation
- Efficient scalar multiplication for elliptic curves over binary fields
- Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
- scientific article; zbMATH DE number 1504541 (Why is no real title available?)
- Impact of optimized field operations AB, AC and AB + CD in scalar multiplication over binary elliptic curve
- Differential addition on binary elliptic curves
- Efficient scalar multiplication on Koblitz curves with pre-computation
- A heuristic method of scalar multiplication of elliptic curve over OEF
- Fast elliptic scalar multiplication using new double-base chain and point halving
This page was built for publication: Fast scalar multiplication for elliptic curves over binary fields by efficiently computable formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746841)