In this work we investigate how the choice of the key expansion algorithm and its interaction with the round function affect the resistance of Simon-like ciphers against RX-cryptanalysis. We observe that among the key expansion algorithms we consider, Simon's is most resistant, while Simeck's is much less so. Implications on lightweight ciphers' design are discussed and open questions are proposed.
|Journal||The Computer Journal|
|Publication status||Accepted/In press - 26 Apr 2021|
- Key Schedule
- Key Expansion Algorithm