Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications (Q398976): Difference between revisions
From MaRDI portal
Latest revision as of 22:37, 8 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications |
scientific article |
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
