Minimum complexity and low-weight normal polynomials over finite fields

MaRDI QIDQ3463188zbMATH OpenFDO

Authors Mahmood Alizadeh, Farshin Hormozi Nejad

Publication date 12 January 2016

Full work available at URL http://ijpam.uniud.it/online_issue/201433/10-AlizadehHormozi.pdf

zbMATH Keywords

complexityfinite fieldsnormal polynomialpentanomialtrinomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05)

Recommendations

• Low Complexity Normal Elements over Finite Fields of Characteristic Two
• Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields
• Primitive Normal Polynomials Over Finite Fields
• scientific article; zbMATH DE number 1273656
• Low complexity of a class of normal bases over finite fields

Cited in

(2)

• Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields
• Low Complexity Normal Elements over Finite Fields of Characteristic Two

This page was built for publication: Minimum complexity and low-weight normal polynomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3463188)