Can CAESAR beat Galois? Robustness of CAESAR candidates against nonce reusing and high data complexity attacks (Q1656066): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:28, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Can CAESAR beat Galois? Robustness of CAESAR candidates against nonce reusing and high data complexity attacks |
scientific article |
Statements
Can CAESAR beat Galois? Robustness of CAESAR candidates against nonce reusing and high data complexity attacks (English)
0 references
10 August 2018
0 references
authenticated encryption
0 references
CAESAR competition
0 references
forgery
0 references
decryption attack
0 references
key recovery
0 references
birthday bound
0 references
nonce misuse
0 references
