Series On Coding Theory And Cryptology - Böcker

The aim of this book is to provide a comprehensive introduction to cryptography without using complex mathematical constructions. The themes are conveyed in a form that only requires a basic knowledge of mathematics, but the methods are described in sufficient detail to enable their computer implementation.The book describes the main techniques and facilities of contemporary cryptography, proving key results along the way. The contents of the first five chapters can be used for one-semester course.

There are two basic methods of error control for communication, both involving coding of the messages. With forward error correction, the codes are used to detect and correct errors. In a repeat request system, the codes are used to detect errors and, if there are errors, request a retransmission. Error detection is usually much simpler to implement than error correction and is widely used. However, it is given a very cursory treatment in almost all textbooks on coding theory. Only a few older books are devoted to error detecting codes.This book begins with a short introduction to the theory of block codes with emphasis on the parts important for error detection. The weight distribution is particularly important for this application and is treated in more detail than in most books on error correction. A detailed account of the known results on the probability of undetected error on the q-ary symmetric channel is also given.

In the new era of technology and advanced communications, coding theory and cryptography play a particularly significant role with a huge amount of research being done in both areas. This book presents some of that research, authored by prominent experts in the field.The book contains articles from a variety of topics most of which are from coding theory. Such topics include codes over order domains, Groebner representation of linear codes, Griesmer codes, optical orthogonal codes, lattices and theta functions related to codes, Goppa codes and Tschirnhausen modules, s-extremal codes, automorphisms of codes, etc. There are also papers in cryptography which include articles on extremal graph theory and its applications in cryptography, fast arithmetic on hyperelliptic curves via continued fraction expansions, etc. Researchers working in coding theory and cryptography will find this book an excellent source of information on recent 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.

Over the past years, the rapid growth of the Internet and World Wide Web has provided great opportunities for online commercial activities, business transactions and government services over open computer and communication networks. However, such developments are only possible if communications can be conducted in a secure and reliable manner. The mathematical theory and practice of coding theory and cryptology underpin the provision of effective security and reliability for data communication, processing and storage. Theoretical and practical advances in these fields are therefore a key factor in facilitating the growth of data communications and data networks.The aim of the International Workshop on Coding and Cryptology 2007 was to bring together experts from coding theory, cryptology and their related areas for a fruitful exchange of ideas in order to stimulate further research and collaboration among mathematicians, computer scientists, practical cryptographers and engineers. This post-proceedings of the workshop consists of 20 selected papers on a wide range of topics in coding theory and cryptology, including theory, techniques, applications, and practical experiences. They cover significant advances in these areas and contain very useful surveys.

The last few years have witnessed rapid advancements in information and coding theory research and applications. This book provides a comprehensive guide to selected topics, both ongoing and emerging, in information and coding theory. Consisting of contributions from well-known and high-profile researchers in their respective specialties, topics that are covered include source coding; channel capacity; linear complexity; code construction, existence and analysis; bounds on codes and designs; space-time coding; LDPC codes; and codes and cryptography.All of the chapters are integrated in a manner that renders the book as a supplementary reference volume or textbook for use in both undergraduate and graduate courses on information and coding theory. As such, it will be a valuable text for students at both undergraduate and graduate levels as well as instructors, researchers, engineers, and practitioners in these fields.

This is the proceedings volume of the International Centre for Pure and Applied Mathematics Summer School course held in Ankara, Turkey, in August 2008. Contributors include Boztaş, Udaya, Dinh, Ling, López-Permouth, Szabo, Honold, Landjev and Wood. The aim is to present a survey in fundamental areas and highlight some recent results.

This book discusses cryptographic and combinatorial properties of Boolean functions. Boolean functions are very easy to understand (but deep in analysis) and the subject covers significant amount of material in digital circuits, communication theory, VLSI design, computer science, coding theory and Mathematics. Boolean function is considered as one of the most basic building blocks in cryptographic system design. The properties that make a Boolean function suitable for a cryptographic system, are mostly combinatorial. We discuss these properties (e.g., balancedness, nonlinearity, correlation immunity, propagation characteristics, algebraic immunity) in detail. For each of the properties, existing research results and the recent contributions in the literature will be presented. The basic material will always contain hardcore theoretical results. However, we present the materials in a way that a person with undergraduate level mathematical background can access it. Implementation details related to these properties (e.g., how to check in writing a program whether a Boolean function is correlation immune) will be detailed.In addition to theoretical construction techniques for Boolean functions with different combinatorial and cryptographic properties, the book will concentrate on different state-of-the-art search techniques. In some cases these search techniques provide better results than the construction techniques for low number of input variables and they are quite interesting as the size of the complete set of Boolean functions is super exponential in the number of input variables. Different symmetries in the set of Boolean functions will also be presented in detail. The author will present the inherent beauty of Boolean functions that he has experienced in his research career.