License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-10130
URL: http://drops.dagstuhl.de/opus/volltexte/2007/1013/

Courtois, Nicolas T.

How Fast can be Algebraic Attacks on Block Ciphers?

pdf-format:
Dokument 1.pdf (178 KB)


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:DSP:2007:1013,
  author =	{Nicolas T. Courtois},
  title =	{How Fast can be Algebraic Attacks on Block Ciphers?},
  booktitle =	{Symmetric Cryptography},
  year =	{2007},
  editor =	{Eli Biham and Helena Handschuh and Stefan Lucks and Vincent Rijmen},
  number =	{07021},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2007/1013},
  annote =	{Keywords: Algebraic Attacks On Block Ciphers, XSL attacks, AES, DES, SAT Solvers, T' method, Gr{\"o}bner bases}
}

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


DROPS-Home | Fulltext Search | Imprint Published by LZI