On the Expansion Length Of Triple-Base Number Systems

DOI10.1007/978-3-642-38553-7_25zbMath1312.94104OpenAlexW1008670429MaRDI QIDQ4924701

Wei Yu, Kun-Peng Wang, Song Tian, Bao Li

Publication date: 7 June 2013

Published in: Progress in Cryptology – AFRICACRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38553-7_25

zbMATH Keywords

upper boundgreedy algorithmelliptic curve cryptographyuniversal exponenttriple-base number system

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Other number representations (11A67)

Related Items (2)

On the minimal Hamming weight of a multi-base representation ⋮ Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools

This page was built for publication: On the Expansion Length Of Triple-Base Number Systems