Two philosophies for solving non-linear equations in algebraic cryptanalysis (Q2412249)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6796550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two philosophies for solving non-linear equations in algebraic cryptanalysis |
scientific article; zbMATH DE number 6796550 |
Statements
Two philosophies for solving non-linear equations in algebraic cryptanalysis (English)
0 references
23 October 2017
0 references
algebraic cryptanalysis
0 references
overdefined systems of equations
0 references
NP-hard problems
0 references
phase transitions
0 references
XL algorithm
0 references
Gröbner bases
0 references
XSL algorithm
0 references
elimlin
0 references
degree falls
0 references
error correcting codes
0 references
algebraic codes
0 references
elliptic curves
0 references
ECDL problem
0 references
Semaev polynomials
0 references
block ciphers
0 references
DES
0 references
GOST
0 references
Simon
0 references
0.8746213316917419
0 references
0.8576278686523438
0 references
0.8456413745880127
0 references
0.8386324048042297
0 references
0.8346701264381409
0 references
