Unbalanced digit sets and the closest choice strategy for minimal weight integer representations
From MaRDI portal
(Redirected from Publication:735022)
Recommendations
Cites work
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 2114384 (Why is no real title available?)
- scientific article; zbMATH DE number 6469145 (Why is no real title available?)
- A SIGNED BINARY MULTIPLICATION TECHNIQUE
- A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-$r$ Representations
- Advances in Cryptology – CRYPTO 2004
- Analysis of linear combination algorithms in cryptography
- Efficient arithmetic on Koblitz curves
- Fast multiplication on elliptic curves over small fields of characteristic two
- Minimal weight and colexicographically minimal integer representations
- Optimal left-to-right binary signed-digit recoding
- Selected Areas in Cryptography
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
- Topics in Cryptology – CT-RSA 2005
Cited in
(7)- A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-$r$ Representations
- Selected Areas in Cryptography
- On the minimal Hamming weight of a multi-base representation
- Analysis of alternative digit sets for nonadjacent representations
- Calculating average joint Hamming weight for minimal weight conversion of \(d\) integers
- Minimal expansions in redundant number systems and shortest paths in graphs
- Minimal weight and colexicographically minimal integer representations
This page was built for publication: Unbalanced digit sets and the closest choice strategy for minimal weight integer representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735022)