SYMMETRIC ENCRYPTION ALGORITHM OF INCREASED CRYPTOGRAPHIC RESISTANCE

Abstract

This article proposes a symmetric encryption algorithm of increased cryptographic stability, which is based on the Feistel network, but includes improved solutions to increase the level of security reliability and efficiency. The main goal of the research is to demonstrate how new cryptographic methods can improve the resistance of ciphers to modern attacks, as well as provide greater speed of data processing without loss of reliability.

The algorithm uses 119-bit blocks and a 112-bit key, ensuring an encryption process of 10 rounds. The key aspect of the encryption algorithm is that with the known structure of the algorithm, crypto-resistance is ensured only at the expense of the secret key.

Special attention is paid to the need to use longer encryption blocks (119 bits) than the standard 64-bit blocks in symmetric encryption algorithms, to protect against possible attacks in view of the growth of computing power. In addition, the peculiarity of the symmetric encryption algorithm of increased cryptographic stability is that when using standard encodings (ASCII, UTF-8, etc.), no block will contain a whole number of logical symbols. This makes it difficult to carry out cryptographic analysis, since parts of symbols can be on the border of different blocks, which creates additional difficulties for attackers.

The proposed symmetric encryption algorithm of increased cryptographic stability has potential for use in modern encryption systems and provides a high level of information protection.

The conducted research not only contributes to the further development of encryption theory, but also has practical significance for the development of new, more secure information protection systems.