The design of Rijndael. The Advanced Encryption Standard (AES)
DOI10.1007/978-3-662-60769-5zbMATH Open1437.94001OpenAlexW3027260415MaRDI QIDQ778891FDOQ778891
Authors: Joan Daemen, Vincent Rijmen
Publication date: 20 July 2020
Published in: Information Security and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-60769-5
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Cited In (35)
- Heuristic search of (semi-)bent functions based on cellular automata
- Federated learning in side-channel analysis
- Title not available (Why is that?)
- Weak subtweakeys in SKINNY
- TNT: how to tweak a block cipher
- The block cipher companion.
- RAMus- a new lightweight block cipher for RAM encryption
- Thinking outside the superbox
- The design of the ICE encryption algorithm
- Implementing Grover oracles for quantum key search on AES and LowMC
- A low-complexity key-recovery attack on 6-round Midori64
- Improved quantum circuits for AES: reducing the depth and the number of qubits
- Quantum speed-up for multidimensional (zero correlation) linear distinguishers
- On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata
- Algebraic aspects of the advanced encryption standard.
- Universal hashing based on field multiplication and (near-)MDS matrices
- A modular approach to the security analysis of two-permutation constructions
- Title not available (Why is that?)
- Multimixer-156: universal keyed hashing based on integer multiplication and cyclic shift
- The patching landscape of Elisabeth-4 and the mixed filter permutator paradigm
- Improved heuristics for low-latency implementations of linear layers
- Batching base oblivious transfers
- \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
- Exploiting non-full key additions: full-fledged automatic Demirci-Selçuk meet-in-the-middle cryptanalysis of SKINNY
- Insights gained after a decade of cellular automata-based cryptography
- Propagation properties of a non-linear mapping based on squaring in odd characteristic
- Improved key-recovery attacks on reduced-round WEM-8
- Structural evaluation of AES-like ciphers against mixture differential cryptanalysis
- \texttt{HAWKEYE} -- recovering symmetric cryptography from hardware circuits
- On properties of translation groups in the affine general linear group with applications to cryptography
- Mystrium: wide block encryption efficient on entry-level processors
- Constructing and deconstructing intentional weaknesses in symmetric ciphers
- Maximal complete permutations over \(\mathbb{F}_2^n \)
- A lower bound for differential uniformity by multiplicative complexity \& bijective functions of multiplicative complexity 1 over finite fields
- An algebraic approach to symmetric linear layers in cryptographic primitives
Uses Software
This page was built for publication: The design of Rijndael. The Advanced Encryption Standard (AES)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778891)