IACR Transactions on Symmetric Cryptology · 2018 · 19 citations · 16 references
ComputingComputer EngineeringComputer ScienceComputer SecurityCryptographyLow-power DesignBlock CiphersCryptographic AlgorithmsCryptographic ArchitectureLow-power Digital Circuit DesignSecure System DesignSide-channel AttacksBlock Cipher DesignLightweight Block CiphersLightweight CryptographyS-box DesignSide-channel Resilient DesignSide-channel ResistanceSide-channel Resistant DesignSubstitution-permutation Networks
This work focuses on side-channel resilient design strategies for symmetrickey cryptographic primitives targeting lightweight applications. In light of NIST’s lightweight cryptography project, design choices for block ciphers must consider not only security against traditional cryptanalysis, but also side-channel security, while adhering to low area and power requirements. In this paper, we explore design strategies for substitution-permutation network (SPN)-based block ciphers that make them amenable to low-cost threshold implementations (TI) - a provably secure strategy against side-channel attacks. The core building blocks for our strategy are cryptographically optimal 4×4 S-Boxes, implemented via repeated iterations of simple cellular automata (CA) rules. We present highly optimized TI circuits for such S-Boxes, that consume nearly 40% less area and power as compared to popular lightweight S-Boxes such as PRESENT and GIFT. We validate our claims via implementation results on ASIC using 180nm technology. We also present a comparison of TI circuits for two popular lightweight linear diffusion layer choices - bit permutations and MixColumns using almost-maximum-distance-separable (almost-MDS) matrices. We finally illustrate design paradigms that combine the aforementioned TI circuits for S-Boxes and diffusion layers to obtain fully side-channel secure SPN block cipher implementations with low area and power requirements.
16
Statistical mechanics of cellular automata
Stephen Wolfram · Reviews of Modern Physics · 1983 · 3.1K citations
Differential cryptanalysis of DES-like cryptosystems
Eli Biham, Adi Shamir · Journal of Cryptology · 1991 · 2.9K citations
Universality and complexity in cellular automata
Stephen Wolfram · Physica D Nonlinear Phenomena · 1984 · 1.9K citations
Computing, Mathematics, Algorithms +11
Cellular automata as models of complexity
Stephen Wolfram · Nature · 1984 · 1.5K citations
Leakage-Resilient Cryptography
Stefan Dziembowski, Krzysztof Pietrzak · 2008 · 512 citations · Full text