Can CAESAR beat Galois? Robustness of CAESAR candidates against nonce reusing and high data complexity attacks (Q1656066)
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: Can CAESAR beat Galois? Robustness of CAESAR candidates against nonce reusing and high data complexity attacks |
scientific article; zbMATH DE number 6915904
| 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; zbMATH DE number 6915904 |
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
