How Fast can be Algebraic Attacks on Block Ciphers?
Nicolas T. Courtois · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2007
In my talk I did overwiev the area of algebraic attacks on block ciphers, explain what fast algebraic attacks on block cipher are, and what results can already be achieved. This covers a vast amount of work (several papers, most of them not published) that I cannot include here in totality due to the lack of space.