Signed binary representations revisited
From MaRDI portal
Recommendations
Cited in
(17)- Carry propagation in signed digit representations
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
- Signed bits and fast exponentiation
- Fast elliptic curve point multiplication based on window non-adjacent form method
- Elliptic curve scalar multiplication algorithm using complementary recoding
- A duality in space usage between left-to-right and right-to-left exponentiation
- Optimal left-to-right binary signed-digit recoding
- Scalar recoding and regular \(2^w\)-ary right-to-left EC scalar multiplication algorithm
- Fractional Windows Revisited:Improved Signed-Digit Representations for Efficient Exponentiation
- Low-weight JSF\(_3\) representations for pairs of integers
- Selected Areas in Cryptography
- On optimal binary signed digit representations of integers
- Minimality and other properties of the width-𝑤 nonadjacent form
- On the zero-run length of a signed binary representation
- Non-standard binary representations and the Stern sequence
- Unbalanced digit sets and the closest choice strategy for minimal weight integer representations
- Fast simultaneous scalar multiplication
This page was built for publication: Signed binary representations revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311563)