Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ (Q5739026)
From MaRDI portal
scientific article; zbMATH DE number 6725240
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ |
scientific article; zbMATH DE number 6725240 |
Statements
Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ (English)
0 references
1 June 2017
0 references
code-based cryptography
0 references
information-set decoding (ISD) algorithm
0 references
linear code
0 references
nearest neighbor
0 references
0 references
0 references
0 references
0 references
0 references
