Pages that link to "Item:Q3417025"
From MaRDI portal
The following pages link to Optimal left-to-right binary signed-digit recoding (Q3417025):
Displayed 20 items.
- On \(q\)-quasiadditive and \(q\)-quasimultiplicative functions (Q521389) (← links)
- On optimal binary signed digit representations of integers (Q551451) (← links)
- Unbalanced digit sets and the closest choice strategy for minimal weight integer representations (Q735022) (← links)
- An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques (Q870135) (← links)
- Fast modular multi-exponentiation using modified complex arithmetic (Q884549) (← links)
- A low-complexity LUT-based squaring algorithm (Q971658) (← links)
- A fast parallel modular exponentiation algorithm (Q1640600) (← links)
- A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli (Q1763231) (← links)
- Symbolic substitution based canonical recoding algorithms (Q1779586) (← links)
- Elliptic curve scalar multiplication algorithm using complementary recoding (Q2383732) (← links)
- The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography (Q2566002) (← links)
- Minimal expansions in redundant number systems: Fibonacci bases and greedy algorithms (Q2567414) (← links)
- Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation (Q2570694) (← links)
- Fast modular multiplication based on complement representation and canonical recoding (Q3066940) (← links)
- Feasibility and Practicability of Standardized Cryptography on 4-bit Micro Controllers (Q3455499) (← links)
- Fast exponentiation by folding the signed-digit exponent in half (Q4462117) (← links)
- Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques (Q4652740) (← links)
- ANALYSIS OF MULTI-EXPONENTIATION ALGORITHM USING BINARY SIGNED-DIGIT REPRESENTATIONS (Q4924256) (← links)
- Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form (Q5069746) (← links)
- Balanced non-adjacent forms (Q6157562) (← links)