Efficient scalar multiplication for elliptic curves over binary fields
From MaRDI portal
Recommendations
- Fast scalar multiplication for elliptic curves over binary fields by efficiently computable formulas
- scientific article; zbMATH DE number 7120855
- Integer decomposition for fast scalar multiplication on elliptic curves
- Efficient scalar multiplications on elliptic curves without repeated doublings and their practical performance
- An Improved Binary Method for Scalar Multiplication in Elliptic Curve Cryptography
- scientific article; zbMATH DE number 2219248
- Efficient point multiplication for elliptic curves over special optimal extension fields
- scientific article; zbMATH DE number 708816
- Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
Cites work
- An improved implementation of elliptic curves over GF(2) when using projective point arithmetic
- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
- Efficient arithmetic on Koblitz curves
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- The double-base number system and its application to elliptic curve cryptography
Cited in
(11)- Fast scalar multiplication for elliptic curves over binary fields by efficiently computable formulas
- Efficient systolic multiplications in composite fields for cryptographic systems
- Trading inversions for multiplications in elliptic curve cryptography
- scientific article; zbMATH DE number 5845550 (Why is no real title available?)
- An Improved Binary Method for Scalar Multiplication in Elliptic Curve Cryptography
- Efficient Linear Array for Multiplication over NIST Recommended Binary Fields
- On the power of multidoubling in speeding up elliptic scalar multiplication
- Impact of optimized field operations AB, AC and AB + CD in scalar multiplication over binary elliptic curve
- Public Key Cryptography - PKC 2006
- d-MUL: optimizing and implementing a multidimensional scalar multiplication algorithm over elliptic curves
- A heuristic method of scalar multiplication of elliptic curve over OEF
This page was built for publication: Efficient scalar multiplication for elliptic curves over binary fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3403217)