Fast arithmetic with general Gauß periods

Authors:
Joachim von zur Gathen;Michael Nöcker
Affiliations:
Faculty of Computer Science, Electrical Engineering, and Mathematics, University of Paderborn, D-33095 Paderborn, Germany;Faculty of Computer Science, Electrical Engineering, and Mathematics, University of Paderborn, D-33095 Paderborn, Germany
Venue:
Theoretical Computer Science - Algebraic and numerical algorithm
Year:
2004

Citing 8
Cited 1

Optimal normal bases in GF(pn)

Discrete Applied Mathematics
On arithmetical algorithms over finite fields

Journal of Combinatorial Theory Series A
Low complexity normal bases

Discrete Applied Mathematics
Gauss periods: orders and cryptographical applications

Mathematics of Computation
Normal bases via general Gauss periods

Mathematics of Computation
Algorithms for exponentiation in finite fields

Journal of Symbolic Computation
Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract)

LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
Abelian Groups, Gauss Periods, and Normal Bases

Finite Fields and Their Applications

Gauss periods as constructions of low complexity normal bases

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how to apply fast arithmetic in conjunction with general Gauß periods in finite fields. This is an essential ingredient for some efficient exponentiation algorithms.