Finite Fields: Theory and Computation

En savoir plus sur le livre

Focusing on computational and algorithmic challenges in finite fields, this book explores polynomial factorization, the identification of irreducible and primitive polynomials, and their applications to elliptic curves. It also discusses recent advancements in congruences and computational number theory, covering topics like primality testing and modular arithmetic. The author highlights previously scattered results, including significant findings from Russian sources, making this work a comprehensive resource for applications in computer science, coding theory, and cryptography.