Discrete optimisation and fast correlation attacks
From MaRDI portal
Recommendations
- Fast correlation attacks and multiple linear approximations
- Fast correlation attacks: an algorithmic point of view
- Fast Correlation Attacks: Methods and Countermeasures
- Searching for the optimum correlation attack
- Vectorial approach to fast correlation attacks
- A low-complexity and high-performance algorithm for the fast correlation attack
- An analysis and an improvement of iterative fast correlation attacks
- A comparison of fast correlation attacks
- Fast correlation attacks through reconstruction of linear polynomials
- Correlation (Fast) Attack against Nonlinear Combination Generator
Cites work
- A comparison of cryptoanalytic principles based on iterative error- correction
- A fast iterative algorithm for a shift register initial state reconstruction given the noisy output sequence
- AUTOMATED CRYPTANALYSIS OF SUBSTITUTION CIPHERS
- Fast correlation attacks on certain stream ciphers
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 503332 (Why is no real title available?)
- scientific article; zbMATH DE number 503333 (Why is no real title available?)
- scientific article; zbMATH DE number 3314865 (Why is no real title available?)
- scientific article; zbMATH DE number 4187707 (Why is no real title available?)
- On a fast correlation attack on certain stream ciphers
- On the security of shift register based keystream generators
- On two probabilistic decoding algorithms for binary linear codes
- Optimization by simulated annealing
Cited in
(3)
This page was built for publication: Discrete optimisation and fast correlation attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5235422)