Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Finite Fields: Theory and Computation - Igor Shparlinski

Finite Fields: Theory and Computation

The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography
Buch | Hardcover
528 Seiten
1999
Springer (Verlag)
978-0-7923-5662-2 (ISBN)
CHF 269,60 inkl. MwSt
Provides a survey of the achievements in the theory and applications of finite fields and in many related areas such as algebraic number theory, theoretical computer science, coding theory and cryptography. This book includes topics such as polynomial factorization over finite fields and constructing special bases of extensions of finite fields.
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.

Links flowchart.- 1. Polynomial Factorization.- 2. Finding Irreducible and Primitive Polynomials.- 3. The Distribution of Irreducible, Primitive and Other Special Polynomials and Matrices.- 4. Bases and Computation in Finite Fields.- 5. Coding Theory and Algebraic Curves.- 6. Elliptic Curves.- 7. Recurrence Sequences in Finite Fields and Cyclic Linear Codes.- 8. Finite Fields and Discrete Mathematics.- 9. Congruences.- 10. Some Related Problems.- Appendix 1.- Appendix 2.- Appendix 3.- References.

Reihe/Serie Mathematics and Its Applications ; 477
Zusatzinfo XIV, 528 p.
Verlagsort Dordrecht
Sprache englisch
Maße 156 x 234 mm
Themenwelt Mathematik / Informatik Mathematik Algebra
Mathematik / Informatik Mathematik Arithmetik / Zahlentheorie
ISBN-10 0-7923-5662-4 / 0792356624
ISBN-13 978-0-7923-5662-2 / 9780792356622
Zustand Neuware
Informationen gemäß Produktsicherheitsverordnung (GPSR)
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Begriffe, Sätze und zahlreiche Beispiele in kurzen Lerneinheiten

von Christian Karpfinger

Buch | Softcover (2022)
Springer Spektrum (Verlag)
CHF 76,95