The model of encryption algorithm based on non-positional polynomial notations and constructed on an SP-network

Abstract

This paper addresses to structures and properties of the cryptographic information protection algorithm model based on NPNs and constructed on an SP-network. The main task of the research is to increase the cryptostrength of the algorithm. In the paper, the transformation resulting in the improvement of the cryptographic strength of the algorithm is described in detail. The proposed model is based on an SP-network. The reasons for using the SP-network in this model are the conversion properties used in these networks. In the encryption process, transformations based on S-boxes and P-boxes are used. It is known that these transformations can withstand cryptanalysis. In addition, in the proposed model, transformations that satisfy the requirements of the “avalanche effect” are used. As a result of this work, a computer program that implements an encryption algorithm model based on the SP-network has been developed.

Keywords

• cryptography
• encryption algorithms
• sp-network
• non-positional polynomial notations
• avalanche effect