Zum Hauptinhalt springen Zur Suche springen Zur Hauptnavigation springen
Beschreibung
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.
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.
Inhaltsverzeichnis
1 Introduction to Finite Fields and Bases.- 2 Factoring Polynomials over Finite Fields.- 3 Construction of Irreducible Polynomials.- 4 Normal Bases.- 5 Optimal Normal Bases.- 6 The Discrete Logarithm Problem.- 7 Elliptic Curves over Finite Fields.- 8 Elliptic Curve Cryptosystems.- 9 Introduction to Algebraic Geometry.- 10 Codes From Algebraic Geometry.- Appendix - Other Applications.
Details
Erscheinungsjahr: 1992
Genre: Importe, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Inhalt: xiv
218 S.
ISBN-13: 9780792392828
ISBN-10: 0792392825
Sprache: Englisch
Einband: Gebunden
Autor: Menezes, Alfred J.
Blake, Ian F.
Yaghoobian, Tomik
Mullin, Ronald C.
Vanstone, Scott A.
Xuhong Gao
Hersteller: Springer US
Springer US, New York, N.Y.
Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com
Maße: 241 x 160 x 18 mm
Von/Mit: Alfred J. Menezes (u. a.)
Erscheinungsdatum: 30.11.1992
Gewicht: 0,524 kg
Artikel-ID: 102522814

Ähnliche Produkte