Minimum addition chains generation using evolutionary strategies

Mauricio Olguín-Carbajal; Juan Carlos Herrera-Lozada; Israel Rivera-Zárate; J. Felix Serrano-Talamantes; Rodrigo Cadena-Martínez; J. Irving Vásquez-Gómez

doi:10.13053/CyS-22-4-2751

Minimum addition chains generation using evolutionary strategies

Mauricio Olguín-Carbajal, Juan Carlos Herrera-Lozada, Israel Rivera-Zárate, J. Felix Serrano-Talamantes, Rodrigo Cadena-Martínez, J. Irving Vásquez-Gómez

Centro de Innovación y Desarrollo Tecnológico en Cómputo (CIDETEC)

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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.

Original language	English
Pages (from-to)	1463-1472
Number of pages	10
Journal	Computacion y Sistemas
Volume	22
Issue number	4
DOIs	https://doi.org/10.13053/CyS-22-4-2751
State	Published - 2018

Keywords

Addition chains
Computational cost reduction
Evolutionary strategy
Minimum length

Access to Document

10.13053/CyS-22-4-2751

Cite this

@article{09076186d83049d0996dcae1e99eab3f,

title = "Minimum addition chains generation using evolutionary strategies",

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.",

keywords = "Addition chains, Computational cost reduction, Evolutionary strategy, Minimum length",

author = "Mauricio Olgu{\'i}n-Carbajal and Herrera-Lozada, {Juan Carlos} and Israel Rivera-Z{\'a}rate and {Felix Serrano-Talamantes}, J. and Rodrigo Cadena-Mart{\'i}nez and {Irving V{\'a}squez-G{\'o}mez}, J.",

year = "2018",

doi = "10.13053/CyS-22-4-2751",

language = "Ingl{\'e}s",

volume = "22",

pages = "1463--1472",

journal = "Computacion y Sistemas",

issn = "1405-5546",

number = "4",

}

TY - JOUR

T1 - Minimum addition chains generation using evolutionary strategies

AU - Olguín-Carbajal, Mauricio

AU - Herrera-Lozada, Juan Carlos

AU - Rivera-Zárate, Israel

AU - Felix Serrano-Talamantes, J.

AU - Cadena-Martínez, Rodrigo

AU - Irving Vásquez-Gómez, J.

PY - 2018

Y1 - 2018

N2 - 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.

AB - 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.

KW - Addition chains

KW - Computational cost reduction

KW - Evolutionary strategy

KW - Minimum length

UR - http://www.scopus.com/inward/record.url?scp=85069552749&partnerID=8YFLogxK

U2 - 10.13053/CyS-22-4-2751

DO - 10.13053/CyS-22-4-2751

M3 - Artículo

AN - SCOPUS:85069552749

SN - 1405-5546

VL - 22

SP - 1463

EP - 1472

JO - Computacion y Sistemas

JF - Computacion y Sistemas

IS - 4

ER -

Minimum addition chains generation using evolutionary strategies

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this