Computational and Algorithmic Problems in Finite Fields

Igor Shparlinski

ISBN 10: 9401047960 / ISBN 13: 9789401047968

Published by Springer Netherlands, 2012

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 'Et moi, . si j'avait su comment en revenir. je One service mathematics bas rendemI !be n'y semis point a1J6.' human race. It bas put common sense back JulesVeme where it belongs. on tile topmost sbelf next to tile dusty canister labelled 'discarded nonsense'. The series is divergent; therefore we may be Eric T.BeIl able to do something with il O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlineari ties abound. Similarly, all kinds of pans of mathematics serve as tools for other pans and for other sci ences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One ser vice topology has rendered mathematical physics . '; 'One service logic has rendered computer science . '; 'One service category theory has rendered mathematics . .'. All arguably true. And all statements obtainable this way fonn pan of the raison d' 8tre of this series.

Seller Inventory # 9789401047968

Bibliographic Details

• Title: Computational and Algorithmic Problems in Finite Fields
• Publisher: Springer Netherlands
• Publication Date: 2012
• Language: English
• ISBN 10: 9401047960
• ISBN 13: 9789401047968
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 240W x 160H x 15D millimeters 240 millimeters width by 160 millimeters height by 15 millimeters depth
• Weight: 415 grams

About this title

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.