Small scale variants of the AES
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Fast exhaustive search for polynomial systems in F2
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
Solving equation systems by agreeing and learning
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
PET SNAKE: a special purpose architecture to implement an algebraic attack in hardware
Transactions on computational science X
Analysis of trivium using compressed right hand side equations
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
Solving compressed right hand side equation systems with linear absorption
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
| Hi-index | 0.00 |
We show how to represent a non-linear equation over GF(2) using linear systems with multiple right hand sides. We argue that this representation is particularly useful for constructing equation systems describing ciphers using an S-box as the only means for non-linearity. Several techniques for solving systems of such equations were proposed in earlier work, and are also explained here. Results from experiments with DES are reported. Finally we use our representation to link a particular problem concerning vector spaces to the security of ciphers with S-boxes as the only non-linear operation.