Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
DOI10.4213/MVK24zbMATH Open1472.11196OpenAlexW2793289646MaRDI QIDQ4959009FDOQ4959009
Authors: O. N. Vasilenko 
Publication date: 15 September 2021
Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/mvk24
Recommendations
- The double-base number system and its application to elliptic curve cryptography
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
- Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation
- New fast algorithms for elliptic curve arithmetic in affine coordinates
- Analysis and optimization of elliptic-curve single-scalar multiplication
elliptic curvescomputational algorithmsdouble-base number systemelliptic curve point-by-scalar multiplication
Cites Work
- Twisted Edwards Curves
- Title not available (Why is that?)
- Faster Addition and Doubling on Elliptic Curves
- Public Key Cryptography - PKC 2006
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- A normal form for elliptic curves
- Advances in Elliptic Curve Cryptography
- Title not available (Why is that?)
- An algorithm for modular exponentiation.
- Inverted Edwards Coordinates
- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
- Title not available (Why is that?)
- Number-theoretic algorithms in cryptography. Transl. from the Russian by A. Martsinkovsky
- On the Evaluation of Powers
- Title not available (Why is that?)
- New Formulae for Efficient Elliptic Curve Arithmetic
- Title not available (Why is that?)
- Trading inversions for multiplications in elliptic curve cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extending Scalar Multiplication Using Double Bases
- Jacobi Quartic Curves Revisited
- Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
- Title not available (Why is that?)
- Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication
- Double-Base Number System for Multi-scalar Multiplications
- Extended Double-Base Number System with Applications to Elliptic Curve Cryptography
- Improving the arithmetic of elliptic curves in the Jacobi model
- A Tree-Based Approach for Computing Double-Base Chains
- Elliptic Curve Scalar Multiplication Combining Yao’s Algorithm and Double Bases
- A note on López-Dahab coordinates
Cited In (6)
- New schemes for sharing points on an elliptic curve
- The double-base number system and its application to elliptic curve cryptography
- New Point Addition Formulae for ECC Applications
- A New Double Point Multiplication Algorithm and Its Application to Binary Elliptic Curves with Endomorphisms
- Analysis and optimization of elliptic-curve single-scalar multiplication
- Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation
Uses Software
This page was built for publication: Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959009)
