scientific article; zbMATH DE number 1246620
From MaRDI portal
Publication:4226694
zbMath0906.11056MaRDI QIDQ4226694
Daniel Panario, Joachim von zur Gathen, Shuhong Gao
Publication date: 28 January 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Number-theoretic algorithms; complexity (11Y16) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Cyclotomy (11T22)
Related Items (9)
Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields ⋮ Fast arithmetic with general Gauß periods ⋮ Complexity of computation in finite fields ⋮ Fast norm computation in smooth-degree abelian number fields ⋮ The equivariant complexity of multiplication in finite field extensions ⋮ 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
This page was built for publication:
