Recovering short secret keys of RLCE in polynomial time (Q2302130)
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: Recovering short secret keys of RLCE in polynomial time |
scientific article; zbMATH DE number 7173861
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recovering short secret keys of RLCE in polynomial time |
scientific article; zbMATH DE number 7173861 |
Statements
Recovering short secret keys of RLCE in polynomial time (English)
0 references
25 February 2020
0 references
code based cryptography
0 references
McEliece scheme
0 references
RLCE
0 references
distinguisher
0 references
key recovery attack
0 references
generalised Reed Solomon codes
0 references
Schur product of codes
0 references
0.85753936
0 references
0.8547808
0 references
0.8528832
0 references
0.8514278
0 references
0.8501588
0 references
0.84783494
0 references
0.84330237
0 references
