Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations
IEEE Transactions on Computers
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Redundant Integer Representations and Fast Exponentiation
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
Efficient Exponentiation of a Primitive Root in GF(2m)
IEEE Transactions on Computers
A family of network topologies with multiple loops and logarithmic diameter
Parallel Computing
Closed-Form Expression for the Average Weight of Signed-Digit Representations
IEEE Transactions on Computers
Complexity and Fast Algorithms for Multiexponentiations
IEEE Transactions on Computers
Optimal Left-to-Right Binary Signed-Digit Recoding
IEEE Transactions on Computers - Special issue on computer arithmetic
An Improved Implementation of Elliptic Curves over GF(2) when Using Projective Point Arithmetic
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
New Minimal Modified Radix-r Representation with Applications to Smart Cards
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Minimal Weight Digit Set Conversions
IEEE Transactions on Computers
Fast Multicomputation with Asynchronous Strategy
IEEE Transactions on Computers
Computers and Electrical Engineering
Adaptation of zerotrees using signed binary digit representations for 3D image coding
Journal on Image and Video Processing
Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
International Journal of Computer Mathematics
Information Sciences: an International Journal
New left-to-right minimal weight signed-digit radix-r representation
Computers and Electrical Engineering
A low-complexity LUT-based squaring algorithm
Computers & Mathematics with Applications
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
High-level synthesis algorithm for the design of reconfigurable constant multiplier
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An analysis of exponentiation based on formal languages
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
New left-to-right radix-r signed-digit recoding algorithm for pairing-based cryptosystems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
wNAF, an efficient left-to-right signed digit recoding algorithm
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
A parallel modular exponentiation scheme for transformed exponents
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
A loopless gray code for minimal signed-binary representations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A note on signed binary window algorithm for elliptic curve cryptosystems
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
Fast multi-computations with integer similarity strategy
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Atomicity improvement for elliptic curve scalar multiplication
CARDIS'10 Proceedings of the 9th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Application
Operand folding hardware multipliers
Cryptography and Security
Modular arithmetic and fast algorithm designed for modern computer security applications
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part III
Information Sciences: an International Journal
| Hi-index | 15.00 |
The authors give an online algorithm for computing a canonical signed digit representation of minimal Hamming weight for any integer n. Using combinatorial techniques, the probability distributions Pr(K/sub r/=h), where K/sub r/ is taken to be a random variable on the uniform probability space of k-digit integers is computed. Also, using a Markov chain analysis, it is shown that E(K/sub r/) approximately (r-1)k/(r+1) as k to infinity.