Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
From MaRDI portal
Recommendations
Cites work
- A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma
- DES has no per round linear factors
- Fast Software Encryption
- scientific article; zbMATH DE number 1612515 (Why is no real title available?)
- scientific article; zbMATH DE number 3952651 (Why is no real title available?)
- scientific article; zbMATH DE number 4079313 (Why is no real title available?)
- scientific article; zbMATH DE number 1189380 (Why is no real title available?)
- scientific article; zbMATH DE number 1303144 (Why is no real title available?)
- scientific article; zbMATH DE number 697799 (Why is no real title available?)
- scientific article; zbMATH DE number 1088930 (Why is no real title available?)
- scientific article; zbMATH DE number 1759278 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- scientific article; zbMATH DE number 1406761 (Why is no real title available?)
- scientific article; zbMATH DE number 1406764 (Why is no real title available?)
- Non-linear approximations in linear cryptanalysis
- Optimization by simulated annealing
Cited in
(2)
This page was built for publication: Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5447511)