Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools

DOI10.1016/J.IPL.2021.106226OpenAlexW3216643922MaRDI QIDQ2059909FDOQ2059909

Authors: Vorapong Suppakitpaisarn 

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106226

zbMATH Keywords

analysis of algorithmsasymptotic analysisdouble-base number system

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• The double-base number system and its application to elliptic curve cryptography
• A Method for the Construction of Minimum-Redundancy Codes
• Lower bounds on the lengths of double-base representations
• Scalar Multiplication on Koblitz Curves Using Double Bases
• Extending Scalar Multiplication Using Double Bases
• On the minimal Hamming weight of a multi-base representation
• On the expansion length of triple-base number systems
• Progress in Cryptology – Mycrypt 2005

This page was built for publication: Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2059909)