CRYPTIC RESISTANCE OF ENCRYPTION ALGORITHMS

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.