Don't forget your roots: constant-time root finding over \(\mathbb{F}_{2^m}\) (Q2284108)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7150702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Don't forget your roots: constant-time root finding over \(\mathbb{F}_{2^m}\) |
scientific article; zbMATH DE number 7150702 |
Statements
Don't forget your roots: constant-time root finding over \(\mathbb{F}_{2^m}\) (English)
0 references
14 January 2020
0 references
side-channel attack
0 references
post-quantum cryptography
0 references
code-based cryptography
0 references
roots finding
0 references
0.8072620630264282
0 references
0.7888118028640747
0 references
0.7770515084266663
0 references
0.7692996263504028
0 references
0.7647878527641296
0 references
