Minimal weight and colexicographically minimal integer representations

DOI10.1515/jmc.2007.015zbMath1161.11002OpenAlexW2005895372MaRDI QIDQ5443565

Clemens Heuberger, James A. Muir

Publication date: 21 February 2008

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc.2007.015

zbMATH Keywords

asymptotic normalitycryptosystemsredundant number systemminimal weight representationscolexicographically minimal representations

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Cryptography (94A60) Radix representation; digital problems (11A63)

Related Items (3)

Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour ⋮ Unbalanced digit sets and the closest choice strategy for minimal weight integer representations ⋮ Output sum of transducers: limiting distribution and periodic fluctuation

Cites Work

• Distribution results for low-weight binary representations for pairs of integers
• On convergence rates in the central limit theorems for combinatorial structures
• Analysis of alternative digit sets for nonadjacent representations
• Analysis of linear combination algorithms in cryptography
• Fractional Windows Revisited:Improved Signed-Digit Representations for Efficient Exponentiation
• Continuous Dependence of Solutions of Ordinary Differential Equations
• Minimality and other properties of the width-𝑤 nonadjacent form

This page was built for publication: Minimal weight and colexicographically minimal integer representations