The Design of Rijndael: AES - The Advanced Encryption Standard / Edition 1

by Joan Daemen, Vincent Rijmen

Overview

Rijndael was the surprise winner of the contest for the new Advanced En­ cryption Standard (AES) for the United States. This contest was organized and run by the National Institute for Standards and Technology (NIST) be­ ginning in January 1997; Rijndael was announced as the winner in October 2000. It was the "surprise winner" because many observers (and even some participants) expressed scepticism that the D.S. government would adopt as an encryption standard any algorithm that was not designed by D.S. citizens. Yet NIST ran an open, international, selection process that should serve as model for other standards organizations. For example, NIST held their 1999 AES meeting in Rome, Italy. The five finalist algorithms were designed by teams from all over the world. In the end, the elegance, efficiency, security, and principled design of Rijndael won the day for its two Belgian designers, Joan Daemen and Vincent Rijmen, over the competing finalist designs from RSA, IBM, Counterpane Systems, and an EnglishjIsraelijDanish team. This book is the story of the design of Rijndael, as told by the designers themselves. It outlines the foundations of Rijndael in relation to the previous ciphers the authors have designed. It explains the mathematics needed to and the operation of Rijndael, and it provides reference C code and underst test vectors for the cipher.

Product Details

ISBN-13:	9783540425809
Publisher:	Springer Berlin Heidelberg
Publication date:	03/22/2002
Series:	Information Security and Cryptography
Edition description:	2002
Pages:	238
Product dimensions:	6.10(w) x 9.25(h) x 0.02(d)

About the Author

After graduating in electromechanical engineering Joan Daemen was awarded his PhD in 1995 from KU Leuven. Researching there in the ESAT/COSIC lab he developed the Rijndael algorithm with Vincent Rijmen, and this was selected by NIST as the new Advanced Encryption Standard in 2000. After over 20 years of security industry experience, including work as a security architect and cryptographer for STMicroelectronics, he is now a professor in the Digital Security Group at Radboud University Nijmegen. He codesigned the Keccak cryptographic hash which was selected as the new SHA-3 hash by NIST in 2012. In 2017 he won the Levchin Prize for Real World Cryptography "for the development of AES and SHA3". In 2018 he was awarded an ERC advanced grant for research on the foundations of security in symmetric cryptography.

After graduating in electronics engineering, Vincent Rijmen was awarded his PhD in 1997 from KU Leuven. Researching there in the ESAT/COSIC lab he developed the Rijndael algorithm with Joan Daemen, and this was selected by NIST as the new Advanced Encryption Standard in 2000. After work in the security industry, as chief cryptographer at Cryptomathic, he was first a professor at Technische Universität Graz and now in the COSIC Lab in Leuven. He is also an adjunct professor at the Selmer Center (University of Bergen). In 2019, he was named a Fellow of the International Association for Cryptologic Research for "co-designing AES, contributions to the design and cryptanalysis of symmetric primitives, and service to the IACR". His research interests include symmetric cryptography and cryptanalysis, side-channel attacks, and mathematical theories for the design of symmetric cryptography primitives.

Table of Contents

1. The Advanced Encryption Standard Process.- 2. Preliminaries.- 3. Specification of Rijndael.- 4. Implementation Aspects.- 5. Design Philosophy.- 6. The Data Encryption Standard.- 7. Correlation Matrices.- 8. Difference Propagation.- 9. The Wide Trail Strategy.- 10. Cryptanalysis.- 11. Related Block Ciphers.- Appendices.- A. Propagation Analysis in Galois Fields.- A.1.1 Difference Propagation.- A.l.2 Correlation.- A. 1.4 Functions that are Linear over GF(2).- A.2.1 Difference Propagation.- A.2.2 Correlation.- A.2.4 Functions that are Linear over GF(2).- A.3.3 Dual Bases.- A.4.2 Relationship Between Trace Patterns and Selection Patterns.- A.4.4 Illustration.- A.5 Rijndael-GF.- B. Trail Clustering.- B.1 Transformations with Maximum Branch Number.- B.2 Bounds for Two Rounds.- B.2.1 Difference Propagation.- B.2.2 Correlation.- B.3 Bounds for Four Rounds.- B.4 Two Case Studies.- B.4.1 Differential Trails.- B.4.2 Linear Trails.- C. Substitution Tables.- C.1 SRD.- C.2 Other Tables.- C.2.1 xtime.- C.2.2 Round Constants.- D. Test Vectors.- D.1 KeyExpansion.- D.2 Rijndael(128,128).- D.3 Other Block Lengths and Key Lengths.- E. Reference Code.

Editorial Reviews

"…an excellent choice for people who are interested in how Rijndael really works and who need more explanations than research papers usually contain. It is a book that readers will regularly consult when they need to look up details about Rijndael." –Computing Reviews

From the Publisher