Randomness Complexity of Private Circuits for Multiplication (Q5739217)
From MaRDI portal
scientific article; zbMATH DE number 6603686
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Randomness Complexity of Private Circuits for Multiplication |
scientific article; zbMATH DE number 6603686 |
Statements
Randomness Complexity of Private Circuits for Multiplication (English)
0 references
15 July 2016
0 references
side-channel analysis
0 references
probing model
0 references
randomness complexity
0 references
constructions
0 references
lower bounds
0 references
probabilistic method
0 references
information set decoding
0 references
algorithmic tool
0 references
