Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\) (Q1641147)
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: Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\) |
scientific article; zbMATH DE number 6889951
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\) |
scientific article; zbMATH DE number 6889951 |
Statements
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\) (English)
0 references
15 June 2018
0 references
gate complexity
0 references
linear systems
0 references
dense matrices
0 references
XOR gates
0 references
cryptography
0 references
