Computational and Algorithmic Problems in Finite Fields - Couverture souple

Shparlinski, Igor

 
9789401047968: Computational and Algorithmic Problems in Finite Fields
Couverture souple
ISBN 10 : 9401047960 ISBN 13 : 9789401047968
Editeur : Springer, 2012

Synopsis

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 araes 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 presuppose 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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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 araes 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 presuppose 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.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Springer
Date d'édition
2012
Langue
anglais
ISBN 10 
9401047960
ISBN 13 
9789401047968
Reliure
Broché
Nombre de pages
256
Coordonnées du fabricant
non disponible
Personne responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Allemagne

Autres éditions populaires du même titre

9780792320579: Computational and Algorithmic Problems in Finite Fields

Edition présentée

ISBN 10 :  0792320573 ISBN 13 :  9780792320579
Editeur : Kluwer Academic Publishers, 1992
Couverture rigide