Details:
Title | Block ciphers sensitive to Grobner Basis Attacks | Author(s) | Johannes Buchmann, Andrei Pychkine, Ralf-Philipp Weinmann | Type | Technical Report, Misc | Abstract | We construct and analyze Feistel and SPN ciphers that have a sound
design strategy against linear and differential attacks but for which the encryption process can be described by very simple polynomial equations. For a block and key size of 128 bits, we present ciphers for which practical Grobner basis attacks can recover the full cipher key requiring only a minimal number of plaintext/ciphertext pairs. We show how Grobner bases for a subset of these ciphers can be constructed with neglegible computational effort. This reduces the key-recovery problem to a Grobner basis conversion problem. By bounding the running time of a Grobner basis conversion algorithm, FGLM, we demonstrate the existence of block ciphers resistant against differential and linear cryptanalysis but vulnerable against Grobner basis attacks. | Keywords | secret-key cryptography, cryptanalysis, block ciphers,
algebraic attacks, Grobner bases | Length | 17 |
File |
| Language | English | Year | 2005 | Translation |
No | Refereed |
No | Organization |
TU Darmstadt |
|