Optimal left-to-right binary signed-digit recoding

DOI10.1109/12.863044zbMath1300.94069OpenAlexW2137393540MaRDI QIDQ3417025

Sung-Ming Yen, Marc Joye

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

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

Related Items (20)

Feasibility and Practicability of Standardized Cryptography on 4-bit Micro Controllers ⋮ A fast parallel modular exponentiation algorithm ⋮ Elliptic curve scalar multiplication algorithm using complementary recoding ⋮ Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form ⋮ An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques ⋮ Fast modular multi-exponentiation using modified complex arithmetic ⋮ Balanced non-adjacent forms ⋮ On \(q\)-quasiadditive and \(q\)-quasimultiplicative functions ⋮ Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques ⋮ A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli ⋮ ANALYSIS OF MULTI-EXPONENTIATION ALGORITHM USING BINARY SIGNED-DIGIT REPRESENTATIONS ⋮ A low-complexity LUT-based squaring algorithm ⋮ On optimal binary signed digit representations of integers ⋮ Symbolic substitution based canonical recoding algorithms ⋮ Fast modular multiplication based on complement representation and canonical recoding ⋮ Unbalanced digit sets and the closest choice strategy for minimal weight integer representations ⋮ Fast exponentiation by folding the signed-digit exponent in half ⋮ 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

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