scientific article; zbMATH DE number 1279023
In the paper use of combinatorial optimisation algorithms in the area of automated cryptanalysis is studied. Namely, simulated annealing and genetic algorithm approach are investigated together with a new attack that utilizes the tabu search. While some attacks on the simple substitution cipher using simulated annealing or a genetic algorithm were known previously, no comparison of the techniques were made. In the paper first each of these optimisation heuristics is described together with brief explanation of the tabu search technique. Then, attacks on the simple substitution cipher based on character frequency (\(n\)-gram) statistics are considered. For each of the techniques mentioned above a corresponding algorithm is described and the choice of suitable parameters is discussed. Then a number of experimental results is presented and used to compare performance of the three optimisation heuristics.
- Heuristic tool for linear cryptanalysis with applications to CAESAR candidates
- AUTOMATED CRYPTANALYSIS OF SUBSTITUTION CIPHERS
- Automated cryptanalysis of substitution cipher using Hill climbing with well designed heuristic function
- Global optimization problems associated with cryptographic analysis of asymmetric ciphers
- Evolutionary computation in cryptanalysis of classical ciphers
- Extending the applicability of the mixed-integer programming technique in automatic differential cryptanalysis
- An automatic cryptanalysis of transposition ciphers using compression
- Attacks of simple block ciphers via efficient heuristics
- Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC
- An automatic cryptanalysis of transposition ciphers using compression
- A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography
- Robust Dictionary Attack of Short Simple Substitution Ciphers
- Improved Markov chain Monte Carlo method for cryptanalysis substitution-transposition cipher
- scientific article; zbMATH DE number 2013456 (Why is no real title available?)
- Why letter substitution puzzles are not hard to solve: a case study in entropy and probabilistic search-complexity
- Evolutionary computation in cryptanalysis of classical ciphers
- A FAST METHOD FOR CRYPTANALYSIS OF SUBSTITUTION CIPHERS
- Automated cryptanalysis of substitution cipher using Hill climbing with well designed heuristic function
- Cryptanalysis of the columnar transposition using meta-heuristics
- Decrypting classical cipher text using Markov chain Monte Carlo
- Attacks of simple block ciphers via efficient heuristics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4239576)
