Fast arithmetic with general Gauß periods

DOI10.1016/j.tcs.2004.01.012zbMath1074.68083OpenAlexW1990879702MaRDI QIDQ598216

Joachim von zur Gathen, Michael Nöcker

Publication date: 6 August 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.01.012

zbMATH Keywords

Finite fieldsEfficient arithmeticExponentiationGauß periodNormal basis

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (6)

On design of circuits of logarithmic depth for inversion in finite fields ⋮ Computing special powers in finite fields ⋮ Complexity of computation in finite fields ⋮ Finding normal bases over finite fields with prescribed trace self-orthogonal relations ⋮ Gauss periods as constructions of low complexity normal bases ⋮ MULTIPLICATIVE ORDER OF GAUSS PERIODS

Cites Work

• On arithmetical algorithms over finite fields
• Low complexity normal bases
• Optimal normal bases in \(GF(p^ n)\)
• Fast multiplication of polynomials over fields of characteristic 2
• Algorithms for exponentiation in finite fields
• Fast multiplication of large numbers
• Normal bases via general Gauss periods
• Gauss periods: orders and cryptographical applications
• Abelian groups, Gauss periods, and normal bases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast arithmetic with general Gauß periods