High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree
IEEE Transactions on Computers
Computer arithmetic algorithms
Computer arithmetic algorithms
Exponentiation using canonical recoding
Theoretical Computer Science
A course in computational algebraic number theory
A course in computational algebraic number theory
Efficient Exponentiation of a Primitive Root in GF(2m)
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
A survey of fast exponentiation methods
Journal of Algorithms
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Computer Arithmetic: Principles, Architecture and Design
Computer Arithmetic: Principles, Architecture and Design
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Signed Digit Representations of Minimal Hamming Weight
IEEE Transactions on Computers
The Montgomery Inverse and Its Applications
IEEE Transactions on Computers
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Compact Encoding of Non-adjacent Forms with Applications to Elliptic Curve Cryptography
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key 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
Left-to-Right Optimal Signed-Binary Representation of a Pair of Integers
IEEE Transactions on Computers
Analysis of linear combination algorithms in cryptography
ACM Transactions on Algorithms (TALG)
A New Minimal Average Weight Representation for Left-to-Right Point Multiplication Methods
IEEE Transactions on Computers
Analysis of Fractional Window Recoding Methods and Their Application to Elliptic Curve Cryptosystems
IEEE Transactions on Computers
Fast Multicomputation with Asynchronous Strategy
IEEE Transactions on Computers
Theoretical Computer Science
Adaptation of zerotrees using signed binary digit representations for 3D image coding
Journal on Image and Video Processing
On efficient implementation of FPGA-based hyperelliptic curve cryptosystems
Computers and Electrical Engineering
Implementing public-key infrastructure for sensor networks
ACM Transactions on Sensor Networks (TOSN)
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
Unbalanced digit sets and the closest choice strategy for minimal weight integer representations
Designs, Codes and Cryptography
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Symbolic substitution basedcanonical recoding algorithms
Computers & Mathematics with Applications
Secure signed radix-r recoding methods for constrained-embedded devices
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
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 note on the signed sliding window integer recoding and a left-to-right analogue
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
A parallel modular exponentiation scheme for transformed exponents
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
A note on signed binary window algorithm for elliptic curve cryptosystems
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
Sign change fault attacks on elliptic curve cryptosystems
FDTC'06 Proceedings of the Third international conference on Fault Diagnosis and Tolerance in Cryptography
Fast multi-computations with integer similarity strategy
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
New minimal weight representations for left-to-right window methods
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Advances in alternative non-adjacent form representations
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Fractional windows revisited: improved signed-digit representations for efficient exponentiation
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
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
Digit set randomization in elliptic curve cryptography
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
SPA countermeasure based on unsigned left-to-right recodings
ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
A new algorithm for computing triple-base number system
ACM SIGARCH Computer Architecture News
Cryptography with fast point multiplication by using ASCII codes and its implementation
International Journal of Communication Networks and Distributed Systems
| Hi-index | 0.02 |
This paper describes new methods for producing optimal binary signed-digit representations. This can be useful in the fast computation of exponentiations. Contrary to existing algorithms, the digits are scanned from left to right (i.e., from the most significant position to the least significant position). This may lead to better performances in both hardware and software.