About: XSL attack

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: XSL attack Goto Sponge NotDistinct Permalink

An Entity of Type : yago:YagoPermanentlyLocatedEntity, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FXSL_attack

In cryptography, the eXtended Sparse Linearization (XSL) attack is a method of cryptanalysis for block ciphers. The attack was first published in 2002 by researchers Nicolas Courtois and Josef Pieprzyk. It has caused some controversy as it was claimed to have the potential to break the Advanced Encryption Standard (AES) cipher, also known as Rijndael, faster than an exhaustive search. Since AES is already widely used in commerce and government for the transmission of secret information, finding a technique that can shorten the amount of time it takes to retrieve the secret message without having the key could have wide implications.

Attributes	Values
rdf:type	software yago:WikicatCryptographicAttacks yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Attack100972621 yago:Event100029378 yago:Operation100955060 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity
rdfs:label	Attaque XSL (fr) XSL-атака (ru) XSL attack (en)
rdfs:comment	En cryptographie, l'attaque XSL est une méthode heuristique de cryptanalyse contre les chiffrements par bloc.Elle a été publiée en 2002 par Nicolas Courtois et Josef Pieprzyk. (fr) In cryptography, the eXtended Sparse Linearization (XSL) attack is a method of cryptanalysis for block ciphers. The attack was first published in 2002 by researchers Nicolas Courtois and Josef Pieprzyk. It has caused some controversy as it was claimed to have the potential to break the Advanced Encryption Standard (AES) cipher, also known as Rijndael, faster than an exhaustive search. Since AES is already widely used in commerce and government for the transmission of secret information, finding a technique that can shorten the amount of time it takes to retrieve the secret message without having the key could have wide implications. (en) XSL-атака (англ. eXtended Sparse Linearization, алгебраическая атака) — это метод криптографического анализа, основанный на алгебраических свойствах шифра. Метод предполагает решение особой системы уравнений. Данный метод был предложен в 2001 году Николя Куртуа (Nicolas T. Courtois) и Юзефом Пепшиком (Josef Pieprzyk). XSL-атаки ранее считались невозможными, однако 26 мая 2006 года Куртуа продемонстрировал возможность XSL-атаки против модели одного шифра, сходного по своей структуре с шифром AES. — Нильс Фергюсон, Брюс Шнайер Практическая криптография (ru)
dcterms:subject	Cryptographic attacks
Wikipage page ID	660941 (xsd:integer)
Wikipage revision ID	1084890046 (xsd:integer)
Link from a Wikipage to another Wikipage	Monomial Variable (programming) Vincent Rijmen Cryptography Niels Ferguson Plaintext Sean Murphy (cryptographer) Gaussian elimination NIST NP-hard NSA Cryptanalysis Brute force attack MISTY1 Key (cryptography) Overdetermined system Bruce Schneier Linear cryptanalysis Adi Shamir Advanced Encryption Standard Cryptographic attacks Field (mathematics) Nicolas Courtois Differential cryptanalysis Degree of a monomial Josef Pieprzyk KASUMI KHAZAD Inverse function S-box Alex Biryukov Block cipher Hidden Field Equations Don Coppersmith Polynomial Cipher Ciphertext Cryptographer New Scientist Camellia (cipher) Matt Robshaw Serpent (cipher) Linearly independent Rijndael Chosen plaintext Quadratic polynomial Public key algorithm Simultaneous equation Known plaintext dbr:Linearization_(algebra)
Link from a Wikipage to an external page	http://www.cryptosystem.net/aes/ https://web.archive.org/web/20100305200432/http:/www.usdsi.com/aes.html http://www.schneier.com/crypto-gram-0209.html%231 http://www.schneier.com/crypto-gram-0210.html%232 http://www.schneier.com/crypto-gram-0211.html%237 http://eprint.iacr.org/2002/044/ https://eprint.iacr.org/2002/044 http://www.security-forums.com/forum/viewtopic.php%3Fp=47765 http://citeseerx.ist.psu.edu/viewdoc/summary%3Fdoi=10.1.1.20.4866 http://www.quadibloc.com/crypto/co4514.htm https://www.iacr.org/archive/eurocrypt2000/1807/18070398-new.pdf https://www.schneier.com/crypto-gram/archives/2002/1015.html%238
sameAs	XSL attack XSL attack XSL attack XSL attack XSL attack XSL attack XSL attack XSL attack
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Cite_conference dbt:Cite_journal dbt:Clarify dbt:More_footnotes dbt:Quote dbt:Reflist dbt:Cryptography_navbox
has abstract	En cryptographie, l'attaque XSL est une méthode heuristique de cryptanalyse contre les chiffrements par bloc.Elle a été publiée en 2002 par Nicolas Courtois et Josef Pieprzyk. (fr) In cryptography, the eXtended Sparse Linearization (XSL) attack is a method of cryptanalysis for block ciphers. The attack was first published in 2002 by researchers Nicolas Courtois and Josef Pieprzyk. It has caused some controversy as it was claimed to have the potential to break the Advanced Encryption Standard (AES) cipher, also known as Rijndael, faster than an exhaustive search. Since AES is already widely used in commerce and government for the transmission of secret information, finding a technique that can shorten the amount of time it takes to retrieve the secret message without having the key could have wide implications. The method has a high work-factor, which unless lessened, means the technique does not reduce the effort to break AES in comparison to an exhaustive search. Therefore, it does not affect the real-world security of block ciphers in the near future. Nonetheless, the attack has caused some experts to express greater unease at the algebraic simplicity of the current AES. In overview, the XSL attack relies on first analyzing the internals of a cipher and deriving a system of quadratic simultaneous equations. These systems of equations are typically very large, for example 8,000 equations with 1,600 variables for the 128-bit AES. Several methods for solving such systems are known. In the XSL attack, a specialized algorithm, termed eXtended Sparse Linearization, is then applied to solve these equations and recover the key. The attack is notable for requiring only a handful of known plaintexts to perform; previous methods of cryptanalysis, such as linear and differential cryptanalysis, often require unrealistically large numbers of known or chosen plaintexts. (en) XSL-атака (англ. eXtended Sparse Linearization, алгебраическая атака) — это метод криптографического анализа, основанный на алгебраических свойствах шифра. Метод предполагает решение особой системы уравнений. Данный метод был предложен в 2001 году Николя Куртуа (Nicolas T. Courtois) и Юзефом Пепшиком (Josef Pieprzyk). XSL-атаки ранее считались невозможными, однако 26 мая 2006 года Куртуа продемонстрировал возможность XSL-атаки против модели одного шифра, сходного по своей структуре с шифром AES. Как говорил один из создателей шифра Rijndael в частной переписке: «XSL — это не атака, это всего лишь мечтательный сон». «Этот сон может превратиться в кошмар», — отвечал Николя Куртуа. Если XSL атаки действительно работают, они взломают все существующие на данный момент шифры. Спасти шифр от взлома может лишь чистая случайность. С другой стороны вполне возможно (а с нашей точки зрения и наиболее вероятно), что XSL атаки не применимы на практике или же применимы только к небольшому числу высокоструктурированных шифров — Нильс Фергюсон, Брюс Шнайер Практическая криптография (ru)

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 52 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software