This paper focuses on algebraic attacks on the Simon family of block ciphers. We construct equation systems using multiple plaintext/ciphertext pairs, and show that many variables in the cipher states coming from different plaintexts are linearly related. A simple solving algorithm exploiting these relations is developed and extensively tested on the different Simon variants, giving efficient algebraic attacks on up to 16 rounds of the largest Simon variants.
CITATION STYLE
Raddum, H. (2015). Algebraic analysis of the simon block cipher family. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9230, pp. 157–169). Springer Verlag. https://doi.org/10.1007/978-3-319-22174-8_9
Mendeley helps you to discover research relevant for your work.