Extending Scalar Multiplication Using Double Bases

DOI10.1007/11935230_9zbMath1172.94558OpenAlexW2102308384MaRDI QIDQ5459075

Francesco Sica, Christophe Doche, Vassil S. Dimitrov, Roberto M. Avanzi

Publication date: 24 April 2008

Published in: Advances in Cryptology – ASIACRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11935230_9

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Complex multiplication and moduli of abelian varieties (11G15)

Related Items (16)

Sublinear Scalar Multiplication on Hyperelliptic Koblitz Curves ⋮ Analysis on Yu et al.'s dynamic algorithm for canonic DBC ⋮ Efficient scalar multiplication on Koblitz curves with pre-computation ⋮ A Tree-Based Approach for Computing Double-Base Chains ⋮ Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication ⋮ Secure simultaneous bit extraction from Koblitz curves ⋮ On the minimal Hamming weight of a multi-base representation ⋮ The double-base number system and its application to elliptic curve cryptography ⋮ О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых видов координат ⋮ A Graph Theoretic Analysis of Double Base Number Systems ⋮ Double-Base Number System for Multi-scalar Multiplications ⋮ Double-base chains for scalar multiplications on elliptic curves ⋮ Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited ⋮ Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools ⋮ Lower bounds on the lengths of double-base representations ⋮ Speeding Up the Double-Base Recoding Algorithm of Scalar Multiplication∗

This page was built for publication: Extending Scalar Multiplication Using Double Bases