Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

Finite Fields: Theory and Computation: The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography

Finite Fields: Theory and Computation: The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography
Catalogue Information
Field name Details
Dewey Class 512.3
Title Finite Fields: Theory and Computation ([EBook] :) : The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography / / by Igor E. Shparlinski.
Author Shparlinski, Igor E.
Other name(s) SpringerLink (Online service)
Publication Dordrecht : : Springer Netherlands : : Imprint: Springer, , 1999.
Physical Details XIV, 528 p. : online resource.
Series Mathematics and its applications ; 477
ISBN 9789401592390
Summary Note This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the 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 we in­ clude two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number gener­ ators, modular arithmetic, etc.) and computational number theory (primality testing, factoring integers, computation in algebraic number theory, etc.). The problems considered here have many applications in Computer Science, Cod­ ing Theory, Cryptography, Numerical Methods, and so on. There are a few books devoted to more general questions, but the results contained in this book have not till now been collected under one cover. In the present work the author has attempted to point out new links among different areas of the theory of finite fields. It contains many very important results which previously could be found only in widely scattered and hardly available conference proceedings and journals. In particular, we extensively review results which originally appeared only in Russian, and are not well known to mathematicians outside the former USSR.:
Contents note Links flowchart -- 1. Polynomial Factorization -- 2. Finding Irreducible and Primitive Polynomials -- 3. The Distribution of Irreducible, Primitive and Other Special Polynomials and Matrices -- 4. Bases and Computation in Finite Fields -- 5. Coding Theory and Algebraic Curves -- 6. Elliptic Curves -- 7. Recurrence Sequences in Finite Fields and Cyclic Linear Codes -- 8. Finite Fields and Discrete Mathematics -- 9. Congruences -- 10. Some Related Problems -- Appendix 1 -- Appendix 2 -- Appendix 3 -- References.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site http://dx.doi.org/10.1007/978-94-015-9239-0
Links to Related Works
Subject References:
Authors:
See Also:
Corporate Authors:
Series:
Classification:
Catalogue Information 43603 Beginning of record . Catalogue Information 43603 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating43603
Quick Search