Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm (Q765476): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4940686 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2707607 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Montgomery multiplication in \(\text{GF}(2^ k)\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Intel’s New AES Instructions for Enhanced Performance and Security / rank | |||
Normal rank | |||
Revision as of 23:53, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm |
scientific article |
Statements
Efficient implementation of the Galois counter mode using a carry-less multiplier and a fast reduction algorithm (English)
0 references
19 March 2012
0 references
cryptography
0 references
Galois fields
0 references
message authentication
0 references
authenticated encryption
0 references
AES-GCM
0 references
