License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.07021.8
URN: urn:nbn:de:0030-drops-10130
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2007/1013/
Go to the corresponding Portal

Courtois, Nicolas T.

How Fast can be Algebraic Attacks on Block Ciphers?

pdf-format:
07021.CourtoisNicolas.Paper.1013.pdf (0.2 MB)

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.

BibTeX - Entry

@InProceedings{courtois:DagSemProc.07021.8,
  author =	{Courtois, Nicolas T.},
  title =	{{How Fast can be Algebraic Attacks on Block Ciphers?}},
  booktitle =	{Symmetric Cryptography},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7021},
  editor =	{Eli Biham and Helena Handschuh and Stefan Lucks and Vincent Rijmen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2007/1013},
  URN =		{urn:nbn:de:0030-drops-10130},
  doi =		{10.4230/DagSemProc.07021.8},
  annote =	{Keywords: Algebraic Attacks On Block Ciphers, XSL attacks, AES, DES, SAT Solvers, T' method, Gr\~{A}ƒ\^{A}¶bner bases}
}

Keywords: Algebraic Attacks On Block Ciphers, XSL attacks, AES, DES, SAT Solvers, T' method, Gröbner bases
Collection: 07021 - Symmetric Cryptography
Issue Date: 2007
Date of publication: 06.06.2007

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI