Development and Study of an Encryption Algorithm

Kapalova, Nursulu; Sakan, Kairat; Algazy, Kunbolat; Dyusenbayev, Dilmukhanbet

doi:10.3390/computation10110198

Cited by 6 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithm uses pre-developed and investigated S-boxes. The findings are described in [21][22][23]. The study of the cryptostrength of the algorithm begins with the cryptanalysis of each transformation separately.…”

Section: Discussionmentioning

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

Section: Discussionmentioning

confidence: 99%

International Journal of Electronics and Telecommunications

Biyashev

Kapalova

Dyusenbayev³

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Therefore, the result for the cryptanalyst will be better if the number of eights in the table is smaller. If the number of eights is much greater than the second numbers in the table, then it is said that the 4-bit cryptographic S-block is more resistant to linear cryptanalysis [12,31,32].…”

Section: 4 Linear Cryptanalysis Of the Lbc Algorithmmentioning

confidence: 99%

Development of a new lightweight encryption algorithm

Kapalova

Algazy

Haumen

2023

EEJET

View full text Add to dashboard Cite

Lightweight encryption algorithms are considered a relatively new direction in the development of private key cryptography. This need arose as a result of the emergence of a large number of devices with little computing power and memory. Therefore, it became necessary to develop algorithms that can provide a sufficient level of security, with minimal use of resources. The paper presents a new lightweight LBC encryption algorithm. LBC is a 64–bit symmetric block algorithm. It supports 80 bit secret key. The number of rounds is 20. The algorithm has a Feistel network structure. The developed lightweight algorithm has a simple implementation scheme, and the transformations used in this algorithm have good cryptographic properties. This was verified by studying the cryptographic properties of the algorithm using the "avalanche effect" and statistical tests. The avalanche property was checked for each round when each bit of the source text was changed. Based on the work carried out, it was found that the proposed encryption algorithm is effective to ensure a good avalanche effect and the binary sequence obtained after encryption is close to random. Its security against linear and differential cryptanalysis is also evaluated. The results of the research revealed good cryptographic properties of this algorithm. The algorithm will be used for devices with small hardware resources, in information and communication systems where confidential information circulates, and it is also extremely necessary to exchange information in a protected form in an operationally acceptable time

show abstract

“…Round keys are directly added to the original encryption data to hide the dependency between input and output in a particular round. Therefore, the statistical properties of the key schedule scheme are important for obtaining random ciphertexts in each round [4], [5]. When developing an encryption algorithm, it is impossible to test all combinations of master keys.…”

Section: Introductionmentioning

confidence: 99%

Statistical analysis of the key scheduling of the new lightweight block cipher

Kapalova,

Algazy,

Haumen

et al. 2023

IJECE

View full text Add to dashboard Cite

This research paper is aimed at studying the generation of round keys (GRK) of the lightweight block cipher (LBC), which provides an optimal balance between security, performance, and minimal costs in internet of things (IoT). For comparative analysis, the GRK of the well-known PRESENT algorithm was studied. A number of studies have been carried out to assess the cryptographic strength of encryption algorithms, however, less attention has been paid to the assessment of the reliability of GRK algorithms, which can lead to a possible weakening of a cryptosystem. A trusted GRK should issue random and independent round keys regardless of the secret key. The experiments were carried out with secret keys of low and high density, as well as random numbers. The obtained results show that the GRK of the LBC algorithm generates random round keys that successfully pass tests of the National Institute of Standards and Technology (NIST) for randomness.

show abstract

Development and Study of an Encryption Algorithm

Cited by 6 publications

References 12 publications

International Journal of Electronics and Telecommunications

International Journal of Electronics and Telecommunications

Development of a new lightweight encryption algorithm

Statistical analysis of the key scheduling of the new lightweight block cipher

Contact Info

Product

Resources

About