<?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-18992021000500017</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Aritmética sobre Torres de Campos Finitos de característica dos, aplicada a la generación de polinomios primitivos]]></article-title>
<article-title xml:lang="en"><![CDATA[Aritmetic on Tower over Finite Field of characteristic two, applied to primitive polynomials generation]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Pérez Roble]]></surname>
<given-names><![CDATA[Alberto]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Pérez López]]></surname>
<given-names><![CDATA[Beatriz]]></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 contrib-type="author">
<name>
<surname><![CDATA[Madarro Capo]]></surname>
<given-names><![CDATA[Evaristo J.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Empresa Eléctrica Sancti Spíritus  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad de Sancti Spíritus José Martí Pérez  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad de las Ciencias Informáticas  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Universidad de La Habana Instituto de Criptografía ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>00</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>00</month>
<year>2021</year>
</pub-date>
<volume>15</volume>
<numero>4</numero>
<fpage>17</fpage>
<lpage>32</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S2227-18992021000500017&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S2227-18992021000500017&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S2227-18992021000500017&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN Con el avance de la Criptografía y las nuevas herramientas puestas a su disposición, la seguridad de los algoritmos criptográficos se basa principalmente en el empleo de campos finitos de grandes dimensiones lo que dificulta la aritmética sobre ellos, además los sistemas simétricos que emplean polinomios primitivos sobre estos campos, también presentan grandes dificultades para la determinación de los mismos. En este trabajo se analizan las torres de campos finitos como herramienta para lograr una aritmética eficiente, también se exponen ejemplos de estas, a través de la representación de los elementos, pertenecientes a campos de característica dos en bases normales, haciendo énfasis en la operación de exponenciación. Por último, se propone el empleo de torres de campos sobre bases normales en el cálculo del polinomio mínimo, operación fundamental y de mayor complejidad en el algoritmo de generación de polinomios primitivos de E. Madarro en 2017.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT With the advancement of cryptography and the new tools made available, the security of cryptographic al- gorithms is based mainly on the use of finite fields of big dimensions what makes difficult the arithmetic on them, besides the symmetrical systems that use primitive polynomials on these fields, also present great difficulties for the determination of the same. In this work we analyze the towers of finite fields as a tool for efficient arithmetic, examples of these are also given, through the representation of the elements, belonging to fields of characteristic two on normal bases, emphasizing in exponentiation operation. Finally, is analyzed a proposal that employs towers with representation on normal bases in the algorithm of generation of primitive polynomials exposed by E. Madarro in 2017.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Torres de campos finitos]]></kwd>
<kwd lng="es"><![CDATA[bases normales]]></kwd>
<kwd lng="es"><![CDATA[polinomios primitivos]]></kwd>
<kwd lng="en"><![CDATA[Tower finite field]]></kwd>
<kwd lng="en"><![CDATA[normal bases]]></kwd>
<kwd lng="en"><![CDATA[primitive polynomials]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bailey]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Paar]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<source><![CDATA[Optimal ExtensionFields for Fast Arithmetic in Public-Key Algorithms]]></source>
<year>1998</year>
<page-range>472-85</page-range><publisher-name><![CDATA[CRYPTO&#8217;98]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Baktir]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient algorithms for finite fields, with applications in elliptic curve cryptography.]]></source>
<year>2003</year>
<publisher-loc><![CDATA[Worcester, Massachusetts, USA ]]></publisher-loc>
<publisher-name><![CDATA[ECE Department, Worcester Polytechnic Institute]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Baktir]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Sunar]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimal Tower Fields]]></article-title>
<source><![CDATA[IEEE Transactions on Computers]]></source>
<year>2004</year>
<volume>53</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>1231-43</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Baktir]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Pelzl]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Wollinger]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
<name>
<surname><![CDATA[Sunar]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
<name>
<surname><![CDATA[Paar]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<source><![CDATA[Optimal tower fields for hyperelliptic curve cry- ptosystems]]></source>
<year>2004</year>
<page-range>522-6</page-range><publisher-name><![CDATA[Record of the Thirty-Eighth Asilomar Conference]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bonnecaze]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Liardet]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Venelli]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[AES Side-Channel Countermeasure using Random Tower Field Constructions]]></source>
<year>2013</year>
<publisher-name><![CDATA[Codes and Cryptography]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cortez]]></surname>
<given-names><![CDATA[N.A]]></given-names>
</name>
</person-group>
<source><![CDATA[Multiplicadores de arquitectura segmentada y su aplicación al cómputo de emparejamientos bilineales.]]></source>
<year>2009</year>
<publisher-loc><![CDATA[México D.F ]]></publisher-loc>
<publisher-name><![CDATA[Instituto Politécnico Nacional]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cuellar]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
</person-group>
<source><![CDATA[Homomorfismos de inmersión y matrices MDS en la Criptografía.]]></source>
<year>2017</year>
<publisher-loc><![CDATA[Cuba ]]></publisher-loc>
<publisher-name><![CDATA[Universidad Central &#8220;Marta Abreu&#8221; de Las Villas]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cuellar]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
<name>
<surname><![CDATA[Madarro]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Freyre]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Sosa]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<source><![CDATA[The Zech&#8216;s Logarithm and cyclotomic coset]]></source>
<year>2016</year>
<publisher-name><![CDATA[Journal of Advances in Mathematic]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[da Silva]]></surname>
<given-names><![CDATA[J.G]]></given-names>
</name>
<name>
<surname><![CDATA[Lima]]></surname>
<given-names><![CDATA[D.Q]]></given-names>
</name>
</person-group>
<source><![CDATA[Construc¸a&#732;o de Polino&#710;mios Primitivos sobre Corpos Finitos]]></source>
<year>1993</year>
<publisher-name><![CDATA[GF(q)]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dehnavi]]></surname>
<given-names><![CDATA[S.M]]></given-names>
</name>
<name>
<surname><![CDATA[Rishakani]]></surname>
<given-names><![CDATA[A.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Shamsabad]]></surname>
<given-names><![CDATA[M.M]]></given-names>
</name>
<name>
<surname><![CDATA[Pasha]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<source><![CDATA[Construction of New Families of MDS Diffusion Layers]]></source>
<year>2014</year>
<publisher-name><![CDATA[IACR]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Delgado]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
</person-group>
<source><![CDATA[Nuevos Protocolos y Esquemas de Seguridad para Redes Ad-hoc Móviles Inalámbricas.]]></source>
<year>2010</year>
<publisher-name><![CDATA[Universidad Carlos III de Madrid]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[di Porto]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Guida]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
<name>
<surname><![CDATA[Montolivo]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Fast algorithm for finding primitive polynomials over GF(q)]]></article-title>
<source><![CDATA[Electronics Letters]]></source>
<year>1992</year>
<volume>28</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>118-20</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[El-Razouk]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Reyhani-Masoleh]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Gong]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[New Hardware Implementations of WG(29, 11) and WG16 StreamCiphers Using Polynomial Basis]]></article-title>
<source><![CDATA[IEEE Transactions on Computers]]></source>
<year>2015</year>
<volume>64</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>2020-35</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fan]]></surname>
<given-names><![CDATA[X]]></given-names>
</name>
<name>
<surname><![CDATA[Zidaric]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Aagaard]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Gong]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient hardware implementation of the stream cipher WG-16 with composite field arithmetic.]]></source>
<year>2013</year>
<page-range>21-34</page-range><publisher-name><![CDATA[Proceedings of the 3rd international workshop on Trustworthy embedded devices]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fraleigh]]></surname>
<given-names><![CDATA[J.B]]></given-names>
</name>
</person-group>
<source><![CDATA[A First Course in Abstract Algebra]]></source>
<year>2003</year>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Freyre]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Díaz]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Pérez]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<source><![CDATA[Random Generation of MDS matrices]]></source>
<year>2014</year>
<publisher-name><![CDATA[CTCrypt]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<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="B18">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[González]]></surname>
<given-names><![CDATA[J.E]]></given-names>
</name>
</person-group>
<source><![CDATA[Disen&#732;o e Implementación Eficiente del Emparejamiento Ó ptimo ATE.]]></source>
<year>2010</year>
<publisher-loc><![CDATA[México D.F ]]></publisher-loc>
<publisher-name><![CDATA[Instituto Politécnico Nacional]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gupta]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[Pandey]]></surname>
<given-names><![CDATA[S.K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Applications of design theory for the constructions of MDS matrices for light- weight cryptography]]></article-title>
<source><![CDATA[Journal of Mathematical Cryptology]]></source>
<year>2017</year>
<volume>11</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>85-116</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gupta]]></surname>
<given-names><![CDATA[K.C]]></given-names>
</name>
<name>
<surname><![CDATA[Ray]]></surname>
<given-names><![CDATA[I.G]]></given-names>
</name>
</person-group>
<source><![CDATA[Cryptographically significant MDS matrices based on circulant and circulant-like matrices for lightweight applications]]></source>
<year>2015</year>
<volume>7</volume>
<page-range>257-87</page-range><publisher-name><![CDATA[Cryptography and Communications]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jones]]></surname>
<given-names><![CDATA[A. B]]></given-names>
</name>
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[J. M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Article Title]]></article-title>
<source><![CDATA[Journal Title]]></source>
<year>2013</year>
<volume>13</volume>
<numero>52</numero>
<issue>52</issue>
<page-range>123-456</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Junod]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Vaudenay]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[Building Efficient MDS Matrices]]></source>
<year>2004</year>
<publisher-name><![CDATA[Perfect Diffusion Primitives for Block Ciphers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kerins]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
<name>
<surname><![CDATA[Marnane]]></surname>
<given-names><![CDATA[W.P]]></given-names>
</name>
<name>
<surname><![CDATA[Popovici]]></surname>
<given-names><![CDATA[E.M]]></given-names>
</name>
<name>
<surname><![CDATA[Barreto]]></surname>
<given-names><![CDATA[P.S.L.M]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient Hardware for the Tate Pairing Calculation in Characteristic Three]]></source>
<year>2005</year>
<page-range>412-26</page-range><publisher-name><![CDATA[Cryptographic Hardware and Embedded Systems]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Knuth]]></surname>
<given-names><![CDATA[D.E]]></given-names>
</name>
</person-group>
<source><![CDATA[The Art of Computer Programming: Seminumerical Algorithms]]></source>
<year>1997</year>
<volume>2</volume>
<publisher-name><![CDATA[Addison-Wesley Professional]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lidl]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Niederreiter]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to finite fields and their applications]]></source>
<year>1986</year>
<publisher-name><![CDATA[Cambridge university press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Madarro]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Cuellar]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
</person-group>
<source><![CDATA[Algoritmo para la generación de polinomios primitivos sobre extensiones de campos finitos de característica 2]]></source>
<year>2016</year>
<publisher-name><![CDATA[II Seminario Naicional de Criptografía]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Madarro]]></surname>
<given-names><![CDATA[E. J]]></given-names>
</name>
<name>
<surname><![CDATA[Cuellar]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Algoritmo para la generación de polinomios primitivos sobre extensiones de campos finitos de característica dos]]></article-title>
<source><![CDATA[Revista Cubana de Ciencias Informáticas]]></source>
<year>2021</year>
<volume>15</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>114-28</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Madarro]]></surname>
<given-names><![CDATA[E.J]]></given-names>
</name>
</person-group>
<source><![CDATA[Generación de polinomios primitivos sobre extensiones de campos finitos.]]></source>
<year>2017</year>
<publisher-loc><![CDATA[Cuba ]]></publisher-loc>
<publisher-name><![CDATA[Universidad Central &#8220;Marta Abreu&#8221; de Las Villas]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mahmoodi]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Mirzaee]]></surname>
<given-names><![CDATA[M.R]]></given-names>
</name>
<name>
<surname><![CDATA[Dehnavi]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Amiri]]></surname>
<given-names><![CDATA[M.A]]></given-names>
</name>
<name>
<surname><![CDATA[Maimani]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Bagheri]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Lightweight 4x4 MDS Matrices for Hardware-Oriented Cryptographic Primitives.]]></article-title>
<source><![CDATA[The ISC International Journal of Information Security]]></source>
<year>2019</year>
<volume>11</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>35-46</page-range></nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mullen]]></surname>
<given-names><![CDATA[G.L]]></given-names>
</name>
<name>
<surname><![CDATA[Panario]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of finite fields]]></source>
<year>2013</year>
<publisher-name><![CDATA[CRC Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Peralta]]></surname>
<given-names><![CDATA[F.I]]></given-names>
</name>
</person-group>
<source><![CDATA[Disen&#732;o de Arquitecturas Digitales para Criptografía]]></source>
<year>2005</year>
<publisher-name><![CDATA[Escuela Superior de Ingeniería Mecánica y Eléctrica de Culhuacan]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pérez]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<source><![CDATA[Matrices MDS y Funciones Booleanas Vectoriales. Disen&#732;o de un Algoritmo Criptográfico.]]></source>
<year>2014</year>
<publisher-name><![CDATA[Universidad de la Habana]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pérez Roble]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Principales aplicaciones de las torres de campos en la criptografía moderna.]]></source>
<year>2017</year>
<publisher-name><![CDATA[XV Congreso Internacional de Computación y Matemática (COMPUMAT)]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pérez Roble]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Aritmética sobre Torres de Campos Finitos de característica 2, aplicados a la generación de polinomios primitivos.]]></source>
<year>2019</year>
<publisher-loc><![CDATA[Cuba ]]></publisher-loc>
<publisher-name><![CDATA[Universidad de La Habana]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Reyhani-Masoleh]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Taha]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Ashmawy]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<source><![CDATA[Smashing the implementation records of AES S-box]]></source>
<year>2018</year>
<month>a</month>
<page-range>298-336</page-range><publisher-name><![CDATA[IACR Transactions on Cryptographic Hardware and Embedded Systems]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B36">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Reyhani-Masoleh]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Taha]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Ashmawy]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<source><![CDATA[New area record for the AES combined S-box/inverse S-box.]]></source>
<year>2018</year>
<month>b</month>
<publisher-name><![CDATA[2018 IEEE 25th Symposium on Computer Arithmetic (ARITH)]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B37">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rifa]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Borrell]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields]]></source>
<year>1995</year>
<page-range>13-20</page-range><publisher-name><![CDATA[Math. Systems Theory]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B38">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Saxena]]></surname>
<given-names><![CDATA[E.J]]></given-names>
</name>
<name>
<surname><![CDATA[MacCuskey]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
</person-group>
<source><![CDATA[Primitive Polynomial Generation Algorithms Implementation and Perfor- mance Analysis]]></source>
<year>2004</year>
</nlm-citation>
</ref>
<ref id="B39">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shoup]]></surname>
<given-names><![CDATA[V]]></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 Procee- dings of the 1999 International Symposium on Symbolic and Algebraic Computation]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B40">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shoup]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
</person-group>
<source><![CDATA[A Computational Introduction to Number Theory and Algebra]]></source>
<year>2008</year>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B41">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[J. M]]></given-names>
</name>
<name>
<surname><![CDATA[Jones]]></surname>
<given-names><![CDATA[A. B]]></given-names>
</name>
</person-group>
<source><![CDATA[Book Title]]></source>
<year>2012</year>
<publisher-name><![CDATA[Publisher]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B42">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ueno]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Homma]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Sugawara]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Nogami]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Aoki]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
</person-group>
<source><![CDATA[Highly Efficient GF(28) Inversion Circuit Based on Redundant GF Arithmetic and Its Application to AES Design]]></source>
<year>2015</year>
<publisher-name><![CDATA[Cryptographic Hardware and Embedded Systems,]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B43">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Velásquez]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
<name>
<surname><![CDATA[Castan&#732;o]]></surname>
<given-names><![CDATA[J. F]]></given-names>
</name>
</person-group>
<source><![CDATA[Implementación de aritmética de torres de campos finitos binarios de extensión 2 en fpga]]></source>
<year>2013</year>
<publisher-name><![CDATA[INGE CUC]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B44">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zidaric]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
</person-group>
<source><![CDATA[Hardware implementations of the WG-16 stream cipher with composite field arithmetic.]]></source>
<year>2014</year>
<publisher-name><![CDATA[University of Waterloo]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B45">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zidaric]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Aagaard]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Gong]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hardware Optimizations and Analysis for the WG-16 Cipher with Tower Field Arithmetic]]></article-title>
<source><![CDATA[IEEE Transactions on Computers]]></source>
<year>2019</year>
<volume>68</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>67-82</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
