An algorithm for modular exponentiation
Information Processing Letters
Theory and Applications of the Double-Base Number System
IEEE Transactions on Computers
Optimal Left-to-Right Binary Signed-Digit Recoding
IEEE Transactions on Computers - Special issue on computer arithmetic
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Trading Inversions for Multiplications in Elliptic Curve Cryptography
Designs, Codes and Cryptography
A Tree-Based Approach for Computing Double-Base Chains
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Extending scalar multiplication using double bases
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Extended double-base number system with applications to elliptic curve cryptography
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
An analysis of double base number systems and a sublinear scalar multiplication algorithm
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We introduce here a generalized method a new Algorithm to find Triple-Base number system and Triple-Base chain and hence in turn Single Digit Triple-Base number system(SDTBNS). The proposed method is not only simpler and faster than the Algorithms to find Double-Base number system or Double-Base chain, experimentally it also returns a shorter length of Triple-Base chain which in turn reduces the size of the look-up-table to find out SDTBNS. The complexity analysis and experimental results shows the novelty of the proposed Algorithm. Moreover when the proposed method is applied to find scalar multiplication in case of Elliptic Curve Cryptography and coefficient multiplication in case of designing digital filter, its efficiency also proves its novelty. Here we have used third base as 5 because when it is multiplied by 2 gives 10 which can be efficiently used for decimal shifting, i.e. if an integer 'n' can be represented in SDTBNS form, then n/10x or nx10x can also represented in SDTBNS only by diving or multiplying 'n' by 10.