Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Exponentiation using canonical recoding
Theoretical Computer Science
A course in computational algebraic number theory
A course in computational algebraic number theory
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
Efficient Arithmetic on Koblitz Curves
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Optimal Left-to-Right Binary Signed-Digit Recoding
IEEE Transactions on Computers - Special issue on computer arithmetic
Signed Digit Representations of Minimal Hamming Weight
IEEE Transactions on Computers
Efficient elliptic curve exponentiation
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
An Improved Algorithm for Arithmetic on a Family of Elliptic Curves
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
On the Performance of Signature Schemes Based on Elliptic Curves
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Minimal Weight Digit Set Conversions
IEEE Transactions on Computers
The Complexity of Certain Multi-Exponentiation Techniques in Cryptography
Journal of Cryptology
Improved techniques for fast exponentiation
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
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
New minimal weight representations for left-to-right window methods
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Fractional windows revisited: improved signed-digit representations for efficient exponentiation
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Implementing public-key infrastructure for sensor networks
ACM Transactions on Sensor Networks (TOSN)
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
| Hi-index | 0.00 |
The window algorithms for various signed binary representations have been used to speed up point multiplication on elliptic curves. While there’s been extensive research on the non-adjacent form, little attention has been devoted to non-sparse optimal signed binary representations. In the paper, we prove some properties of non-sparse optimal signed binary representations and present a precise analysis of the non-sparse signed window algorithm. The main contributions are described as follows. Firstly, we attain the lower bound k+1/3 of the expected length of non-sparse optimal signed binary representations of k-bit positive integers. Secondly, we propose a new non-sparse signed window partitioning algorithm. Finally, we analyze Koyama-Tsuruoka’s non-sparse signed window algorithm and the proposed algorithm and compare them with other methods. The upper bound $\frac{5}{6}\cdot 2^{w-1} -1+\frac{(-1)^{w}}{3}$ of the number of precomputed windows of the non-sparse signed window algorithms is attained.