Computational and Algorithmic Problems in Finite Fields Igor E. Shparlinski

ISBN: 9780792320579

Published: November 30th 1992

Hardcover

240 pages


Description

Computational and Algorithmic Problems in Finite Fields  by  Igor E. Shparlinski

Computational and Algorithmic Problems in Finite Fields by Igor E. Shparlinski
November 30th 1992 | Hardcover | PDF, EPUB, FB2, DjVu, audiobook, mp3, ZIP | 240 pages | ISBN: 9780792320579 | 5.32 Mb

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 primitiveMoreThis 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.



Enter the sum





Related Archive Books



Related Books


Comments

Comments for "Computational and Algorithmic Problems in Finite Fields":


rzepaczki.pl

©2010-2015 | DMCA | Contact us