How Fast can be Algebraic Attacks on Block Ciphers?

2007/01/01 by Nicolas T. Courtois, Courtois, Nicolas T.
Computer Science · #Polynomial and algebraic computation #Coding theory and cryptography #Cryptographic Implementations and Security

paper · doi:10.4230/dagsemproc.07021.8

Abstract

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.

Related

• Lack of Unique Factorization as a Tool in Block Cipher Cryptanalysis
• A possible intrinsic weakness of AES and other cryptosystems
• Invariant Hopping Attacks on Block Ciphers
• A note on some algebraic trapdoors for block ciphers
• Constructive Non-Linear Polynomial Cryptanalysis of a Historical Block Cipher