A note on an infeasible linearization of some block ciphers
Group Theory
2019-04-26 v3
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.
Keywords
Cite
@article{arxiv.1511.02360,
title = {A note on an infeasible linearization of some block ciphers},
author = {Riccardo Aragona and Anna Rimoldi and Massimiliano Sala},
journal= {arXiv preprint arXiv:1511.02360},
year = {2019}
}
Comments
to appear in Journal of Discrete Mathematical Sciences and Cryptography. arXiv admin note: substantial text overlap with arXiv:1006.5894