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 11 items.
- Another look at normal approximations in cryptanalysis (Q293721) (← links)
- 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)
- Accurate estimates of the data complexity and success probability for various cryptanalyses (Q2430686) (← links)
- Upper estimates of imbalance of bilinear approximations for round functions of block ciphers (Q2452820) (← links)
- Lower bounds on the degree of block ciphers (Q2692355) (← links)
- Towards closing the security gap of Tweak-aNd-Tweak (TNT) (Q2692356) (← links)
- How much data may be safely processed on one key in different modes? (Q3383073) (← links)
- Improved truncated differential distinguishers of AES with concrete S-box (Q6169479) (← links)
