Receipt date: 
Bibliographic description of the article: 

Surchovetcky G.N. Cryptic resistance of encryption algorithms [Cryptographic strength of encryption algorithms]. Molodaya nauka Sibiri: ehlektronnyj nauchnyj zhurnal [Young science of Siberia: electronic scientific journal], 2018, no. 2. [Accessed 17/12/18]

Journal number: 
Article File: 

The paper gives an overview of methods for assessing the strength of cryptographic algorithms, ciphers, codes. The concept of cryptographic stability is given. Various units of its measurement, factors and methods of evaluation are discussed. The units of resistance measurement can be the time required to crack a key, including the development of an appropriate computational model; the amount of memory required to crack the key; the cost of hacking the key; the amount of energy required to crack the key; the time complexity of the best known algorithms that violate security; the physical volume of the computational model to crack the key.

Discuss the notions of computational durability, information and the theoretical resistance, provable resistance. Classical results of K. Shannon and examples of persistent and unstable algorithms are given. Approaches to the evaluation of cryptographic methods and algorithms stability are considered.

It is noted that the need to complicate encryption algorithms increases the complexity of calculations, which leads to a decrease in their practical usefulness. The conclusion is made about the relevance of non-cryptographic methods of information protection: steganography, etc.

List of references: 
  1. Gatchenko N.A., Isaev A.S., Yakovlev A.D. Cryptographic protection of information. SPb: NIU ITMO, 2012. 142 p.
  2. Grusho A.A., Applied E.A., Timonina E.E. Analysis and synthesis of cryptographic algorithms. Course of Lectures, Yoshkar-Ola: Publishing house of the Mari branch of Moscow Open Social University, 2000. 110 p.
  3. Zubov A.Yu. Perfect Ciphers. M.: Helios ARV, 2003. 160 p.
  4. Cryptographic firmness. – %BF%D1%82%D0%BE%D0%B3%D1%80%D0%B0%D1%84%D0%B8%D1%87%D0%B5%D1%81%D0%BA%D0%B0%D1%8F_%D1%81%D1%82%D0%BE%D0%B9%D0%BA%D0%BE%D1%81%D1%82%D1%8C [Accessed 18/10/2018]
  5. Logachev OA, Salnikov A.A., Yashchenko V.V. Boolean functions in coding theory and cryptology. Moscow: Moscow Center for Continuous Mathematical Education, 2004. 470 p.
  6. Mao V. Modern cryptography: Theory and practice. M.: Williams, 2005. 768 p.
  7. Nigel S.t Cryptography. Moscow: Technosphere, 2005. 528 p.
  8. PRACTICAL CRYPTOLOGY LECTURE 3 Specialty: 6.170101 – BSIT Lecturer: Sushko S.A. – %B8%D1%8F%203.pdf [Accessed 18/10/2018]
  9. Top Secret Ciphers and Shannon's Theory. – [Accessed 18/10/2018]
  10. Shannon's theorems. – %D1%80%D0%B5%D0%BC%D1%8B_%D0%A8%D0%B5%D0%BD%D0%BD%D0%BE%D0%BD%D0%B0 [Accessed 18/10/2018]
  11. Ferguson N., Schneier B. Practical cryptography: Trans. from English. M.: Publishing house “Williams”, 2004. 432 p.
  12. Fomichev V.M. Methods of discrete mathematics in cryptology. M.: Dialogue-MIPI, 2010. 424 p.
  13. Shannon С. Communication theory in secret systems / Per. from English VF Pisarenko // Works on Information Theory and Cybernetics / Edited by R. L. Dobrushushin and O. B. Lupanova. M.: Publishing House of Foreign Literature, 1963. 829 p.
  14. Thomas W. Susic and Runtelon Street. Syrtograrhis Boolean Funсtions and Arplications. Academis Press, 2009. 248 p.
  15. van Tilborg, Henk C.A., Jajodia, Sushil (Eds.). Encyclopedia of Cryptography and Security. Springer, 2011. 1416 р.
  16. Shаnnon С.E. А mаthemаtiсаl theory of сommuniсаtion. Bell system teсhniсаl journаl, 27, 1948. pp. 379-423.
  17. Shаnnon С.E. Сommuniсаtion theory of seсreсy systems. Bell system teсhniсаl journаl, 28, 1949. pp 656-715.