The Belgian block cipher Rijndael was chosen in 2000 by the U.S. government’s National Institute of Standards and Technology (NIST) to be the successor to the Data Encryption Standard. Rijndael was subsequently standardized as the Advanced Encryption Standard (AES), which is potentially the world’s most important block cipher. In 2002, some new analytical techniques were suggested that may have a dramatic effect on the security of the AES. Existing analytical techniques for block ciphers depend heavily on a statistical approach, whereas these new techniques are algebraic in nature. Algebraic Aspects of the Advanced Encryption Standard, appearing five years after publication of the AES, presents the state of the art for the use of such algebraic techniques in analyzing the AES. The primary audience for this work includes academic and industry researchers in cryptology; the book is also suitable for advanced-level students.

This book constítutes the thoroughly refereed postproceedings of the 4th International Conference on the Advanced Encryption Standard, AES 2004, held in Bonn, Germany in May 2004. The 10 revised full papers presented together with an introductory survey and 4 invited papers by leading researchers were carefully selected during two rounds of reviewing and improvement. The papers are organized in topical sections on cryptanalytic attacks and related topics, algebraic attacks and related results, hardware implementations, and other topics. All in all, the papers constitute a most up-to-date assessment of the state of the art of data encryption using the Advanced Encryption Standard AES, the de facto world standard for data encryption.

This textbook provides an introduction to the mathematics on which modern cryptology is based. It covers not only public key cryptography, the glamorous component of modern cryptology, but also pays considerable attention to secret key cryptography, its workhorse in practice. Modern cryptology has been described as the science of the integrity of information, covering all aspects like confidentiality, authenticity and non-repudiation and also including the protocols required for achieving these aims. In both theory and practice it requires notions and constructions from three major disciplines: computer science, electronic engineering and mathematics. Within mathematics, group theory, the theory of finite fields, and elementary number theory as well as some topics not normally covered in courses in algebra, such as the theory of Boolean functions and Shannon theory, are involved. Although essentially self-contained, a degree of mathematical maturity on the part of the reader is assumed, corresponding to his or her background in computer science or engineering. Algebra for Cryptologists is a textbook for an introductory course in cryptography or an upper undergraduate course in algebra, or for self-study in preparation for postgraduate study in cryptology.

Graduate-level introduction to error-correcting codes, which are used to protect digital data and applied in public key cryptosystems.

This book constitutes the thoroughly refereed post-proceedings of the 12th International Workshop on Fast Software Encryption, FSE 2005, held in Paris, France in February 2005. The 29 revised full papers presented were carefully reviewed and selected from 96 submissions. The papers address all current aspects of fast primitives for symmetric cryptology, including the design, cryptanalysis, and implementation of block ciphers, stream ciphers, hash functions, and message authentication codes.

This book constitutes the refereed proceedings of the 10th IMA International Conference on Cryptography and Coding, held in Cirencester, UK, in December 2005. The 26 revised full papers presented together with 4 invited contributions were carefully reviewed and selected from 94 submissions. The papers are organized in topical sections on coding theory, signatures and signcryption, symmetric cryptography, side channels, algebraic cryptanalysis, information theoretic applications, number theoretic foundations, and public key and ID-based encryption schemes.

Coding theory and cryptography allow secure and reliable data transmission, which is at the heart of modern communication. Nowadays, it is hard to find an electronic device without some code inside. Gröbner bases have emerged as the main tool in computational algebra, permitting numerous applications, both in theoretical contexts and in practical situations. This book is the first book ever giving a comprehensive overview on the application of commutative algebra to coding theory and cryptography. For example, all important properties of algebraic/geometric coding systems (including encoding, construction, decoding, list decoding) are individually analysed, reporting all significant approaches appeared in the literature. Also, stream ciphers, PK cryptography, symmetric cryptography and Polly Cracker systems deserve each a separate chapter, where all the relevant literature is reported and compared. While many short notes hint at new exciting directions, the reader will find that all chapters fit nicely within a unified notation.