Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications (Q398976)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improved algorithms for finding low-weight polynomial multiples in F₂[x] and some cryptographic applications |
scientific article; zbMATH DE number 6331241
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications |
scientific article; zbMATH DE number 6331241 |
Statements
Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications (English)
0 references
18 August 2014
0 references
low-weight polynomial multiple
0 references
low-weight codeword
0 references
information-set decoding
0 references
public-key cryptography
0 references
\(\mathrm{TCH}_{\mathrm O}\)
0 references
correlation attacks
0 references
0 references
0.8633289337158203
0 references
0.8330201506614685
0 references
0.8327422738075256
0 references
0.8158814907073975
0 references
0.8140217661857605
0 references
