Mathematical model and methods of verification of cryptographic protocols

In this paper, a new mathematical model of cryptographic protocols is presented, and examples of the application of this model for solving problems of verification of cryptographic protocols are given. Cryptographic protocols are distributed algorithms designed to enable the transmission of confidential information in an insecure environment. They are used, for example, in electronic payments, electronic voting procedures, systems for accessing confidential data, etc. Errors in cryptographic protocols can lead to great damage, therefore it is necessary to use mathematical methods to substantiate the various properties of correctness and security of cryptographic protocols. The paper outlines new methods for formal verification of cryptographic protocols.