skip to main content
10.1145/3321707.3321847acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

Fitness comparison by statistical testing in construction of SAT-based guess-and-determine cryptographic attacks

Published: 13 July 2019 Publication History

Abstract

Algebraic cryptanalysis studies breaking ciphers by solving algebraic equations. Some of the promising approaches use SAT solvers for this purpose. Although the corresponding satisfiability problems are hard, their difficulty can often be lowered by choosing a set of variables to brute force over, and by solving each of the corresponding reduced problems using a SAT solver, which is called the guess-and-determine attack. In many successful cipher breaking attempts this set was chosen analytically, however, the nature of the problem makes evolutionary computation a good choice.
We investigate one particular method for constructing guess-and-determine attacks based on evolutionary algorithms. This method estimates the fitness of a particular guessed bit set by Monte-Carlo simulations. We show that using statistical tests within the comparator of fitness values, which can be used to reduce the necessary number of samples, together with a dynamic strategy for the upper limit on the number of samples, speeds up the attack by a factor of 1.5 to 4.3 even on a distributed cluster.

References

[1]
Ross Anderson. 1994. A5 (was: Hacking digital phones). http://yarchive.net/phone/gsmcipher.html
[2]
Gregory V. Bard. 2009. Algebraic Cryptanalysis. Springer.
[3]
George Alfred Barnard. 1945. A New Test for 2 × 2 Tables. Nature 156 (1945), 177.
[4]
Armin Biere. 2016. Splatz, Lingeling, Plingeling, Treengeling, YalSAT Entering the SAT Competition 2016. In Proceedings of SAT Competition 2016, Vol. B-2016-1. 44--45.
[5]
Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh (Eds.). 2009. Handbook of Satisfiability. Number 185 in Frontiers in Artificial Intelligence and Applications. IOS Press.
[6]
Antonio Castro Lechtaler, Marcelo Cipriano, Edith García, Julio Liporace, Ariel Maiorano, and Eduardo Malvacio. 2014. Model Design for a Reduced Variant of a Trivium Type Stream Cipher. Journal of Computer Science & Technology 14, 01 (2014), 55--58.
[7]
Andrew John Clark. 1998. Optimisation Heuristics for Cryptology. Ph.D. Dissertation. Queensland University of Technology.
[8]
Nicolas T. Courtois and Gregory V. Bard. 2007. Algebraic Cryptanalysis of the Data Encryption Standard. In Cryptography and Coding. Number 4887 in Lecture Notes in Computer Science. 152--169.
[9]
Nicolas T. Courtois, Jerzy A. Gawinecki, and Guangyan Song. 2012. Contradiction Immunity and Guess-then-Determine Attacks on GOST. Tatra Mountains Mathematical Publications 53 (2012), 65--79.
[10]
Christophe De Cannière. 2006. Trivium: A Stream Cipher Construction Inspired by Block Cipher Design Principles. In Information Security. Number 4176 in Lecture Notes in Computer Science. 171--186.
[11]
Niklas Eén and Niklas Sörensson. 2003. An Extensible SAT-solver. In SAT 2003: Theory and Applications of Satisfiability Testing. Number 2919 in Lecture Notes in Computer Science. 502--518.
[12]
T. Eibach, E. Pilz, and G. Völkel. 2008. Attacking Bivium Using SAT Solvers. In SAT 2008. Number 4996 in Lecture Notes in Computer Science. 63--76.
[13]
Benjamin Ferriman. 2013. Cryptanalysis of the RC4 Stream Cipher using Evolutionary Computation Methods. Ph.D. Dissertation. University of Guelph. http://hdl.handle.net/10214/7770
[14]
Ronald A. Fisher. 1922. On the interpretation of χ2 from contingency tables, and the calculation of P. Journal of the Royal Statistical Society 85, 1 (1922), 87--94.
[15]
David Gerault, Marine Minier, and Christine Solnon. 2017. Using Constraint Programming to Solve a Cryptanalytic Problem. In Proceedings of International Joint Conference on Artificial Intelligence. 4844--4848.
[16]
F. Glover. 1998. Tabu search methods for optimization. Feature Issue of European Journal on Operations Research 106, 2 (1998), 110--115.
[17]
M. Hell, T. Johansson, and W. Meier. 2007. Grain: a stream cipher for constrained environments. International Journal of Wireless and Mobile Computing 2, 1 (2007), 86--93.
[18]
Zhenyu Huang and Dongdai Lin. 2011. Attacking Bivium and Trivium with the Characteristic Set Method. In AFRICACRYPT. Number 6737 in Lecture Notes in Computer Science. 77--91.
[19]
Zhenyu Huang, Yao Sun, and Dongdai Lin. 2016. On the Efficiency of Solving Boolean Polynomial Systems with the Characteristic Set Method. https://arxiv.org/abs/1405.4596v3
[20]
Predrag Janicic. 2012. URSA: A System for Uniform Reduction to SAT. Logical Methods in Computer Science 8, 3 (2012), 1--39.
[21]
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. 1983. Optimization by Simulated Annealing. Science 220, 4598 (1983), 671--680.
[22]
Karlo Knežević. 2017. Combinatorial Optimization in Cryptography. In Proceedings of 40th International Convention on Information and Communication Technology, Electronics and Microelectronics. 1324--1330.
[23]
Walter O. Krawiec and Sam A. Markelon. 2018. Genetic Algorithm to Study Practical Quantum Adversaries. In Proceedings of Genetic and Evolutionary Computation Conference. 1270--1277.
[24]
W. Kruskal and W. Wallis. 1952. Use of ranks in one-criterion variance analysis. J. Amer. Statist. Assoc. 47 (1952), 583--621.
[25]
Henry B. Mann and Donald R Whitney. 1947. On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other. Annals of Mathematical Statistics 18, 1 (1947), 50--60.
[26]
Alexander Maximov and Alex Biryukov. 2007. Two Trivial Attacks on Trivium. In Selected Areas in Cryptography (Lecture Notes in Computer Science). 36--55.
[27]
Cameron McDonald, Josef Pieprzyk, and Phil Hawkes. 2009. Automatic Differential Path Searching for SHA-1. http://eurocrypt2009rump.cr.yp.to/837a0a8086fa6ca714249409ddfae43d.pdf
[28]
N. Nedjah and L. de Macedo Mourelle. 2004. Multi-Objective Evolutionary Hardware for RSA-Based Cryptosystems. In Proceedings of International Conference on Information Technology: Coding and Computing, Vol. 2. 503--507.
[29]
K. Nohl. 2010. Attacking Phone Privacy. https://media.blackhat.com/bh-us-10/whitepapers/Nohl/BlackHat-USA-2010-Nohl-Attacking.Phone.Privacy-wp.pdf
[30]
Ilya Otpuschennikov, Alexander Semenov, Irina Gribanova, Oleg Zaikin, and Stepan Kochemazov. 2016. Encoding Cryptographic Functions to SAT Using TRANSALG System. In ECAI 2016. Number 285 in Frontiers in Artificial Intelligence and Applications. 1594--1595.
[31]
Stjepan Picek and Marin Golub. 2011. On Evolutionary Computation Methods in Cryptography. In Proceedings of 34th International Convention on Information and Communication Technology, Electronics and Microelectronics. 1496--1501.
[32]
Iwona Polak and Mariusz Boryczka. 2015. Genetic Algorithm in Stream Cipher Cryptanalysis. In Computational Collective Intelligence: Proceedings of ICCCI 2015, Part II. Number 9330 in Lecture Notes in Computer Science. 149--158.
[33]
R Core Team. 2013. R: A Language and Environment for Statistical Computing. http://www.R-project.org/. http://www.R-project.org/
[34]
Havard Raddum. 2006. Cryptanalytic Results on Trivium. eSTREAM, ECRYPT Stream Cipher Project, Report 2006/039.
[35]
Ronald L. Rivest, A. Shamir, and L. Adleman. 1978. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Commun. ACM 21, 2 (1978), 120--126.
[36]
Klaus Schmeh. 2003. Cryptography and public key infrastructure on the Internet. John Wiley & Sons.
[37]
Alexander Semenov and Oleg Zaikin. 2016. Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions. SpringerPlus 5:554 (2016).
[38]
Alexander Semenov, Oleg Zaikin, Ilya Otpuschennikov, Stepan Kochemazov, and Alexey Ignatiev. 2018. On Cryptographic Attacks Using Backdoors for SAT. In Proceedings of the AAAI Conference. 6641--6648.
[39]
Mate Soos, Karsten Nohl, and Claude Castelluccia. 2009. Extending SAT Solvers to Cryptographic Problems. In Theory and Applications of Satisfiability Testing --- SAT 2009 (Lecture Notes in Computer Science). 244--257.
[40]
Sui-Guan Teo, Kenneth Koon-Ho Wong, Harry Bartlett, Leonie Simpson, and Ed Dawson. 2014. Algebraic analysis of Trivium-like ciphers. In Proceedings of Australasian Information Security Conference, Vol. 149. Australian Computer Society, 77--81.
[41]
A. Tragha, F. Omary, and A. Mouloudi. 2006. ICIGA: Improved Cryptography Inspired by Genetic Algorithms. In Proceedings of International Conference on Hybrid Information Technology. 335--341.
[42]
Frank Wilcoxon. 1945. Individual comparisons by ranking methods. Biometrics Bulletin 1, 6 (1945), 80--83.
[43]
Ryan Williams, Carla P. Gomes, and Bart Selman. 2003. Backdoors to Typical Case Complexity. In Proceedings of International Joint Conference on Artificial Intelligence. 1173--1178.
[44]
Takeru Yasumoto and Takumi Okuwaga. 2014. ROKK 1.0.1. In SAT Competition 2014, Anton Belov, Daniel Diepold, Marijn Heule, and Matti Järvisalo (Eds.). 70.

Cited By

View all
  • (2023)A Comprehensive Review of Cyber Security Vulnerabilities, Threats, Attacks, and SolutionsElectronics10.3390/electronics1206133312:6(1333)Online publication date: 11-Mar-2023
  • (2023)A Review of Cyber Security in Cryptography: Services, Attacks, and Key Approach2023 Third International Conference on Artificial Intelligence and Smart Energy (ICAIS)10.1109/ICAIS56108.2023.10073747(1300-1306)Online publication date: 2-Feb-2023
  • (2022)Straightforward Guess and Determine Analysis Based on Genetic AlgorithmJournal of Systems Science and Complexity10.1007/s11424-022-1031-x35:5(1988-2003)Online publication date: 20-Jun-2022
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference
July 2019
1545 pages
ISBN:9781450361118
DOI:10.1145/3321707
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 July 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. algebraic cryptanalysis
  2. approximate fitness evaluation
  3. satisfiability problems

Qualifiers

  • Research-article

Funding Sources

Conference

GECCO '19
Sponsor:
GECCO '19: Genetic and Evolutionary Computation Conference
July 13 - 17, 2019
Prague, Czech Republic

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)12
  • Downloads (Last 6 weeks)1
Reflects downloads up to 23 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)A Comprehensive Review of Cyber Security Vulnerabilities, Threats, Attacks, and SolutionsElectronics10.3390/electronics1206133312:6(1333)Online publication date: 11-Mar-2023
  • (2023)A Review of Cyber Security in Cryptography: Services, Attacks, and Key Approach2023 Third International Conference on Artificial Intelligence and Smart Energy (ICAIS)10.1109/ICAIS56108.2023.10073747(1300-1306)Online publication date: 2-Feb-2023
  • (2022)Straightforward Guess and Determine Analysis Based on Genetic AlgorithmJournal of Systems Science and Complexity10.1007/s11424-022-1031-x35:5(1988-2003)Online publication date: 20-Jun-2022
  • (2020)Improving Effectiveness of Neighborhood-Based Algorithms for Optimization of Costly Pseudo-Boolean Black-Box FunctionsMathematical Optimization Theory and Operations Research10.1007/978-3-030-49988-4_26(373-388)Online publication date: 29-Jun-2020
  • (2019)On black-box optimization in divide-and-conquer SAT solvingOptimization Methods and Software10.1080/10556788.2019.168599336:4(672-696)Online publication date: 11-Nov-2019
  • (2019)SAT-Based Cryptanalysis: From Parallel Computing to Volunteer ComputingSupercomputing10.1007/978-3-030-36592-9_57(701-712)Online publication date: 10-Dec-2019

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media