Abstract
Throughout this chapter we use the following notation: p denotes a prime number, n a natural number, q:= p n. F = F q is the finite field of p n elements and w a primitive root of F, i.e. F × = 〈w〉. In general, arithmetic in F will be done by using two representations for its elements x: (i)
, (ii)
. Then addition and subtraction is done by the first, multiplication and division by the second representation. Thus all we need are two tables allowing to switch from one representation to the other. These ideas are useful if p n is not really large.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Basel AG
About this chapter
Cite this chapter
Pohst, M.E. (1993). Topics from finite fields. In: Computational Algebraic Number Theory. DMV Seminar, vol 21. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8589-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8589-8_2
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-7643-2913-6
Online ISBN: 978-3-0348-8589-8
eBook Packages: Springer Book Archive