Pages that link to "Item:Q1676236"
From MaRDI portal
The following pages link to Rigorous upper bounds on data complexities of block cipher cryptanalysis (Q1676236):
Displaying 5 items.
- Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity (Q1667453) (← links)
- Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems (Q1745698) (← links)
- Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses (Q1749795) (← links)
- On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers (Q1752540) (← links)
- Towards closing the security gap of Tweak-aNd-Tweak (TNT) (Q2692356) (← links)
