Performance Comparison of Some Addition Chain Methods Based on Integer Family

A generalized version of an addition chain problem, in which one must find a chain that simultaneously satisfies a sequence on integer in ascending order, is NP-complete. There is no known algorithm which can calculate an optimal addition chain for a given number with any guarantees of reasonable timing or small memory usage. Several methods were introduced to calculate relatively short chain and they are most used to support scalar multiplication operation tailored to limited computational resources in elliptic curve cryptography. In reality, one method is no better than the other except on certain occasions and only for specific integers. In this studies, we evaluate some existing addition chain methods against each other for their competitive performance by categorizing integers into various groups as the input. This result can be used as a benchmark for which method is suitable in which condition anticipated.

[1]  Tsuyoshi Takagi,et al.  Signed Binary Representations Revisited , 2004, CRYPTO.

[2]  NADIA NEDJAH,et al.  Towards Minimal Addition Chains Using Ant Colony Optimisation , 2006, J. Math. Model. Algorithms.

[3]  Francisco Rodríguez-Henríquez,et al.  A Genetic Algorithm with repair and local search mechanisms able to find minimal length addition chains for small exponents , 2009, 2009 IEEE Congress on Evolutionary Computation.

[4]  José Torres-Jiménez,et al.  A Genetic Algorithm for the Problem of Minimal Brauer Chains for Large Exponents , 2013, Soft Computing Applications in Optimization, Control, and Recognition.

[5]  M. A. Mohamed,et al.  A survey on elliptic curve cryptography , 2014 .

[6]  Francisco Rodríguez-Henríquez,et al.  An Artificial Immune System Heuristic for Generating Short Addition Chains , 2008, IEEE Transactions on Evolutionary Computation.

[7]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[8]  Peter J. Downey,et al.  Computing Sequences with Addition Chains , 1981, SIAM J. Comput..

[9]  Efrén Mezura-Montes,et al.  Evolutionary programming for the length minimization of addition chains , 2015, Eng. Appl. Artif. Intell..

[10]  M. A. Mohamed,et al.  Rule Based Representation of Integer for a New Addition Chain Method , 2012 .

[11]  Abdullah Muhammed,et al.  A Review on Heuristics for Addition Chain Problem: Towards Efficient Public Key Cryptosystems , 2017, J. Comput. Sci..

[12]  P. Balasubramaniam,et al.  Elliptic curve scalar multiplication algorithm using complementary recoding , 2007, Appl. Math. Comput..

[13]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[14]  Z. Ahmad Zulkarnain,et al.  Shorter addition chain for smooth integers using decomposition method , 2011, Int. J. Comput. Math..

[16]  M. A. Mohamed,et al.  A hybrid addition chain method for faster scalar multiplication , 2015 .

[17]  Marco A. Moreno-Armendáriz,et al.  Finding Minimal Addition Chains with a Particle Swarm Optimization Algorithm , 2009, MICAI.

[18]  Francisco Rodríguez-Henríquez,et al.  Finding Optimal Addition Chains Using a Genetic Algorithm Approach , 2005, CIS.

[19]  José Torres-Jiménez,et al.  A Simulated Annealing Algorithm for the Problem of Minimal Addition Chains , 2011, EPIA.