Ian F. Blake – författare

Since the appearance of the authors' first volume on elliptic curve cryptography in 1999 there has been tremendous progress in the field. In some topics, particularly point counting, the progress has been spectacular. Other topics such as the Weil and Tate pairings have been applied in new and important ways to cryptographic protocols that hold great promise. Notions such as provable security, side channel analysis and the Weil descent technique have also grown in importance. This second volume addresses these advances and brings the reader up to date. Prominent contributors to the research literature in these areas have provided articles that reflect the current state of these important topics. They are divided into the areas of protocols, implementation techniques, mathematical foundations and pairing based cryptography. Each of the topics is presented in an accessible, coherent and consistent manner for a wide audience that will include mathematicians, computer scientists and engineers.

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.

Critical coding techniques have developed over the past few decades for data storage, retrieval and transmission systems, significantly mitigating costs for governments and corporations that maintain server systems containing large amounts of data. This book surveys the basic ideas of these coding techniques, which tend not to be covered in the graduate curricula, including pointers to further reading. Written in an informal style, it avoids detailed coverage of proofs, making it an ideal refresher or brief introduction for students and researchers in academia and industry who may not have the time to commit to understanding them deeply. Topics covered include fountain codes designed for large file downloads; LDPC and polar codes for error correction; network, rank metric, and subspace codes for the transmission of data through networks; post-quantum computing; and quantum error correction. Readers are assumed to have taken basic courses on algebraic coding and information theory.

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 areas of communications, computer networks, and signal processing have undergone rapid development over the past several years. The advent of VLSI circuitry and increasingly sophisticated computer hardware and software techniques have made possible the construction of systems and signal proces­ sors for· communications applications not contemplated only a short time ago. The increasing complexity of communication systems, both by themselves and in land-based or satellite networks, has created a greater need for finding use­ ful mathematical techniques for their analysis. The rapidly evolving technolo­ gies involved continue to find exciting new areas for application, and it remains a challenge for researchers to keep abreast of developments. In this volume researchers from a broad cross section of the areas of communications, signal processing, and computer networks have been invited to contribute articles to assist readers in learning about the current state of research and future research directions in their area. The authors were not given tight guidelines for their contributions and thus the character and emphasis of each chapter differs. Although the scope of the areas considered is necessarily limited in a volume of this size, the coverage here is quite broad and it is hoped that the reader will find the contents of this volume to be interesting, useful, and informative.

The areas of communications, computer networks, and signal processing have undergone rapid development over the past several years. The advent of VLSI circuitry and increasingly sophisticated computer hardware and software techniques have made possible the construction of systems and signal proces­ sors for· communications applications not contemplated only a short time ago. The increasing complexity of communication systems, both by themselves and in land-based or satellite networks, has created a greater need for finding use­ ful mathematical techniques for their analysis. The rapidly evolving technolo­ gies involved continue to find exciting new areas for application, and it remains a challenge for researchers to keep abreast of developments. In this volume researchers from a broad cross section of the areas of communications, signal processing, and computer networks have been invited to contribute articles to assist readers in learning about the current state of research and future research directions in their area. The authors were not given tight guidelines for their contributions and thus the character and emphasis of each chapter differs. Although the scope of the areas considered is necessarily limited in a volume of this size, the coverage here is quite broad and it is hoped that the reader will find the contents of this volume to be interesting, useful, and informative.

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.

An Introduction to Algebraic and Combinatorial Coding Theory focuses on the principles, operations, and approaches involved in the combinatorial coding theory, including linear transformations, chain groups, vector spaces, and combinatorial constructions. The publication first offers information on finite fields and coding theory and combinatorial constructions and coding. Discussions focus on quadratic residues and codes, self-dual and quasicyclic codes, balanced incomplete block designs and codes, polynomial approach to coding, and linear transformations of vector spaces over finite fields. The text then examines coding and combinatorics, including chains and chain groups, equidistant codes, matroids, graphs, and coding, matroids, and dual chain groups. The manuscript also ponders on Möbius inversion formula, Lucas''s theorem, and Mathieu groups. The publication is a valuable source of information for mathematicians and researchers interested in the combinatorial coding theory.