Finding a normal basis of a finite field in deterministic polynomial time

MaRDI QIDQ2897610zbMATH OpenFDO

Authors R. Skuratovs'kyj

Publication date 16 July 2012

Published in Visnyk. Matematyka. Mekhanika. Kyïvs'kyĭ Universytet Imeni Tarasa Shevchenka (Search for Journal in Brave)

zbMATH Keywords

fieldnormal basis

Mathematics Subject Classification ID

Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 1273656
• scientific article; zbMATH DE number 16708
• A deterministic construction of normal bases with complexity \(O(n^ 3+n\log n\log(\log n)\log q)\)
• Low complexity normal bases
• О построении нормального базиса конечного поля

Cited in

(6)

• A deterministic construction of normal bases with complexity \(O(n^ 3+n\log n\log(\log n)\log q)\)
• scientific article; zbMATH DE number 4061359 (Why is no real title available?)
• CONSTRUCTION OF POLYNOMIALS IRREDUCIBLE OVER A FINITE FIELD WITH LINEARLY INDEPENDENT ROOTS
• scientific article; zbMATH DE number 1273656 (Why is no real title available?)
• New deterministic algorithm for constructing normal bases in finite fields
• On the \(q\)th power algorithm

This page was built for publication: Finding a normal basis of a finite field in deterministic polynomial time

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