Hardness estimates of the code equivalence problem in the rank metric (Q6130620)
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: Hardness estimates of the code equivalence problem in the rank metric |
scientific article; zbMATH DE number 7827079
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness estimates of the code equivalence problem in the rank metric |
scientific article; zbMATH DE number 7827079 |
Statements
Hardness estimates of the code equivalence problem in the rank metric (English)
0 references
3 April 2024
0 references
code equivalence
0 references
post-quantum cryptography
0 references
rank-based
0 references
0 references
0 references
0 references
0 references
0.8043978810310364
0 references
0.7793199419975281
0 references
0.7749447822570801
0 references
0.7687798738479614
0 references
0.7354615926742554
0 references
