Computational and Algorithmic Problems in Finite Fields

preview-18
  • Computational and Algorithmic Problems in Finite Fields Book Detail

  • Author : Igor Shparlinski
  • Release Date : 2012-12-06
  • Publisher : Springer Science & Business Media
  • Genre : Mathematics
  • Pages : 253
  • ISBN 13 : 940111806X
  • File Size : 11,11 MB

Computational and Algorithmic Problems in Finite Fields by Igor Shparlinski PDF Summary

Book Description: 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.

Disclaimer: www.yourbookbest.com does not own Computational and Algorithmic Problems in Finite Fields books pdf, neither created or scanned. We just provide the link that is already available on the internet, public domain and in Google Drive. If any way it violates the law or has any issues, then kindly mail us via contact us page to request the removal of the link.

Recurrence Sequences

Recurrence Sequences

File Size : 13,13 MB
Total View : 579 Views
DOWNLOAD

Recurrence sequences are of great intrinsic interest and have been a central part of number theory for many years. Moreover, these sequences appear almost every

75 Years of Mathematics of Computation

75 Years of Mathematics of Computation

File Size : 20,20 MB
Total View : 2937 Views
DOWNLOAD

The year 2018 marked the 75th anniversary of the founding of Mathematics of Computation, one of the four primary research journals published by the American Mat

CryptoSchool

CryptoSchool

File Size : 69,69 MB
Total View : 8992 Views
DOWNLOAD

This book offers an introduction to cryptology, the science that makes secure communications possible, and addresses its two complementary aspects: cryptography