Advertisement

Journal of Cryptology

, Volume 18, Issue 4, pp 337–355 | Cite as

Polynomial and Normal Bases for Finite Fields

  • Joachim von zur GathenEmail author
  • Michael NöckerEmail author
Article

Abstract

We discuss two different ways to speed up exponentiation in nonprime finite fields: on the one hand, reduction of the total number of operations, and on the other hand, fast computation of a single operation. Two data structures are particularly useful: sparse irreducible polynomials and normal bases. We report on implementation results for our methods.

Keywords

Data Structure Stochastic Process Information Theory Computational Mathematic Probability Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2005

Authors and Affiliations

  1. 1.Fakultat fur Elektrotechnik, Informatik, Mathematik, Universitat Paderborn, D-33095 PaderbornGermany

Personalised recommendations