A new algorithm for computing triple-base number system

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.

[1]  Laurent Imbert,et al.  Hybrid Binary-Ternary Joint Sparse Form and its Application in Elliptic Curve Cryptography , 2008, IACR Cryptol. ePrint Arch..

[2]  Graham A. Jullien,et al.  An Algorithm for Modular Exponentiation , 1998, Inf. Process. Lett..

[3]  Graham A. Jullien,et al.  Theory and Applications of the Double-Base Number System , 1999, IEEE Trans. Computers.

[4]  Francesco Sica,et al.  An Analysis of Double Base Number Systems and a Sublinear Scalar Multiplication Algorithm , 2005, Mycrypt.

[5]  Christophe Doche,et al.  A Tree-Based Approach for Computing Double-Base Chains , 2008, ACISP.

[6]  Marc Joye,et al.  Trading Inversions for Multiplications in Elliptic Curve Cryptography , 2006, Des. Codes Cryptogr..

[7]  Harvey L. Garner,et al.  Number Systems and Arithmetic , 1965, Adv. Comput..

[8]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[9]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[10]  W. Neville Holmes,et al.  Binary Arithmetic , 2007, Computer.

[11]  Andrew D. Booth,et al.  A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .

[12]  Laurent Imbert,et al.  Extended Double-Base Number System with Applications to Elliptic Curve Cryptography , 2006, INDOCRYPT.

[13]  Marc Joye,et al.  Optimal Left-to-Right Binary Signed-Digit Recoding , 2000, IEEE Trans. Computers.

[14]  Roberto Maria Avanzi,et al.  Extending Scalar Multiplication Using Double Bases , 2006, ASIACRYPT.

[15]  Laurent Imbert,et al.  Hybrid Binary-Ternary Joint Form and Its Application in Elliptic Curve Cryptography , 2009, 2009 19th IEEE Symposium on Computer Arithmetic.