Efficient elliptic curve exponentiation using mixed coordinates
Elliptic curve cryptosystems are becoming increasingly used in practical applications since they offer improved performance and reduced bandwidth and memory. Central to this industrial interest is the fact that a number of ways exist to significantly improve the performance of such systems. This paper describes another such way. The authors describe four coordinate systems for points on an elliptic curve, namely Affine, Projective, Jacobian and Chudnovsky. Then using these coordinate systems they describe ways to implement the essential cryptographic operation of point multiplication. This is done using a novel combination of the four coordinate systems, which they dub ``mixed coordinates. The paper is well written and gives a number of examples and explicit formulae which will be useful to engineers working in this area who often find the mathematics in some papers quite duanting. Overall the authors report an improvement of twenty five percent in the performance of the final system. Although the paper describes the details in terms of curves over finite fields of large prime characteristic, it is clear that a similar mixed coordinate system works in fields of even characteristic as well. For the entire collection see [Zbl 0898.00038].
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
- Formulae for arithmetic on genus 2 hyperelliptic curves
- New fast algorithms for elliptic curve arithmetic in affine coordinates
- Double-base chains for scalar multiplications on elliptic curves
- The complete cost of cofactor \(h=1\)
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- Invariant measures, matching and the frequency of 0 for signed binary expansions
- Fast elliptic curve point multiplication based on window non-adjacent form method
- On binary signed digit representations of integers
- Power attacks on a side-channel resistant elliptic curve implementation
- Exploiting collisions in addition chain-based exponentiation algorithms using a single trace
- Improving the Big Mac attack on elliptic curve cryptography
- Safe-errors on SPA protected implementations with the atomicity technique
- Compressed Jacobian coordinates for OEF
- Twisted Hessian curves
- Improved precomputation scheme for scalar multiplication on elliptic curves
- Faster Pairings on Special Weierstrass Curves
- Fast Point Multiplication on Elliptic Curves without Precomputation
- Twisted Edwards Curves Revisited
- Jacobi Quartic Curves Revisited
- scientific article; zbMATH DE number 2160554 (Why is no real title available?)
- A novel elliptic curve scalar multiplication algorithm against power analysis
- Matching for random systems with an application to minimal weight expansions
- Эллиптическая пороговая схема разделения секрета
- Faster Addition and Doubling on Elliptic Curves
- The double-base number system and its application to elliptic curve cryptography
- New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
- Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System
- Toric forms of elliptic curves and their arithmetic
- Minimality and other properties of the width-𝑤 nonadjacent form
- A note on inverted twisted Edwards curve
- A formula for disaster: a unified approach to elliptic curve special-point-based attacks
- Fast and simple point operations on Edwards448 and E448
- Polymath: Groth16 is not the limit
This page was built for publication: Efficient elliptic curve exponentiation using mixed coordinates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249254)
