Determining optimal parameters of algebraic fractals in zero-knowledge authentication protocols

Abstract

Most information systems, especially on the Internet, have a distributed architecture with remote access and an insecure communication channel. In such systems, the tasks of permanent authorization mean implementing time intervals of user work without re-authentication are especially actual. The problem is that repeatedly sending a password increases the likelihood of it corruption. One solution is to use zero-knowledge protocols. In these protocols, passwords are not transmitted over the channel but are included in the algorithms as parameters. However, the computational complexity, as well as the finite number of passwords, limit their use, ensuring the relevance of further research. Focusing on object of the exchange protocols security, the use of algebraic fractal sets has been proposed as a potentially infinite source of data for passwords. In this work, algorithms were developed, implemented, and tested, which proved the higher reliability of fractal protocols in comparison with the reference generator of random bits (with an error probability of 0.5). It was also noted that the calculation operations have an insignificant influence on the overall time complexity of the exchange protocol as a whole. Practical recommendations for the use of fractals with a Hausdorff dimensionally of about 1.6 on the boundary of the Mandelbrot set are given. The paper also highlights the advantages of including color information in fractal sets, which gives about 3 times improving of confidential security indicators of communication protocol. The proposed algorithms do not require specialized software and can be implemented in the majority of network information systems as an additional module.