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 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-93387-0_25 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2806618168 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:17, 20 March 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
