Modification of algorithms based on the Feistel network by redundancy introduction using Hamming codes

The article revealed the merits and demerits of the classical Feistel network; on the basis of those, requirements for algorithms based on the Feistel network were put forward to enhance their cryptostability. In accordance with these requirements, a modified algorithm based on the Feistel network was proposed using Hamming codes and an element of randomness; analysis was performed for the main characteristics of the algorithm (execution time, volume of encrypted text, cryptostability) relative to the classical Feistel network. The analysis revealed that the modified algorithm is more cryptographically stable than the classical Feistel network; however, the execution time for the modified algorithm is twice as long as the time of execution of the classical Feis-tel network.