In: Proceedings of the Twenty-Second European Conference on Artificial Intelligence, ECAI 2016, pp. Otpuschennikov, I., Semenov, A., Gribanova, I., Zaikin, O., Kochemazov, S.: Encoding cryptographic functions to SAT using TRANSALG system. Metropolis, N., Ulam, S.: The Monte Carlo method. (eds.) Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, pp. In: Biere, A., Heule, M., Van Maaren, H., Walsh, T. Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. Luke, S.: Essentials of Metaheuristics, 2nd edn. Levin, L.A.: Universal Sequential Search Problems. Kochemazov, S., Zaikin, O., Gribanova, I., Otpuschennikov, I., Semenov, A.: Translation of algorithmic descriptions of discrete functions to SAT with applications to cryptanalysis problems. Kipnis, A., Shamir, A.: Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization. Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: A Python toolkit for prototyping with SAT oracles. In: 2020 43rd International Convention on Information, Communication and Electronic Technology (MIPRO), pp. Gribanova, I., Semenov, A.: Constructing a set of weak values for full-round MD4 hash function. In: Proceedings of XIII Conference Parallel Computational Technologies (PaCT), pp. Gribanova, I., Semenov, A.: Parallel guess-and-determine preimage attack with realistic complexity estimation for MD4-40 cryptographic hash function. In: 2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), pp. Gribanova, I., Semenov, A.: Using automatic generation of relaxation constraints to improve the preimage attack on 39-step MD4. (eds.) Handbook of Satisfiability, Amsterdam (2009) In: Biere, A., Heule, M., van Maaren, H., Walsh, T. Gomes, C.P., Sabharwal, A.: Exploiting runtime variation in complete solvers. 777–784 (2017)įeller, W.: An Introduction to Probability Theory and Its Applications, vol. ĭoerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. ĭobbertin, H.: The first two rounds of MD4 are not one-way. Logic 44(1), 36–50 (1979)ĭe, D., Kumarasubramanian, A., Venkatesan, R.: Inversion attacks on secure hash functions using sat solvers. Association for Computing Machinery, New York, NY, USA (1971)Ĭook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 1971, pp. Ĭook, S.A.: The complexity of theorem-proving procedures. Elsevier Science (1973)Ĭlarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Computer Science and Applied Mathematics : A Series of Monographs and Textbooks. IOS Press, Amsterdam (2009)Ĭhin-Liang, C., Chang, C., Zhang, J., Lee, R., Coaut, C.: Symbolic logic and mechanical theorem proving. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. Morgan Kaufmann Publishers Inc., San Francisco (2009)īiere, A., Heule, M., van Maaren, H., Walsh, T. īessiere, C., Katsirelos, G., Narodytska, N., Walsh, T.: Circuit complexity and decompositions of global constraints. AAAI Press (2008)īard, G.: Algebraic Cryptanalysis. In: Proceedings of the 23rd National Conference on Artificial Intelligence - Volume 1, AAAI2008, pp. Newsgroup Communication (1994)Īnsótegui, C., Bonet, M.L., Levy, J., Manyà, F.: Measuring the hardness of SAT instances. Accessed Īnderson, R.: A5 (was: Hacking digital phones). Irkutsk Supercomputer Center of the SB RAS. KeywordsĮvoguess: Framework for hardness estimating of SAT instances by decomposition set searching. In the experiments, we applied the proposed metrics to construct estimations of guess-and-determine attacks on the compression function of the well-known MD4 cryptographic hash algorithm. The proposed algorithms require a large amount of computational resources, and for their experimental evaluation we used a supercomputer. The corresponding approach combines the Monte Carlo method and metaheuristic black-box optimization algorithms. However, unlike the latter, the new metric can be effectively estimated in application to specific cryptographic functions. The introduced metric is similar to the well-known tree-like metrics used in the theory of propositional proofs. We define a new metric of the hardness of CNF formulas that encode the corresponding cryptanalysis problems. This paper studies the problem of algebraic cryptanalysis where state-of-the-art SAT solvers are used to invert some cryptographic function.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |