<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462018000401463</article-id>
<article-id pub-id-type="doi">10.13053/cys-22-4-2751</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Minimum Addition Chains Generation Using Evolutionary Strategies]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Olguín-Carbajal]]></surname>
<given-names><![CDATA[Mauricio]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Herrera-Lozada]]></surname>
<given-names><![CDATA[Juan Carlos]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rivera-Zárate]]></surname>
<given-names><![CDATA[Israel]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Serrano-Talamantes]]></surname>
<given-names><![CDATA[J. Felix]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Cadena-Martínez]]></surname>
<given-names><![CDATA[Rodrigo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Vásquez-Gómez]]></surname>
<given-names><![CDATA[J. Irving]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
<xref ref-type="aff" rid="Aaf"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Instituto Politécnico Nacional Centro de Innovación y Desarrollo Tecnológico en Cómputo ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Tecnológica de México  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Instituto Politécnico Nacional  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Consejo Nacional de Ciencia y Tecnología  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2018</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2018</year>
</pub-date>
<volume>22</volume>
<numero>4</numero>
<fpage>1463</fpage>
<lpage>1472</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462018000401463&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462018000401463&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462018000401463&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[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.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Minimum length]]></kwd>
<kwd lng="en"><![CDATA[addition chains]]></kwd>
<kwd lng="en"><![CDATA[evolutionary strategy]]></kwd>
<kwd lng="en"><![CDATA[computational cost reduction]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lenstra]]></surname>
<given-names><![CDATA[H. W]]></given-names>
</name>
</person-group>
<source><![CDATA[Factoring integers with elliptic curves]]></source>
<year>1986</year>
<publisher-name><![CDATA[Mathematisch Instituut, Universiteit van Amsterdam]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Williams]]></surname>
<given-names><![CDATA[H. C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A p+l method of factoring]]></article-title>
<source><![CDATA[Math. Comp]]></source>
<year>1982</year>
<volume>39</volume>
<numero>159</numero>
<issue>159</issue>
<page-range>225-34</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gordon]]></surname>
<given-names><![CDATA[D. M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey of fast exponentiation methods]]></article-title>
<source><![CDATA[Journal of Algorithms]]></source>
<year>1998</year>
<volume>27</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>129-46</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cruz-Cortés]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Rodríguez-Henríquez]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Juárez-Morales]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Coello-Coello]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Finding Optimal Addition Chains Using a Genetic Algorithm Approach]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Hao]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Y.-P.]]></given-names>
</name>
<name>
<surname><![CDATA[Cheung]]></surname>
<given-names><![CDATA[Y.-M.]]></given-names>
</name>
<name>
<surname><![CDATA[Yin]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Jiao]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Ma]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Jiao]]></surname>
<given-names><![CDATA[Y.-C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Lecture Notes in Artificial Intelligence]]></source>
<year>2005</year>
<volume>3801</volume>
<page-range>208-15</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Downey]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Leong]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Sethi]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Computing sequences with addition chains]]></article-title>
<source><![CDATA[SIAM J. Computing]]></source>
<year>1981</year>
<volume>10</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>638-46</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kaya-Koc]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<source><![CDATA[High-speed RSA implementation]]></source>
<year>1994</year>
<publisher-loc><![CDATA[Redwood City, CA ]]></publisher-loc>
<publisher-name><![CDATA[RSA Laboratories]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kruijssen]]></surname>
<given-names><![CDATA[S. V. D]]></given-names>
</name>
</person-group>
<source><![CDATA[Addition chains, efficient computing of powers]]></source>
<year>2007</year>
<page-range>13-50</page-range><publisher-loc><![CDATA[Amsterdam ]]></publisher-loc>
<publisher-name><![CDATA[Bachelor Proyect]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kunihiro]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Yamamoto]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Window and extended window methods for addition chain and addition-subtraction chain]]></article-title>
<source><![CDATA[IEICE Trans. Fundam. Electron. Commun. Comput. Sci.]]></source>
<year>1998</year>
<page-range>72-81</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Osorio-Hernández]]></surname>
<given-names><![CDATA[L. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz-Cortés]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Rodríguez-Henríquez]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[An improved genetic algorithm able to find minimal length addition chains for small exponents]]></source>
<year>2009</year>
<conf-name><![CDATA[ Proceedings of the IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-6</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[León-Javier]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz-Cortés]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Moreno-Armendáriz]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Orantes-Jiménez]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Finding minimal addition chains with a particle swarm optimization algorithm]]></article-title>
<source><![CDATA[Lecture Notes in Computer Science]]></source>
<year>2009</year>
<volume>5845</volume>
<page-range>680-91</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nedjah]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Macedo]]></surname>
<given-names><![CDATA[M. L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Towards Minimal Addiction Chains Using Ant Colony Optimization]]></article-title>
<source><![CDATA[Journal of Mathematical Modelling and Algorithms]]></source>
<year>2006</year>
<volume>5</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>525-43</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cruz-Cortés]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Rodríguez-Henríquez]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Coello-Coello]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An artificial immune system heuristic for generating short addition chains]]></article-title>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2008</year>
<volume>12</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-24</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Domínguez-Isidro]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Evolutionary Programming Algorithm to Find Minimal Addition Chains]]></source>
<year>2011</year>
<conf-name><![CDATA[ 1er. Congreso Internacional de Ingeniería Electrónica, Instrumentación y Computación]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rechenberg]]></surname>
<given-names><![CDATA[I]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipiender biologischen Evolution]]></article-title>
<source><![CDATA[Frommann-Holzboog]]></source>
<year>1971</year>
<volume>15</volume>
<publisher-name><![CDATA[de Reihe Problemata]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chwefel]]></surname>
<given-names><![CDATA[H. P]]></given-names>
</name>
</person-group>
<source><![CDATA[Evolutionsstrategie und numerische Optimierung]]></source>
<year>1975</year>
<conf-name><![CDATA[ Dissertation]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Correia]]></surname>
<given-names><![CDATA[M. B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Study of Redundancy and Neutrality in Evolutionary Optimization]]></article-title>
<source><![CDATA[Evolutionary Computation]]></source>
<year>2013</year>
<volume>21</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>413-43</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Qing-Lan]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[The application of improved evolutionary strategy algorithm in optimization]]></source>
<year>2012</year>
<conf-name><![CDATA[ Machine Learning and Cybernetics (ICMLC´12), International Conference on]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1212-7</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zubanovic]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Hidic]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Hajdarevic]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Nosovic]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Konjicija]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Performance analysis of parallel master-slave Evolutionary strategies (&#956;,&#955;) model python implementation for CPU and GPU]]></source>
<year>2014</year>
<conf-name><![CDATA[ 37th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO´14)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1609-13</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Beyer]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Schwefel]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Evolution strategies, a comprehensive introduction]]></source>
<year>2002</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>3-52</page-range><publisher-loc><![CDATA[Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rodriguez-Cristerna]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Torres-Jimenez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Genetic Algorithm for the Problem of Minimal Brauer Chains]]></article-title>
<source><![CDATA[Recent Advances on Hybrid Intelligent Systems]]></source>
<year>2013</year>
<publisher-loc><![CDATA[Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Flammenkamp]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Shortest Addition Chains]]></source>
<year>2016</year>
</nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Domínguez-Isidro]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Mezura-Montes]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Osorio-Hernández]]></surname>
<given-names><![CDATA[L. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Evolutionary programming for the length minimization of addition chains]]></article-title>
<source><![CDATA[Engineering Applications of Artificial Intelligence]]></source>
<year>2015</year>
<volume>37</volume>
<page-range>125-34</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
