Analysis of alternative digit sets for nonadjacent representations
From MaRDI portal
Publication:2494365
DOI10.1007/s00605-005-0364-6zbMath1094.11007OpenAlexW2114765097MaRDI QIDQ2494365
Clemens Heuberger, Prodinger, Helmut
Publication date: 26 June 2006
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00605-005-0364-6
Hausdorff dimensionanalysis of algorithmstransducersnonadjacent formoptimality of digit expansionssigned digit expansion
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Cryptography (94A60) Radix representation; digital problems (11A63) Hausdorff and packing measures (28A78)
Related Items
On \(\alpha \)-greedy expansions of numbers, On the number of optimal base 2 representations of integers, Analysis of the width-\(w\) non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices, Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases, Analysis of width-\(w\) non-adjacent forms to imaginary quadratic bases, Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour, Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication, Higher dimensional quasi-power theorem and Berry-Esseen inequality, The Hamming weight of the non-adjacent-form under various input statistics, Minimal weight and colexicographically minimal integer representations, Minimal weight expansions in Pisot bases, ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS, Matching for random systems with an application to minimal weight expansions, Variances and covariances in the central limit theorem for the output of a transducer
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distribution results for low-weight binary representations for pairs of integers
- On convergence rates in the central limit theorems for combinatorial structures
- Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms
- Minimum weight modified signed-digit representations and fast exponentiation
- Alternative Digit Sets for Nonadjacent Representations
- Progress in Cryptology - INDOCRYPT 2004
- Selected Areas in Cryptography
- On minimal expansions in redundant number systems: Algorithms and quantitative analysis