<?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>2227-1899</journal-id>
<journal-title><![CDATA[Revista Cubana de Ciencias Informáticas]]></journal-title>
<abbrev-journal-title><![CDATA[Rev cuba cienc informat]]></abbrev-journal-title>
<issn>2227-1899</issn>
<publisher>
<publisher-name><![CDATA[Editorial Ediciones Futuro]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S2227-18992021000100114</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Algoritmo para la generación de polinomios primitivos sobre extensiones de campos finitos de característica dos]]></article-title>
<article-title xml:lang="en"><![CDATA[An algorithm for the generation of primitive polynomials over finite field&#8217;s extensions of characteristic two]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Madarro Capó]]></surname>
<given-names><![CDATA[Evaristo José]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Cuellar Justiz]]></surname>
<given-names><![CDATA[Oristela]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad de La Habana Instituto de Criptografía ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad de Ciencias Informáticas  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2021</year>
</pub-date>
<volume>15</volume>
<numero>1</numero>
<fpage>114</fpage>
<lpage>128</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S2227-18992021000100114&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S2227-18992021000100114&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S2227-18992021000100114&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN En este trabajo se presenta un algoritmo para la generación de polinomios primitivos sobre extensiones de campos finitos de característica dos. Para la construcción del algoritmo se utilizan algunos conceptos de la teoría de números y los campos finitos como los cosetos q-ciclotómicos y los elementos primitivos. Además, se efectúa un análisis de la complejidad computacional del algoritmo expuesto. Finalmente, se realiza una comparación entre el algoritmo desarrollado y varios algoritmos reportados en la literatura, para la construcción determinística de polinomios primitivos.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT In this paper an algorithm for primitive polynomial generation over finite field extension of characteristic 2 is presented. For the construction of the algorithm some concepts of number theory and finite fields such as q-cyclotomic cosets and primitive elements are used. A computational complexity analysis over the exposed algorithm it&#8217;s carried out. Finally, a comparison between the developed algorithm and several algorithm reported in the literature, for primitive polynomials generation, is performed.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[polinomios primitivos]]></kwd>
<kwd lng="es"><![CDATA[extensiones de campos finitos]]></kwd>
<kwd lng="en"><![CDATA[primitive polynomial]]></kwd>
<kwd lng="en"><![CDATA[finite fields extension]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cuellar]]></surname>
<given-names><![CDATA[Oristela]]></given-names>
</name>
<name>
<surname><![CDATA[Morgado]]></surname>
<given-names><![CDATA[Eberto R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Relación Entre El Automorfismo De Frobenius Y Los Homomorfismos De Inmersión Del Campo F P N En El Campo F 2 M .]]></article-title>
<source><![CDATA[Revista Ciencias Matemáticas]]></source>
<year>2015</year>
<volume>29</volume>
<page-range>127-30</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Da Silva]]></surname>
<given-names><![CDATA[Filho]]></given-names>
</name>
<name>
<surname><![CDATA[Lima Filho]]></surname>
<given-names><![CDATA[Dimas De Queiroz]]></given-names>
</name>
</person-group>
<source><![CDATA[Construção De Polinômios Primitivos Sobre Corpos Finitos F Q]]></source>
<year>1993</year>
<page-range>497-502</page-range><publisher-name><![CDATA[11no Simposio Brasileño De Telecomunicaiones]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Daemen]]></surname>
<given-names><![CDATA[Joan]]></given-names>
</name>
<name>
<surname><![CDATA[Rijmen]]></surname>
<given-names><![CDATA[Vincent]]></given-names>
</name>
</person-group>
<source><![CDATA[The Design Of Rijndael]]></source>
<year>2002</year>
<volume>28</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>118-20</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Freyre]]></surname>
<given-names><![CDATA[Pablo]]></given-names>
</name>
<name>
<surname><![CDATA[Díaz]]></surname>
<given-names><![CDATA[Nelson]]></given-names>
</name>
<name>
<surname><![CDATA[Diaz]]></surname>
<given-names><![CDATA[Rafael]]></given-names>
</name>
<name>
<surname><![CDATA[Perez]]></surname>
<given-names><![CDATA[Claudia]]></given-names>
</name>
</person-group>
<source><![CDATA[Random Generation Of Matrixes Mds. In: Ctcrypt 2014]]></source>
<year>2014</year>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Golomb]]></surname>
<given-names><![CDATA[S. W]]></given-names>
</name>
</person-group>
<source><![CDATA[Shift Register Sequences.]]></source>
<year>1982</year>
<publisher-name><![CDATA[Aegean Park Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Golomb]]></surname>
<given-names><![CDATA[Solomon W]]></given-names>
</name>
<name>
<surname><![CDATA[Guang]]></surname>
<given-names><![CDATA[Gong]]></given-names>
</name>
</person-group>
<source><![CDATA[Signal Design For Good Correlation: For Wireless Communication, Cryptography, And Radar]]></source>
<year>2005</year>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gordon]]></surname>
<given-names><![CDATA[John A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Very Simple Method To Find The Minimum Polynomial Of An Arbitrary Nonzero Element Of A Finite Field.]]></article-title>
<source><![CDATA[Electronics Letters.]]></source>
<year>1976</year>
<volume>12</volume>
<numero>25</numero>
<issue>25</issue>
<page-range>663-4</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pascal]]></surname>
<given-names><![CDATA[Junod]]></given-names>
</name>
<name>
<surname><![CDATA[Serge]]></surname>
<given-names><![CDATA[Vaudenay]]></given-names>
</name>
</person-group>
<source><![CDATA[Perfect Diffusion Primitives For Block Ciphers. In]]></source>
<year>2004</year>
<page-range>84-99</page-range><publisher-name><![CDATA[International Workshop On Selected Areas In Cryptography. Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lidl]]></surname>
<given-names><![CDATA[Rudolf]]></given-names>
</name>
<name>
<surname><![CDATA[Niederreiter]]></surname>
<given-names><![CDATA[Harald]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction To Finite Fields And Their Applications.]]></source>
<year>1994</year>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Macwilliams]]></surname>
<given-names><![CDATA[Florence J]]></given-names>
</name>
<name>
<surname><![CDATA[Sloane]]></surname>
<given-names><![CDATA[Neil J]]></given-names>
</name>
<name>
<surname><![CDATA[Sloane]]></surname>
<given-names><![CDATA[Neil J]]></given-names>
</name>
</person-group>
<source><![CDATA[The Theory Of Error-Correcting Codes: North Holland Mathematical Library.]]></source>
<year>1983</year>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Madarro]]></surname>
<given-names><![CDATA[Evaristo José]]></given-names>
</name>
</person-group>
<source><![CDATA[Generación De Polinomios Primitivos Sobre Extensiones De Campos Finitos F 2 N .]]></source>
<year>2017</year>
<publisher-name><![CDATA[Universidad Central &#8220;Marta Abreu&#8221; De Las Villas]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Menezes]]></surname>
<given-names><![CDATA[Alfred J]]></given-names>
</name>
<name>
<surname><![CDATA[Van Oorschot]]></surname>
<given-names><![CDATA[Paul C]]></given-names>
</name>
<name>
<surname><![CDATA[Vanstone]]></surname>
<given-names><![CDATA[Scott A]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook Of Applied Cryptography Crc Press]]></source>
<year>1997</year>
<publisher-name><![CDATA[Boca Raton]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mullen]]></surname>
<given-names><![CDATA[Gary L]]></given-names>
</name>
<name>
<surname><![CDATA[Panario]]></surname>
<given-names><![CDATA[Daniel]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook Of Finite Fields.]]></source>
<year>2013</year>
<publisher-name><![CDATA[Crc Pres.Taylor &amp; Francis Group]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rifà]]></surname>
<given-names><![CDATA[Josep]]></given-names>
</name>
<name>
<surname><![CDATA[Borrell]]></surname>
<given-names><![CDATA[Joan]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Fast Algorithm To Compute Irreducible And Primitive Polynomials In Finite Fields]]></article-title>
<source><![CDATA[Mathematical Systems Theory.]]></source>
<year>1995</year>
<volume>28</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>13-20.</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nirmal R]]></surname>
<given-names><![CDATA[Saxena]]></given-names>
</name>
<name>
<surname><![CDATA[Mccluskey]]></surname>
<given-names><![CDATA[Edward J]]></given-names>
</name>
</person-group>
<source><![CDATA[Primitive Polynomial Generation Algorithms Implementation And Performance Analysis.]]></source>
<year>2004</year>
<publisher-name><![CDATA[Crc Technical Report 2004]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schönhage]]></surname>
<given-names><![CDATA[Arnold]]></given-names>
</name>
<name>
<surname><![CDATA[Strassen]]></surname>
<given-names><![CDATA[Volker]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Schnelle Multiplikation Grosser Zahlen.]]></article-title>
<source><![CDATA[Computing]]></source>
<year>1971</year>
<volume>7</volume>
<numero>3-4</numero>
<issue>3-4</issue>
<page-range>281-92</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shoup]]></surname>
<given-names><![CDATA[Victor]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient Computation Of Minimal Polynomials In Algebraic Extensions Of Finite Fields.]]></source>
<year>1999</year>
<page-range>53-8</page-range><publisher-name><![CDATA[In: Proceedings Of The 1999 International Symposium On Symbolic And Algebraic Computation]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shoup]]></surname>
<given-names><![CDATA[Victor]]></given-names>
</name>
</person-group>
<source><![CDATA[A Computational Introduction To Number Theory And Algebra.]]></source>
<year>2009</year>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Valentijn]]></surname>
<given-names><![CDATA[Ashley]]></given-names>
</name>
</person-group>
<source><![CDATA[Goppa Codes And Their Use In The Mceliece Cryptosystems]]></source>
<year>2015</year>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Von Zur Gathen]]></surname>
<given-names><![CDATA[Joachim]]></given-names>
</name>
<name>
<surname><![CDATA[Panario]]></surname>
<given-names><![CDATA[Danie]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Factoring Polynomials Over Finite Fields: A Survey.]]></article-title>
<source><![CDATA[Journal Of Symbolic Computation]]></source>
<year>2001</year>
<volume>31</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>3-17</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
