FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Computational and Algorithmic Problems in Finite Fields

Computational and Algorithmic Problems in Finite Fields

Igor E. Shparlinski
    Product form
      FORMAT: Hardback

      R 3,003.32 Price and availability exclusive to website

      YOU COULD EARN 3,003.32 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 500.55 per month!
      3x monthly payments of R 1,001.10 with
      4x fortnightly payments of R 750.83 with
      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 areas 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 presupposes 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.
      Format: CONTRIBUTORS: Igor E. Shparlinski EAN: 9780792320579 COUNTRY: United States PAGES: WEIGHT: 538 g HEIGHT: 234 cm
      PUBLISHED BY: Kluwer Academic Publishers DATE PUBLISHED: 1992-11-30 CITY: GENRE: COMPUTERS / Computer Science, MATHEMATICS / Algebra / General, MATHEMATICS / Number Theory WIDTH: 156 cm SPINE:

      Book Themes:

      Algebra, Number theory

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      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 areas 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 presupposes 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.
      Format: CONTRIBUTORS: Igor E. Shparlinski EAN: 9780792320579 COUNTRY: United States PAGES: WEIGHT: 538 g HEIGHT: 234 cm
      PUBLISHED BY: Kluwer Academic Publishers DATE PUBLISHED: 1992-11-30 CITY: GENRE: COMPUTERS / Computer Science, MATHEMATICS / Algebra / General, MATHEMATICS / Number Theory WIDTH: 156 cm SPINE:

      Book Themes:

      Algebra, Number theory

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account