A 10-bit S-box generated by Feistel construction from cellular automata
Preprint
Abstract
We propose a new 10-bit S-box generated from a Feistel construction. The subpermutations are generated by a 5-cell cellular automaton based on a unique well-chosen rule and bijective affine transformations. In particular, the cellular automaton rule is chosen based on empirical tests of its ability to generate good pseudorandom output on a ring cellular automaton. Similarly, Feistel's network layout is based on empirical data regarding the quality of the output S-box. We perform cryptanalysis of the generated 10-bit S-box, and we find security properties comparable to or sometimes even better than those of the standard AES S-box. We believe that our S-box could be used to replace the 5-bit substitution of ciphers like ASCON.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- A Novel Scheme for Designing Secure Substitution Boxes (S-Boxes) Based on Mobius Group and Finite FieldWireless Personal Communications, 2022
- Ascon v1.2: Lightweight Authenticated Encryption and HashingJournal of Cryptology, 2021
- Construction of Lightweight S-Boxes Using Feistel and MISTY Structures2016
- Constructing S-boxes for Lightweight Cryptography with Feistel Structure2014
- Luby-Rackoff: 7 Rounds Are Enough for 2 n(1 − ε) Security2003
- Attacks on Block Ciphers of Low Algebraic DegreeJournal of Cryptology, 2001
- The Boomerang Attack1999
- Differential Cryptanalysis of the Data Encryption Standard1993
- A spectral characterization of correlation-immune combining functionsIEEE Transactions on Information Theory, 1988
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, 1988