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

Kapalova, Nursulu; Haumen, A.

doi:10.1515/eng-2018-0013

Cited by 8 publications

(4 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Any changes in the input data of an S-box must lead to similar-to-random changes in the output data. The relationship between input and output values should not be linear or easily approximated by linear functions (this particular property is used in the linear cryptanalysis) (Kapalova & Haumen, 2018). It is known that S-boxes are used now in many symmetric encryption algorithms, such as AES, GOST R34.13-2015, DES, Twofish, etc.…”

Section: Mathematical Developmentmentioning

confidence: 99%

“…It is known that the cryptostrength of block encryption algorithms depends on the cryptostrength of the S-boxes used in the algorithms. In this context, the linear and differential analyses were performed for the S-boxes used in the proposed algorithm, and the results obtained were compared with the same for the S-boxes of other algorithms (Table 4) (Kapalova & Haumen, 2018).…”

Section: Cryptanalysis Of the S-box In Usementioning

confidence: 99%

See 1 more Smart Citation

A block encryption algorithm based on exponentiation transform

et al. 2020

View full text Add to dashboard Cite

This paper proposes a new block encryption algorithm for cryptographic information protection. It describes a new transformation method EM (Exponentiation Module), which is part of the algorithm, and a method of S-box obtaining. The paper also considers an optimization technique to advance the efficiency of key selection and calculation. We discuss the possibility to obtain good results by applying the peculiar properties of cryptographic primitives in the Galois field. To increase the strength and speed of the encryption algorithm, we used a nonpositional polynomial notation and an indexed view for the Galois field. The paper provides for statistical properties of the ciphertext obtained with the developed algorithm. We also present the results of differential and linear cryptanalysis of the S-box used.

show abstract

Section: Mathematical Developmentmentioning

confidence: 99%

Section: Cryptanalysis Of the S-box In Usementioning

confidence: 99%

A block encryption algorithm based on exponentiation transform

et al. 2020

View full text Add to dashboard Cite

show abstract

“…In recent years, the Institute of Information and Computational Technologies of the Science Committee of the Ministry of Education and Science of the Republic of Kazakhstan has carried out research on the study of symmetrical block encryption algorithms for electronic messages and has developed various modifications, including those based on non-positional polynomial notations (NPNs) [15][16][17][18][19][20][21]. These works, in turn, will contribute to the creation of domestic cryptographic information protection facilities.…”

Section: Literature Reviewmentioning

confidence: 99%

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

Biyashev

Smolarz

Algazy

et al. 2020

JMMCS

View full text Add to dashboard Cite

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.

show abstract

“…As is known, ciphers are based on reversible transformations of plaintext. When working on ciphers, care must be exercised that every operation performed is both cryptographically robust and reversible under a known key [3].…”

Section: Introductionmentioning

confidence: 99%

International Journal of Electronics and Telecommunications

Biyashev

Kapalova

Dyusenbayev³

et al. 2020

View full text Add to dashboard Cite

This paper represents a developed cryptographic information protection algorithm based on a substitutionpermutation network. We describe the cryptographic transformations used in the developed algorithm. One of the features of the algorithm is the simplicity of its modification with regard to different security levels. The algorithm uses a predeveloped S-box tested against differential and linear cryptanalysis. The S-box is consistent with one of the known standards AES and GOST R 34.12-2015. We provide the findings of an avalanche-effect investigation and statistical properties of ciphertexts. The algorithm actually meets the avalanche-effect criterion even after the first round.

show abstract

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

Cited by 8 publications

References 2 publications

A block encryption algorithm based on exponentiation transform

A block encryption algorithm based on exponentiation transform

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

International Journal of Electronics and Telecommunications

Contact Info

Product

Resources

About