Finite Fields: Theory and Computation

The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography

Autori

• Igor Shparlinski

Parametri

• 544 pagine
• 20 ore di lettura

• Matematica

Maggiori informazioni sul libro

Focusing on computational and algorithmic challenges in finite fields, this book covers polynomial factorization, irreducible and primitive polynomials, and their applications in areas like coding theory and cryptography. It also explores recent advances in congruences and computational number theory, including primality testing and modular arithmetic. The author highlights previously scattered results, particularly those from Russian sources, making significant contributions to the field accessible to a broader audience.

Lingua: Inglese

Pubblicato: 2010

(In brossura)