Pages that link to "Item:Q2942831"
From MaRDI portal
The following pages link to How Much Can Complexity of Linear Cryptanalysis Be Reduced? (Q2942831):
Displaying 4 items.
- Large-scale high-resolution computational validation of novel complexity models in linear cryptanalysis (Q2349643) (← links)
- Improving the Time Complexity of Matsui’s Linear Cryptanalysis (Q5385518) (← links)
- How Far Can We Go Beyond Linear Cryptanalysis? (Q5465830) (← links)
- Optimising linear key recovery attacks with affine Walsh transform pruning (Q6175986) (← links)