The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography

DOI10.1016/j.tcs.2005.03.050zbMath1071.94012OpenAlexW2074152152MaRDI QIDQ2566002

Clemens Heuberger, Rajendra Katti, Xiaoyu Ruan, Prodinger, Helmut

Publication date: 22 September 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.050

zbMATH Keywords

Public-key cryptographyJoint expansionLeft-to-right algorithmSigned digit expansion

Mathematics Subject Classification ID

Cryptography (94A60) Radix representation; digital problems (11A63)

Related Items (3)

Dynamical directions in numeration ⋮ Minimality and other properties of the width-𝑤 nonadjacent form ⋮ Unbalanced digit sets and the closest choice strategy for minimal weight integer representations

Cites Work

• 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
• Analysis of linear combination algorithms in cryptography
• Optimal left-to-right binary signed-digit recoding
• SUBBLOCK OCCURRENCES IN SIGNED DIGIT REPRESENTATIONS
• Selected Areas in Cryptography
• Topics in Cryptology – CT-RSA 2005
• A SIGNED BINARY MULTIPLICATION TECHNIQUE

This page was built for publication: The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography