New deterministic algorithm for constructing normal bases in finite fields

MaRDI QIDQ5482927zbMATH OpenFDO

Authors Marko Juhani Rinta-Aho, Keijo Väänänen, Marko Moisio

Publication date 15 August 2006

Mathematics Subject Classification ID

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

Recommendations

• A deterministic construction of normal bases with complexity \(O(n^ 3+n\log n\log(\log n)\log q)\)
• scientific article; zbMATH DE number 812069
• scientific article; zbMATH DE number 1273656
• Subquadratic-time algorithms for normal bases
• Finding a normal basis of a finite field in deterministic polynomial time

Cited in

(2)

• New polynomial-time algorithms for Camion bases
• A deterministic construction of normal bases with complexity \(O(n^ 3+n\log n\log(\log n)\log q)\)

This page was built for publication: New deterministic algorithm for constructing normal bases in finite fields

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