EVALUATION OF THE EFFICIENCY OF MODERN DATA ENCRYPTION TOOLS USING THE NAVEOL ALGORITHM

Abstract

The paper evaluates the effectiveness of the proposed algorithm NaVeOl_Cript_UNO in comparison with the most common ones. 1,49 GB data was encoded, the number of repetitions was 500. The BlowFish 2000 algorithm completed the encryption in 186 ± 1,5 s, the NaVeOl_Cript_UNO algorithm completed the procedure in 98 ± 0,6 s. The information processing speed using the NaVeOl algorithm is 1,9 times faster than using the BlowFish algorithm. The absolute encryption time for a file of 1,49 GB in size on one core was 22,37 ± 0,03 s, the rate was 66,6 ± 0,5 Mb/s. For each encoded byte, an average of 44 machine cycles was spent, which is 54 times faster compared to the A5/1 algorithm. The performance of the algorithm in the limit of 202 KB and above does not have a clearly defined dependence on the size of the encoded file and the polynomial function with a significance level of 0,95. The impact of the algorithm type on entropy was evaluated using a 100 000 KB file. The file is filled with null values. It was encoded using BlowFish and NaVeOl_Cript, with the key 0123456789. The compression ratio was used to estimate the entropy of the files. As a result of compression of the source file, a 6 KB archive was obtained. The result obtained shows that the algorithms BlowFish and WinRAR 6.02 x64 are significantly inferior to the algorithm NaVeOl_Cript in terms of reducing redundancy in the file and, as a result, increasing entropy and encoding complexity.