Low complexity normal bases in F 2n

Author： Young B.   Panario D.  

Publisher： Elsevier

ISSN： 1071-5797

Source： Finite Fields and Their Applications, Vol.10, Iss.1, 2004-01, pp. : 53-64

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

The trace spectra of polynomial bases for F 2n

By Ahmadi Omran  

Applicable Algebra in Engineering, Communication and Computing, Vol. 18, Iss. 4, 2007-08 ,pp. : 391-396

Springer Publishing Company

Access to resources Recommend Favorite

A Euclidean Algorithm for Normal Bases

By Sunar B.  

Acta Applicandae Mathematicae, Vol. 93, Iss. 1-3, 2006-09 ,pp. : 57-74

Springer Publishing Company

Access to resources Recommend Favorite

Slim normal bases and basefield transforms

By Grohmann Björn  

Applicable Algebra in Engineering, Communication and Computing, Vol. 18, Iss. 5, 2007-10 ,pp. : 397-406

Springer Publishing Company

Access to resources Recommend Favorite

Sturmian morphisms, the braid group B 4, Christoffel words and bases of F 2

By Kassel Christian   Reutenauer Christophe  

Annali di Matematica Pura ed Applicata, Vol. 186, Iss. 2, 2007-04 ,pp. : 317-339

Springer Publishing Company

Access to resources Recommend Favorite

Rings of Low Multiplicative Complexity

By Silverman J.H.  

Finite Fields and Their Applications, Vol. 6, Iss. 2, 2000-04 ,pp. : 175-191

Elsevier

Access to resources Recommend Favorite