Computational and Algorithmic Problems in Finite Fields
Seiten
1992
Kluwer Academic Publishers (Verlag)
978-0-7923-2057-9 (ISBN)
Kluwer Academic Publishers (Verlag)
978-0-7923-2057-9 (ISBN)
A treatment of computation and algorithms for finite fields. The book covers such topics as polynomial factorization, distribution of primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and applications of finite fields to areas of mathematics.
This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, 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, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc). The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presupposes only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.
This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, 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, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc). The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presupposes only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.
Polynomial factorization; finding irreducible and primitive polynomials; the distribution of irreducible and primitive polynomials; bases and computation in finite fields; coding theory and algebraic curves; elliptic curves; recurrent sequences in finite fields and linear cyclic codes; finite fields and discrete mathematics; congruences; some related problems.
| Reihe/Serie | Mathematics and its Applications ; v. 88 |
|---|---|
| Zusatzinfo | appendices, references, index |
| Sprache | englisch |
| Maße | 156 x 234 mm |
| Gewicht | 538 g |
| Einbandart | gebunden |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Algebra |
| Mathematik / Informatik ► Mathematik ► Arithmetik / Zahlentheorie | |
| ISBN-10 | 0-7923-2057-3 / 0792320573 |
| ISBN-13 | 978-0-7923-2057-9 / 9780792320579 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2022)
Springer Spektrum (Verlag)
CHF 55,95
