Pages that link to "Item:Q2430686"
From MaRDI portal
The following pages link to Accurate estimates of the data complexity and success probability for various cryptanalyses (Q2430686):
Displaying 13 items.
- Another look at normal approximations in cryptanalysis (Q293721) (← links)
- Improved improbable differential attacks on ISO standard CLEFIA: expansion technique revisited (Q894458) (← links)
- Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity (Q1667453) (← links)
- Rigorous upper bounds on data complexities of block cipher cryptanalysis (Q1676236) (← links)
- Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems (Q1745698) (← links)
- On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers (Q1752540) (← links)
- A correlation attack on full SNOW-V and SNOW-Vi (Q2170078) (← links)
- Revisiting the wrong-key-randomization hypothesis (Q2175215) (← links)
- Reflection cryptanalysis of PRINCE-like ciphers (Q2516533) (← links)
- On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui’s Algorithm 2 (Q2946869) (← links)
- Reflection Cryptanalysis of PRINCE-Like Ciphers (Q2946872) (← links)
- Multiple Differential Cryptanalysis: Theory and Practice (Q3013076) (← links)
- DISTINGUISHING ATTACKS ON BLOCK CIPHERS BY DIFFERENTIALS OF TWO-BLOCK TEXTS (Q5151445) (← links)
