Minimum Addition Chains Generation Using Evolutionary Strategies

Authors

  • Mauricio Olguin Carbajal Instituto Politécnico Nacional, Centro de Innovación y Desarrollo Tecnológico en Cómputo
  • Juan Carlos Herrera-Lozada Instituto Politécnico Nacional, Centro de Innovación y Desarrollo Tecnológico en Cómputo
  • Israel Rivera-Zárate Instituto Politécnico Nacional, Centro de Innovación y Desarrollo Tecnológico en Cómputo
  • J. Felix Serrano-Talamantes Instituto Politécnico Nacional, Centro de Innovación y Desarrollo Tecnológico en Cómputo
  • Rodrigo Cadena-Martínez Universidad Tecnológica de México
  • J. Irving Vásquez-Gómez Consejo Nacional de Ciencia y Tecnología

DOI:

https://doi.org/10.13053/cys-22-4-2751

Keywords:

Minimum length, addition chains, evolutionary strategy, computational cost reduction

Abstract

The calculus for a power of a number could be a time and computational cost-consuming task. A method for reducing this issue is welcome in all mayor computational areas as cryptography, numerical series and elliptic curves calculus,  just to mention a few. This paper details the development of a minimum length addition chains generator based on an Evolutionary Strategy, which makes fewer calls to the objective function with respect to other proposals that also use bio-inspirated algorithms as Particle Swarm Optimization or a Genetic Algorithm. By using fewer calls to the objective function, the number of calculations is lower and consequently decreases the generation time providing an improvement in computational cost but obtaining competitive results.

Author Biography

Mauricio Olguin Carbajal, Instituto Politécnico Nacional, Centro de Innovación y Desarrollo Tecnológico en Cómputo

Posgraduate Departament

Downloads

Published

2018-12-30

Issue

Vol. 22 No. 4 (2018): Topic Trends in Computing Research (Guest Editors: A. Aguilar-Meléndez, E. Moya-Sánchez)

Section

Articles

License 

Hereby I transfer exclusively to the Journal "Computación y 
Sistemas", published by the Computing Research Center (CIC-IPN),
the Copyright of the aforementioned paper. I also accept that these 
rights will not be transferred to any other publication, in any other 
format, language or other existing means of developing.
I certify that the paper has not been previously disclosed or simultaneo
usly submitted to any other publication, and that it does not contain 
material whose publication would violate the Copyright or other 
proprietary rights of any person, company or institution. I certify that 
I have the permission from the institution or company where I work or 
study to publish this work.
The representative author accepts the responsibility for the publication
of this paper on behalf of each and every one of the authors. 
This transfer is subject to the following conditions:
  • The authors retain all ownership rights (such as patent rights) of this work, except for the publishing rights transferred to the CIC, through this document.
  • Authors retain the right to publish the work in whole or in part in any book they are the authors or publishers. They can also make use of this work in conferences, courses, personal web pages, and so on.
  • Authors may include working as part of his thesis, for non-profit distribution only.