Protecting against multidimensional linear and truncated differential cryptanalysis by decorrelation
From MaRDI portal
Recommendations
Cited in
(7)- Multiple (truncated) differential cryptanalysis: explicit upper bounds on data complexity
- Non-asymptotic lower bounds for the data complexity of statistical attacks on symmetric cryptosystems
- Decorrelation: a theory for block cipher security
- Feistel ciphers with L₂-decorrelation
- Revisiting iterated attacks in the context of decorrelation theory
- On the decorrelated fast cipher (DFC) and its theory
- Almost pairwise independence and resilience to deep learning attacks
This page was built for publication: Protecting against multidimensional linear and truncated differential cryptanalysis by decorrelation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946935)