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

DOI10.1016/J.IPL.2021.106226MaRDI QIDQ2059909OpenAlexFDO

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)

Recommendations

• A Graph Theoretic Analysis of Double Base Number Systems
• Bounds and trade-offs for double-base number systems
• A combinatorial interpretation of double base number system and some consequences
• On the enumeration of double-base chains with applications to elliptic curve cryptography
• Lower bounds on the lengths of double-base representations

Cites work

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

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)