Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering
Sakan, Kairat
Unknown Affiliation
Computer Science & IT Electrical & Electronics Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Statistical analysis of the key scheduling of the new lightweight block cipher Kapalova, Nursulu; Algazy, Kunbolat; Haumen, Armanbek; Sakan, Kairat
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 6: December 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i6.pp6817-6826

Abstract

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.
Application of satisfiability problem solvers for assessing the strength of hash algorithms Algazy, Kunbolat; Sakan, Kairat; Varennikov, Andrey; Kapalova, Nursulu
International Journal of Electrical and Computer Engineering (IJECE) Vol 15, No 3: June 2025
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v15i3.pp3191-3201

Abstract

This article presents a methodology for assessing the strength of cryptographic algorithms and provides experimental data obtained from studying the cryptographic strength of the developed hash function HBC-256 using modern satisfiability problem (SAT) solvers. Various SAT solvers implementing the conflict-driven clause learning (CDCL) algorithm, based on the Davis-Putnam-Logemann-Loveland (DPLL) algorithm, were used to conduct the cryptanalysis of the HBC-256 hash function. The most effective was the parallel SAT solver Parkissat, and thus it was used for more in-depth research. A series of experiments were conducted to determine how resistant the HBC-256 hashing algorithm is to preimage attacks for one, two, three, and four rounds. For this purpose, four sets of files were prepared using special propositional encoding tools, each set including 30 files in the standard of center for discrete mathematics and theoretical computer sciences (DIMACS) format. These files contain Boolean formulas in conjunctive normal form (CNF), used as input for modern SAT solvers. To obtain more accurate time measurements, the same experiment was repeated multiple times, after which the average time was determined. The results of this study show that SAT solvers encounter significant difficulties when attempting to solve the preimage search problem for the full-round version of the HBC-256 hash function, even when only 30 bits of the original message are unknown.
Co-Authors Algazy, Kunbolat Haumen, Armanbek Kapalova, Nursulu Varennikov, Andrey