Optimal left-to-right binary signed-digit recoding

DOI10.1109/12.863044MaRDI QIDQ3417025zbMATH OpenOpenAlexFDO

Authors Marc Joye, Sung-Ming Yen

Publication date 9 January 2007

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/1b170301b2c4e0fbd9a1dd95c9294e9213551835

zbMATH Keywords

cryptography

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• On optimal binary signed digit representations of integers
• A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-$r$ Representations
• New left-to-right minimal weight signed-digit radix-\(r\) representation
• Optimal Binary Coding of Ordered Numbers
• scientific article; zbMATH DE number 3861075
• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
• Advances in Cryptology – CRYPTO 2004
• Selected Areas in Cryptography
• On binary signed digit representations of integers

Cited in

(23)

• A fast parallel modular exponentiation algorithm
• A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli
• Symbolic substitution based canonical recoding algorithms
• Elliptic curve scalar multiplication algorithm using complementary recoding
• The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
• Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms
• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
• Fast modular multiplication based on complement representation and canonical recoding
• On recoding in arithmetic algorithms
• Feasibility and Practicability of Standardized Cryptography on 4-bit Micro Controllers
• Fast exponentiation by folding the signed-digit exponent in half
• Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques
• Analysis of multi-exponentiation algorithm using binary signed-digit representations
• Speeding up the elliptic curve scalar multiplication using non adjacent form
• On q-quasiadditive and q-quasimultiplicative functions
• Advances in Cryptology – CRYPTO 2004
• New Left-to-Right Radix-r Signed-Digit Recoding Algorithm for Pairing-Based Cryptosystems
• On optimal binary signed digit representations of integers
• Balanced non-adjacent forms
• Unbalanced digit sets and the closest choice strategy for minimal weight integer representations
• An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
• Fast modular multi-exponentiation using modified complex arithmetic
• A low-complexity LUT-based squaring algorithm

This page was built for publication: Optimal left-to-right binary signed-digit recoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3417025)