This textbook equips graduate students and advanced undergraduates with the necessary theoretical tools for applying algebraic geometry to information theory, and it covers primary applications in coding theory and cryptography. Harald Niederreiter and Chaoping Xing provide the first detailed discussion of the interplay between nonsingular projective curves and algebraic function fields over finite fields. This interplay is fundamental to research in the field today, yet until now no other textbook has featured complete proofs of it. Niederreiter and Xing cover classical applications like algebraic-geometry codes and elliptic-curve cryptosystems as well as material not treated by other books, including function-field codes, digital nets, code-based public-key cryptosystems, and frameproof codes. Combining a systematic development of theory with a broad selection of real-world applications, this is the most comprehensive yet accessible introduction to the field available. Introduces graduate students and advanced undergraduates to the foundations of algebraic geometry for applications to information theory Provides the first detailed discussion of the interplay between projective curves and algebraic function fields over finite fields Includes applications to coding theory and cryptography Covers the latest advances in algebraic-geometry codes Features applications to cryptography not treated in other books

Covering topics in algebraic geometry, coding theory, and cryptography, this volume presents interdisciplinary group research completed for the February 2016 conference at the Institute for Pure and Applied Mathematics (IPAM) in cooperation with the Association for Women in Mathematics (AWM). The conference gathered research communities across disciplines to share ideas and problems in their fields and formed small research groups made up of graduate students, postdoctoral researchers, junior faculty, and group leaders who designed and led the projects. Peer reviewed and revised, each of this volume's five papers achieves the conference’s goal of using algebraic geometry to address a problem in either coding theory or cryptography. Proposed variants of the McEliece cryptosystem based on different constructions of codes, constructions of locally recoverable codes from algebraic curves and surfaces, and algebraic approaches to the multicast network coding problem are only some of the topics covered in this volume. Researchers and graduate-level students interested in the interactions between algebraic geometry and both coding theory and cryptography will find this volume valuable.

The theory of algebraic function fields over finite fields has its origins in number theory. However, after Goppa`s discovery of algebraic geometry codes around 1980, many applications of function fields were found in different areas of mathematics and information theory. This book presents survey articles on some of these new developments. The topics focus on material which has not yet been presented in other books or survey articles.

This volume contains the proceedings of the 17th International Conference on Arithmetic, Geometry, Cryptography and Coding Theory (AGC2T-17), held from June 10–14, 2019, at the Centre International de Rencontres Mathématiques in Marseille, France. The conference was dedicated to the memory of Gilles Lachaud, one of the founding fathers of the AGC2T series. Since the first meeting in 1987 the biennial AGC2T meetings have brought together the leading experts on arithmetic and algebraic geometry, and the connections to coding theory, cryptography, and algorithmic complexity. This volume highlights important new developments in the field.

This volume contains the proceedings of the 15th International Conference on Arithmetic, Geometry, Cryptography, and Coding Theory (AGCT), held at the Centre International de Rencontres Mathématiques in Marseille, France, from May 18–22, 2015. Since the first meeting almost 30 years ago, the biennial AGCT meetings have been one of the main events bringing together researchers interested in explicit aspects of arithmetic geometry and applications to coding theory and cryptography. This volume contains original research articles reflecting recent developments in the field.

This volume contains the proceedings of the 18th International Conference on Arithmetic, Geometry, Cryptography, and Coding Theory, held (online) from May 31 to June 4, 2021. For over thirty years, the biennial international conference AGC$^2$T (Arithmetic, Geometry, Cryptography, and Coding Theory) has brought researchers together to forge connections between arithmetic geometry and its applications to coding theory and to cryptography. The papers illustrate the fruitful interaction between abstract theory and explicit computations, covering a large range of topics, including Belyi maps, Galois representations attached to elliptic curves, reconstruction of curves from their Jacobians, isogeny graphs of abelian varieties, hypergeometric equations, and Drinfeld modules.

This volume contains the proceedings of the 12th conference on Arithmetic, Geometry, Cryptography and Coding Theory, held in Marseille, France from March 30 to April 3, 2009, as well as the first Geocrypt conference, held in Pointe-a-Pitre, Guadeloupe from April 27 to May 1, 2009, and the European Science Foundation exploratory workshop on Curves, Coding Theory, and Cryptography, held in Marseille, France from March 25 to 29, 2009. The articles contained in this volume come from three related symposia organized by the group Arithmetique et Theorie de l'Information in Marseille. The topics cover arithmetic properties of curves and higher dimensional varieties with applications to codes and cryptography.

A series of research papers on various aspects of coding theory, cryptography, and other areas, including new and unpublished results on the subjects. The book will be useful to students, researchers, professionals, and tutors interested in this area of research.

Advances in Algebraic Geometry Codes presents the most successful applications of algebraic geometry to the field of error-correcting codes, which are used in the industry when one sends information through a noisy channel. The noise in a channel is the corruption of a part of the information due to either interferences in the telecommunications or degradation of the information-storing support (for instance, compact disc). An error-correcting code thus adds extra information to the message to be transmitted with the aim of recovering the sent information. With contributions from renowned researchers, this pioneering book will be of value to mathematicians, computer scientists, and engineers in information theory.

In 1999, a conference called International Meeting on Coding Theory and Cryptography took place at Mota Castle in Castilia (Spain). The conference had great acceptance within the community of coding theory and cryptography researchers. At that moment, and also nowadays, there are not many international workshops about these topics, at least if we compare with other mathematical and engineering subjects of research. Therefore, the general desire was to continue with more Castle Meetings. However, the following conference did not take place until 2008. In that case, the conference was called II International Castle Meeting on Coding Theory and Applications allowing more topics related to coding theory apart from cryptography. Such conference took place at Mota Castle again and the number of participants was similar to the previous edition. The present edition of the conference, called III International Castle Meeting on Coding Theory and Applications has been held at Cardona Castle in Catalonia (Spain). The number of communications has increased and a number of selected papers will be published in a special issue of the journal Designs, Codes and Cryptography. As in the previous editions, the conference has been of high level with notorious invited speakers and scientic committee members.