Applications of Finite Fields


Book Description

The theory of finite fields, whose origins can be traced back to the works of Gauss and Galois, has played a part in various branches in mathematics. Inrecent years we have witnessed a resurgence of interest in finite fields, and this is partly due to important applications in coding theory and cryptography. The purpose of this book is to introduce the reader to some of these recent developments. It should be of interest to a wide range of students, researchers and practitioners in the disciplines of computer science, engineering and mathematics. We shall focus our attention on some specific recent developments in the theory and applications of finite fields. While the topics selected are treated in some depth, we have not attempted to be encyclopedic. Among the topics studied are different methods of representing the elements of a finite field (including normal bases and optimal normal bases), algorithms for factoring polynomials over finite fields, methods for constructing irreducible polynomials, the discrete logarithm problem and its implications to cryptography, the use of elliptic curves in constructing public key cryptosystems, and the uses of algebraic geometry in constructing good error-correcting codes. To limit the size of the volume we have been forced to omit some important applications of finite fields. Some of these missing applications are briefly mentioned in the Appendix along with some key references.




Finite Fields and Applications


Book Description

Finite fields Combinatorics Algebraic coding theory Cryptography Background in number theory and abstract algebra Hints for selected exercises References Index.




Finite Fields


Book Description

This book is devoted entirely to the theory of finite fields.




Handbook of Finite Fields


Book Description

Poised to become the leading reference in the field, the Handbook of Finite Fields is exclusively devoted to the theory and applications of finite fields. More than 80 international contributors compile state-of-the-art research in this definitive handbook. Edited by two renowned researchers, the book uses a uniform style and format throughout and




Finite Fields: Theory and Computation


Book Description

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.




Lectures on Finite Fields


Book Description

The theory of finite fields encompasses algebra, combinatorics, and number theory and has furnished widespread applications in other areas of mathematics and computer science. This book is a collection of selected topics in the theory of finite fields and related areas. The topics include basic facts about finite fields, polynomials over finite fields, Gauss sums, algebraic number theory and cyclotomic fields, zeros of polynomials over finite fields, and classical groups over finite fields. The book is mostly self-contained, and the material covered is accessible to readers with the knowledge of graduate algebra; the only exception is a section on function fields. Each chapter is supplied with a set of exercises. The book can be adopted as a text for a second year graduate course or used as a reference by researchers.




Finite Fields for Computer Scientists and Engineers


Book Description

This book developed from a course on finite fields I gave at the University of Illinois at Urbana-Champaign in the Spring semester of 1979. The course was taught at the request of an exceptional group of graduate students (includ ing Anselm Blumer, Fred Garber, Evaggelos Geraniotis, Jim Lehnert, Wayne Stark, and Mark Wallace) who had just taken a course on coding theory from me. The theory of finite fields is the mathematical foundation of algebraic coding theory, but in coding theory courses there is never much time to give more than a "Volkswagen" treatment of them. But my 1979 students wanted a "Cadillac" treatment, and this book differs very little from the course I gave in response. Since 1979 I have used a subset of my course notes (correspond ing roughly to Chapters 1-6) as the text for my "Volkswagen" treatment of finite fields whenever I teach coding theory. There is, ironically, no coding theory anywhere in the book! If this book had a longer title it would be "Finite fields, mostly of char acteristic 2, for engineering and computer science applications. " It certainly does not pretend to cover the general theory of finite fields in the profound depth that the recent book of Lidl and Neidereitter (see the Bibliography) does.




Combinatorics and Finite Fields


Book Description

Combinatorics and finite fields are of great importance in modern applications such as in the analysis of algorithms, in information and communication theory, and in signal processing and coding theory. This book contains survey articles on topics such as difference sets, polynomials, and pseudorandomness.




Finite Fields


Book Description

This book provides new research in finite fields. Chapter One presents some techniques that rely on a combination of results from graph theory, finite fields, matrix theory, and finite geometry to researchers working in the area of preserver problems. It also gives a brief presentation of this research field to other mathematicians. Chapter Two contains a basic and self-contained introduction to classical coherent state transforms, namely classical wavelet and classical wave-packet transforms, on finite fields. Chapter Three proposes an intrinsic representation of finite m? extension as this is a tradition for finite extension fields. Chapter Four reviews m? cyclic codes on a m? field. Chapter Five discusses two problems of Carlitz and their generalizations.




Lectures on Finite Fields and Galois Rings


Book Description

This is a textbook for graduate and upper level undergraduate students in mathematics, computer science, communication engineering and other fields. The explicit construction of finite fields and the computation in finite fields are emphasised. In particular, the construction of irreducible polynomials and the normal basis of finite fields are included. The essentials of Galois rings are also presented. This invaluable book has been written in a friendly style, so that lecturers can easily use it as a text and students can use it for self-study. A great number of exercises have been incorporated.




Recent Books