scientific article
From MaRDI portal
Publication:3142322
zbMath0786.11069MaRDI QIDQ3142322
Publication date: 15 November 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
finite fieldsasymptotic formulairreducible trinomialslow-complexity normal basesprobabilistic algorithms for finding primitive elements
Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)
Related Items (9)
Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields ⋮ Computing special powers in finite fields ⋮ Fast arithmetic with general Gauß periods ⋮ On the existence of some specific elements in finite fields of characteristic 2 ⋮ Gauss periods: orders and cryptographical applications ⋮ Abelian groups, Gauss periods, and normal bases ⋮ Primitive elements with prescribed trace ⋮ Elliptic periods for finite fields ⋮ Algorithms for exponentiation in finite fields
This page was built for publication:
