Applications of Finite Fields

Menezes, A. J.; Blake, Ian F.; XuHong, Gao; Mullin, Ronald C.; Vanstone, Scott A.; Yaghoobian, Tomik (Department of Combinatorics and Optimization, U

ISBN 10: 0792392825 / ISBN 13: 9780792392828

Edité par Kluwer Academic Publishers, 1992

A propos de cet article

Focuses attention on some specific developments in the theory and applications of finite fields. This book studies topics such as the different methods of representing the elements of a finite field, algorithms for factoring polynomials over finite fields and methods for constructing irreducible polynomials. Series: The Springer International Series in Engineering and Computer Science. Num Pages: 218 pages, biography. BIC Classification: GPFC; TJ. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 14. Weight in Grams: 509. . 1992. Hardback. . . . .

N° de réf. du vendeur V9780792392828

Détails bibliographiques

• Titre: Applications of Finite Fields
• Éditeur: Kluwer Academic Publishers
• Date de parution: 1992
• Langue: anglais
• ISBN à 10 chiffres: 0792392825
• ISBN à 13 chiffres: 9780792392828
• Reliure: Couverture rigide
• État de l'article: New

A propos de ce titre

Synopsis

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.