How Fast can be Algebraic Attacks on Block Ciphers?

Courtois, Nicolas T.

doi:10.4230/DagSemProc.07021.8

Document

How Fast can be Algebraic Attacks on Block Ciphers?

Author Nicolas T. Courtois

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 7021
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2007-06-06

PDF

File

PDF

DagSemProc.07021.8.pdf

Filesize: 177 kB
6 pages

Document Identifiers

DOI: 10.4230/DagSemProc.07021.8
URN: urn:nbn:de:0030-drops-10130

Subject Classification

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

0

Metadata Views

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.

Cite As Get 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

Author Details

Nicolas T. Courtois

Any Issues?

Feedback on the Current Page

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail