scientific article; zbMATH DE number 446402

MaRDI QIDQ3142322zbMATH OpenFDO

Authors Alfred Wassermann

Publication date 15 November 1993

zbMATH Keywords

asymptotic formulafinite fieldsirreducible trinomialslow-complexity normal basesprobabilistic algorithms for finding primitive elements

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 815372
• scientific article; zbMATH DE number 1047540
• Constructing normal bases in finite fields
• On the distribution of irreducible trinomials over \(\mathbb F_3\)
• Irreducible trinomials over finite fields

Cited in

(15)

• Algorithms for exponentiation in finite fields
• Primitive elements with prescribed trace
• Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields
• Elliptic periods for finite fields
• Estimating the number of roots of trinomials over finite fields
• On extended fundamental classes over a finite field
• On some problems in the theory of finite fields
• Gauss periods: orders and cryptographical applications
• On the existence of some specific elements in finite fields of characteristic 2
• Computing special powers in finite fields
• scientific article; zbMATH DE number 815372 (Why is no real title available?)
• On restricted arithmetic progressions over finite fields
• Abelian groups, Gauss periods, and normal bases
• Fast arithmetic with general Gauß periods
• On arithmetical algorithms over finite fields

This page was built for publication:

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