Finite Fields: Theory and Computation
The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography
Authors: Shparlinski, Igor
Free PreviewBuy this book
- About this book
-
This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types and new applications of finite fields to other areas of mathematics. For completeness we in clude two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number gener ators, modular arithmetic, etc.) and computational number theory (primality testing, factoring integers, computation in algebraic number theory, etc.). The problems considered here have many applications in Computer Science, Cod ing Theory, Cryptography, Numerical Methods, and so on. There are a few books devoted to more general questions, but the results contained in this book have not till now been collected under one cover. In the present work the author has attempted to point out new links among different areas of the theory of finite fields. It contains many very important results which previously could be found only in widely scattered and hardly available conference proceedings and journals. In particular, we extensively review results which originally appeared only in Russian, and are not well known to mathematicians outside the former USSR.
- Reviews
-
`...the book can yet be highly recommended as encyclopaedia on these topics, in particular because many Russian papers are incorporated which are hardly accessible.'
Monatschafte für Mathematik, 132:1 (2001)
- Table of contents (12 chapters)
-
-
Introduction
Pages 1-11
-
Links Flowchart
Pages 13-15
-
Polynomial Factorization
Pages 17-44
-
Finding Irreducible and Primitive Polynomials
Pages 45-64
-
The Distribution of Irreducible, Primitive and Other Special Polynomials and Matrices
Pages 65-98
-
Table of contents (12 chapters)
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- Finite Fields: Theory and Computation
- Book Subtitle
- The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography
- Authors
-
- Igor Shparlinski
- Series Title
- Mathematics and Its Applications
- Series Volume
- 477
- Copyright
- 1999
- Publisher
- Springer Netherlands
- Copyright Holder
- Springer Science+Business Media B.V.
- eBook ISBN
- 978-94-015-9239-0
- DOI
- 10.1007/978-94-015-9239-0
- Hardcover ISBN
- 978-0-7923-5662-2
- Softcover ISBN
- 978-90-481-5203-2
- Edition Number
- 1
- Number of Pages
- XIV, 528
- Topics
*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works and instructor copies are not included.
