The Security and Performance of “GCM” when Short Multiplications Are Used Instead (Q4922047)
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: The Security and Performance of “GCM” when Short Multiplications Are Used Instead |
scientific article; zbMATH DE number 6167432
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Security and Performance of “GCM” when Short Multiplications Are Used Instead |
scientific article; zbMATH DE number 6167432 |
Statements
The Security and Performance of “GCM” when Short Multiplications Are Used Instead (English)
0 references
28 May 2013
0 references
GCM
0 references
polynomial hash
0 references
nonce
0 references
authenticated encryption
0 references
0.8750852
0 references
0.83806723
0 references
0 references
0.8334899
0 references
0.82672155
0 references
0.82539076
0 references
0.82415694
0 references
0.82357776
0 references
0.82290876
0 references
0.8228593
0 references
