Encryption algorithm "QAMAL NPNS" based on a nonpositional polynomial notation

Abstract

Processing, storage, and transmission of information are important processes in modern society. The practical application of cryptography has become an integral part of the life of modern society. In Kazakhstani, for the protection of the electronic information are mainly used foreign software and hardware-software tools . Therefore, the development of Kazakhstan cryptographic protection tools is certainly necessary. This article describes the new Qamal NPNS encryption algorithm, which is a modification of the previously developed Qamal encryption algorithm. The modification lies in the use of a transformation based on a non-positional polynomial notation (NPN). To build a new encryption algorithm, an SP-network is also used. The theoretical justification of the appropriateness of applying the NPN and the results of the analysis of the encryption algorithm are given. Algebraic cryptanalysis for multiplication in non-positional polynomial notations was considered separately. The study of the algorithm strength for separate procedures showed good results, which suggest the cryptographic strength of the developed algorithm.