Unbalanced digit sets and the closest choice strategy for minimal weight integer representations

DOI10.1007/s10623-009-9276-0zbMath1220.11008OpenAlexW2161771823MaRDI QIDQ735022

James A. Muir, Clemens Heuberger

Publication date: 14 October 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-009-9276-0

Mathematics Subject Classification ID

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

Related Items

On the minimal Hamming weight of a multi-base representation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast multiplication on elliptic curves over small fields of characteristic two
• Efficient arithmetic on Koblitz curves
• The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
• Analysis of linear combination algorithms in cryptography
• Optimal left-to-right binary signed-digit recoding
• A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-$r$ Representations
• Speeding up the computations on an elliptic curve using addition-subtraction chains
• Advances in Cryptology – CRYPTO 2004
• Minimal weight and colexicographically minimal integer representations
• Selected Areas in Cryptography
• Topics in Cryptology – CT-RSA 2005
• A SIGNED BINARY MULTIPLICATION TECHNIQUE