Andere Kunden interessierten sich auch für
![Finite Fields: Theory and Computation]( "Finite Fields: Theory and Computation")
Finite Fields: Theory and Computation153,99 €![Finite Fields: Theory and Computation]( "Finite Fields: Theory and Computation")
Finite Fields: Theory and Computation149,99 €![An Introduction to Mathematical Cryptography]( "An Introduction to Mathematical Cryptography")
An Introduction to Mathematical Cryptography31,99 €![Algebraic Aspects of Cryptography]( "Algebraic Aspects of Cryptography")
Algebraic Aspects of Cryptography134,99 €![Codes on Algebraic Curves]( "Codes on Algebraic Curves")
Codes on Algebraic Curves112,99 €![Applications of Algebraic Geometry to Coding Theory, Physics and Computation]( "Applications of Algebraic Geometry to Coding Theory, Physics and Computation")
Applications of Algebraic Geometry to Coding Theory, Physics and Computation77,99 €![Applied Abstract Algebra]( "Applied Abstract Algebra")
Applied Abstract Algebra60,99 €
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.
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.