A note on an infeasible linearization of some block ciphers
From MaRDI portal
(Redirected from Publication:5031883)
Abstract: A block cipher can be easily broken if its encryption functions can be seen as linear maps on a small vector space. Even more so, if its round functions can be seen as linear maps on a small vector space. We show that this cannot happen for the AES. More precisely, we prove that if the AES round transformations can be embedded into a linear cipher acting on a vector space, then this space is huge-dimensional and so this embedding is infeasible in practice. We present two elementary proofs.
Recommendations
Cites work
- An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher
- Biclique Cryptanalysis of the Full AES
- Group theoretic properties of Rijndael-like ciphers
- scientific article; zbMATH DE number 1759272 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- On the group generated by the round functions of translation based ciphers over arbitrary finite fields
- The faithful linear representations of least degree of S_n and A_n over a field of characteristic 2.
- The group generated by the round functions of a GOST-like cipher
- The maximum element order in the groups related to the linear groups which is a multiple of the defining characteristic.
- The round functions of KASUMI generate the alternating group
- The Round Functions of RIJNDAEL Generate the Alternating Group
Cited in
(4)
This page was built for publication: A note on an infeasible linearization of some block ciphers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5031883)