Connecting the complexity of MQ- and code-based cryptosystems (Q4606490)
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: Connecting the complexity of MQ- and code-based cryptosystems |
scientific article; zbMATH DE number 6848028
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connecting the complexity of MQ- and code-based cryptosystems |
scientific article; zbMATH DE number 6848028 |
Statements
Connecting the Complexity of MQ- and Code-Based Cryptosystems (English)
0 references
7 March 2018
0 references
decoding problem
0 references
MQ problem
0 references
Multiple-Right-Hand-Sides (MRHS) equation
0 references
0.7808204889297485
0 references
0.7757567763328552
0 references
0.7607677578926086
0 references
0.7463982701301575
0 references
0.7325657606124878
0 references
