How Fast can be Algebraic Attacks on Block Ciphers?

Author Nicolas T. Courtois



PDF
Thumbnail PDF

File

DagSemProc.07021.8.pdf
  • Filesize: 177 kB
  • 6 pages

Document Identifiers

Author Details

Nicolas T. Courtois

Cite AsGet BibTex

Nicolas T. Courtois. How Fast can be Algebraic Attacks on Block Ciphers?. In Symmetric Cryptography. Dagstuhl Seminar Proceedings, Volume 7021, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
https://doi.org/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.
Keywords
  • Algebraic Attacks On Block Ciphers
  • XSL attacks
  • AES
  • DES
  • SAT Solvers
  • T' method
  • Gröbner bases

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads