Methods and Tools for Analysis of Symmetric Cryptographic Primitives
MetadataShow full item record
The development of modern cryptography is associated with the emergence of computing machines. Since specialized equipment for protection of sensitive information was initially implemented only in hardware, stream ciphers were widespread. Later, other areas of symmetric and asymmetric cryptography were established with the invention of general-purpose processors. In particular, such symmetric cryptographic primitives as block ciphers, message authentication codes (MACs), authenticated ciphers and others began to develop rapidly. Today various cryptographic algorithms are commonly used in everyday life to protect private data. Design and analysis of advanced symmetric cryptographic primitives require a lot of time and resources. This is related to many factors, mainly to the cryptanalysis of prospective encryption algorithms under development. Every year new and modified attacks are published, leading to a rapid increase in the quantity of requirements and criteria imposed on cryptoprimitives. Most of this thesis is devoted to analysis and improvement of cryptographic attacks and corresponding criteria for basic components. Almost all modern cryptoprimitives use nonlinear mappings for protection against advanced attacks. In connection with that a new method was proposed for the generation of random substitutions (S-boxes) with extreme cryptographic indicators that can be used in the next-generation ciphers to provide high and ultra-high security levels. In addition, several criteria imposed on S-boxes used in block ciphers were analyzed and their significance for block ciphers was proven. It is worth mentioning a practical method of testing two vectorial Boolean functions and a universal tool for checking properties of arbitrary binary nonlinear components presented in papers gathered in this thesis. Another part of the thesis is dedicated to the cryptanalysis of hash functions as well as block and stream ciphers. To be more precise, an algebraic attack based on a binary decision diagram (BDD) was performed on the reduced Data Encryption Standard (DES), a scaled-down version of Advanced Encryption Standard (AES) and extended affine (EA) equivalence problem. Moreover, an algebraic approach was used to reconstruct an initial representation of the current Russian hash standard GOST 34.11-2012. Finally, a backward states tree method has been used to analyze stream ciphers based on the combination principle of linear and nonlinear feedback registers.
Has partsPaper I: Kazymyrov, O., Raddum, H.: Algebraic attacks using binary decision diagrams. In Pre-proceedings of BalkanCryptSec 2014, pp. 31–44, 2014. Full text not available in BORA.
Paper II: Eilertsen, A. M., Kazymyrov, O., Kazymyrova, V., Storetvedt, M.: A Sage library for analysis of nonlinear binary mappings. In Preproceedings of Central European Conference on Cryptology (CECC14), pp. 69–78, 2014. Full text not available in BORA.
Paper III: Kazymyrov, O., Kazymyrova, V., Oliynykov, R.: A method for generation of high-nonlinear S-boxes based on gradient descent. In Mathematical Aspects of Cryptography, vol. 5, pp. 71–78. Steklov Mathematical Institute, 2014. Full text not available in BORA.
Paper IV: Kazymyrov, O., Kazymyrova, V.: Algebraic aspects of the Russian hash standard GOST R 34.11-2012. In Pre-proceedings of 2nd Workshop on Current Trends in Cryptology (CTCrypt 2013), pp. 160–176, 2013. Full text not available in BORA.
Paper V: Kazymyrov, O., Kazymyrova, V.: Extended criterion for absence of fixed points. In Pre-proceedings of 2nd Workshop on Current Trends in Cryptology (CTCrypt 2013), pp. 177–191, 2013. Full text not available in BORA.
Paper VI: Helleseth, T., Jansen, C.J.A., Kazymyrov, O., Kholosha, A.: State space cryptanalysis of the MICKEY cipher. In Information Theory and Applications Workshop (ITA), pp. 1–10. Institute of Electrical and Electronics Engineers (IEEE), 2013. Full text not available in BORA due to publisher restrictions. The article is available at: http://dx.doi.org/10.1109/ITA.2013.6502941.
Paper VII: Budaghyan, L., Kazymyrov, O.: Verification of restricted EA-equivalence for vectorial Boolean functions. In Özbudak, F., Rodríguez-Henríquez, F. (eds.), Arithmetic of Finite Fields, vol. 7369 of Lecture Notes in Computer Science, pp. 108–118. Springer Berlin Heidelberg, 2012. Full text not available in BORA due to publisher restrictions. The article is available at: http://dx.doi.org/10.1007/978-3-642-31662-3_8.