Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains

DOI10.1007/11593447_4zbMath1154.94388OpenAlexW1487297807MaRDI QIDQ5451064

Pradeep Kumar Mishra, Laurent Imbert, Vassil S. Dimitrov

Publication date: 18 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11593447_4

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (24)

A Duality in Space Usage between Left-to-Right and Right-to-Left Exponentiation ⋮ Dynamical directions in numeration ⋮ Multibase scalar multiplications in cryptographic pairings ⋮ Hardware realization of fast elliptic curve point multiplication using balanced ternary representation and pre-computation overGF(p) ⋮ Fast elliptic scalar multiplication using new double-base chain and point halving ⋮ Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods ⋮ Efficient scalar multiplication on Koblitz curves with pre-computation ⋮ A Tree-Based Approach for Computing Double-Base Chains ⋮ Bounds and trade-offs for double-base number systems ⋮ Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis ⋮ Efficient Tate pairing computation using double-base chains ⋮ 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 ⋮ О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых видов координат ⋮ A Graph Theoretic Analysis of Double Base Number Systems ⋮ Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication ⋮ Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System ⋮ Double-Base Number System for Multi-scalar Multiplications ⋮ Double-base chains for scalar multiplications on elliptic curves ⋮ Faster cofactorization with ECM using mixed representations ⋮ Lower bounds on the lengths of double-base representations ⋮ Speeding Up the Double-Base Recoding Algorithm of Scalar Multiplication∗ ⋮ Efficient scalar multiplication for elliptic curves over binary fields ⋮ Fast elliptic curve point multiplication based on window non-adjacent form method

This page was built for publication: Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains