SciELO - Scientific Electronic Library Online

 
vol.15 número1Buenas prácticas para prevenir los riesgos de la eficiencia del desempeño en los productos de software índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

  • No hay articulos citadosCitado por SciELO

Links relacionados

  • No hay articulos similaresSimilares en SciELO

Compartir


Revista Cubana de Ciencias Informáticas

versión On-line ISSN 2227-1899

Resumen

MADARRO CAPO, Evaristo José  y  CUELLAR JUSTIZ, Oristela. An algorithm for the generation of primitive polynomials over finite field’s extensions of characteristic two. Rev cuba cienc informat [online]. 2021, vol.15, n.1, pp.114-128.  Epub 31-Mar-2021. ISSN 2227-1899.

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’s carried out. Finally, a comparison between the developed algorithm and several algorithm reported in the literature, for primitive polynomials generation, is performed.

Palabras clave : primitive polynomial; finite fields extension.

        · resumen en Español     · texto en Español     · Español ( pdf )