Algazy Kunbolat

@iict.kz

Information security laboratory
Institute of Information and Computational Technologies

Algazy Kunbolat


                  Download Compact PDF  
https://researchid.co/kunbolatalgazy

RESEARCH INTERESTS

Information security
Сryptography
Сryptanalysis
21

Scopus Publications

160

Scholar Citations

8

Scholar h-index

6

Scholar i10-index

Scopus Publications

  • A new digital signature scheme based on the Verkle tree using the Chinese Remainder Theorem
    Kunbolat Algazy, Kairat Sakan, Daniel Sawicki
    Proceedings of SPIE the International Society for Optical Engineering, 2025
  • Secret Sharing Scheme with Share Verification Capability
    Nursulu Kapalova, Armanbek Haumen, Kunbolat Algazy
    Computers, 2025
    This paper examines the properties of classical secret sharing schemes used in information protection systems, including the protection of valuable and confidential data. It addresses issues such as implementation complexity, limited flexibility, vulnerability to new types of attacks, the requirements for such schemes, and analyzes existing approaches to their solutions. A new secret sharing scheme is proposed as a potential solution to these challenges. The developed scheme is based on multivariable functions. The shares distributed among participants represent the values of these functions. Secret reconstruction is reduced to solving a system of linear equations composed of such functions. The structure and mathematical foundation of the scheme are presented, along with an analysis of its properties. A key feature of the proposed scheme is the incorporation of functions aimed at authenticating participants and verifying the integrity of the distributed shares. The paper also provides a cryptanalysis of the scheme, evaluates its resistance to various types of attacks, and discusses the results obtained. Thus, this work contributes to the advancement of information security methods by offering a modern and reliable solution for the secure storage and joint use of secret data.
  • Lightweight Hash Function Design for the Internet of Things: Structure and SAT-Based Cryptanalysis
    Kairat Sakan, Kunbolat Algazy, Nursulu Kapalova, Andrey Varennikov
    Algorithms, 2025
    This paper introduces a lightweight cryptographic hash algorithm, LWH-128, developed using a sponge-based construction and specifically adapted for operation under constrained computational and energy conditions typical of embedded systems and Internet of Things devices. The algorithm employs a two-layer processing structure based on simple logical operations (XOR, cyclic shifts, and S-boxes) and incorporates a preliminary diffusion transformation function G, along with the Davis–Meyer compression scheme, to enhance irreversibility and improve cryptographic robustness. A comparative analysis of hardware implementation demonstrates that LWH-128 exhibits balanced characteristics in terms of circuit complexity, memory usage, and processing speed, making it competitive with existing lightweight hash algorithms. As part of the cryptanalytic evaluation, a Boolean SATisfiability (SAT) Problem-based model of the compression function is constructed in the form of a conjunctive normal form of Boolean variables. Experimental results using the Parkissat SAT solver show an exponential increase in computational time as the number of unknown input bits increased. These findings support the conclusion that the LWH-128 algorithm exhibits strong resistance to preimage attacks based on SAT-solving techniques.
  • Design of a Secret Sharing Scheme with Mandatory Subgroup Participation
    Nursulu Kapalova, Dilmukhanbet Dyusenbayev, Ardabek Khompysh, Kunbolat Algazy
    Applied Sciences Switzerland, 2025
    This paper proposes an approach based on a secret sharing scheme with the mandatory participation of predefined subgroups. The proposed scheme allows secret reconstruction only when representatives from each designated group of participants (e.g., cloud providers, legally independent parties, etc.) are present. This mechanism enhances resistance to internal collusion, strengthens access control, and enables distributed management. The structure and mathematical foundations of the proposed scheme are presented, along with an analysis of its properties. A cryptanalysis is conducted, evaluating the scheme’s resilience to various types of attacks, and the results are discussed. The computational complexity of the algorithm is also analyzed, and its resource efficiency is confirmed.
  • Polynomial Commitment in a Verkle Tree Based on a Non-Positional Polynomial Notation
    Kunbolat T. Algazy, Kairat S. Sakan, Saule E. Nyssanbayeva, Ardabek Khompysh
    Computers Materials and Continua, 2025
    : This paper examines the application of the Verkle tree—an efficient data structure that leverages commitments and a novel proof technique in cryptographic solutions. Unlike traditional Merkle trees, the Verkle tree significantly reduces signature size by utilizing polynomial and vector commitments. Compact proofs also accelerate the verification process, reducing computational overhead, which makes Verkle trees particularly useful. The study proposes a new approach based on a non-positional polynomial notation (NPN) employing the Chinese Remainder Theorem (CRT). CRT enables efficient data representation and verification by decomposing data into smaller, independent components, simplifying computations, reducing overhead, and enhancing scalability. This technique facilitates parallel data processing, which is especially advantageous in cryptographic applications such as commitment and proof construction in Verkle trees, as well as in systems with constrained computational resources. Theoretical foundations of the approach, its advantages, and practical implementation aspects are explored, including resistance to potential attacks, application domains, and a comparative analysis with existing methods based on well-known parameters and characteristics. An analysis of potential attacks and vulnerabilities, including greatest common divisor (GCD) attacks, approximate multiple attacks (LLL lattice-based), brute-force search for irreducible polynomials, and the estimation of their total number, indicates that no vulnerabilities have been identified in the proposed method thus far. Furthermore, the study demonstrates that integrating CRT with Verkle trees ensures high scalability, making this approach promising for blockchain systems and other distributed systems requiring compact and efficient proofs.
  • Syrga2: Post-Quantum Hash-Based Signature Scheme
    Kunbolat Algazy, Kairat Sakan, Saule Nyssanbayeva, Oleg Lizunov
    Computation, 2024
    This paper proposes a new post-quantum signature scheme, Syrga2, based on hash functions. As known, existing post-quantum algorithms are classified based on their structures. The proposed Syrga2 scheme belongs to the class of multi-use signatures with state retention. A distinctive feature of state-retaining signatures is achieving a compromise between performance and signature size. This scheme enables the creation of a secure signature for r messages using a single pair of secret and public keys. The strength of signature algorithms based on hash functions depends on the properties of the hash function used in their structure. Additionally, for such algorithms, it is possible to specify the security level precisely. In the proposed scheme, the HBC-256 algorithm developed at the Institute of Information and Computational Technologies (IICT) is used as the hash function. The security of the HBC-256 algorithm has been thoroughly studied in other works by the authors. In contrast to the Syrga1 scheme presented in previous works by the authors, the Syrga2 scheme provides for the definition of different security levels determined by the parameter τ. This paper experimentally demonstrates the impossibility of breaking the proposed scheme using a chosen-plaintext attack. Additionally, the scheme’s performance is evaluated for signature creation, signing, and message verification.
  • Development of a New Post-Quantum Digital Signature Algorithm: Syrga-1
    Kunbolat Algazy, Kairat Sakan, Ardabek Khompysh, Dilmukhanbet Dyusenbayev
    Computers, 2024
    The distinguishing feature of hash-based algorithms is their high confidence in security. When designing electronic signature schemes, proofs of security reduction to certain properties of cryptographic hash functions are used. This means that if the scheme is compromised, then one of these properties will be violated. It is important to note that the properties of cryptographic hash functions have been studied for many years, but if a specific hash function used in a protocol turns out to be insecure, it can simply be replaced with another one while keeping the overall construction unchanged. This article describes a new post-quantum signature algorithm, Syrga-1, based on a hash function. This algorithm is designed to sign r messages with a single secret key. One of the key primitives of the signature algorithm is a cryptographic hash function. The proposed algorithm uses the HAS01 hashing algorithm developed by researchers from the Information Security Laboratory of the Institute of Information and Computational Technologies. The security and efficiency of the specified hash algorithm have been demonstrated in other articles by its authors. Hash-based signature schemes are attractive as post-quantum signature schemes because their security can be quantified, and their security has been proven.
  • Statistical analysis of the key scheduling of the new lightweight block cipher
    Nursulu Kapalova, Kunbolat Algazy, Armanbek Haumen, Kairat Sakan
    International Journal of Electrical and Computer Engineering, 2023
    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.
  • Evaluation of the strength and performance of a new hashing algorithm based on a block cipher
    Kunbolat Algazy, Kairat Sakan, Nursulu Kapalova
    International Journal of Electrical and Computer Engineering, 2023
    The article evaluates the reliability of the new HBC-256 hashing algorithm. To study the cryptographic properties, the algorithm was implemented in software using Python and C programming languages. Also, for the algebraic analysis of the HBC-256 algorithm, a system of Boolean equations was built for one round using the Transalg tool. The program code that implements the hashing algorithm was converted into a software program for generating equations. As a result, one round of the compression function was described as conjunctive normal form (CNF) using 82,533 equations and 16,609 variables. To search for a collision, the satisfiability (SAT) problem solver Lingeling was used, including a version with the possibility of parallel computing. It is shown that each new round doubles the number of equations and variables, and the time to find the solution will grow exponentially. Therefore, it is not possible to find solutions for the full HBC256 hash function.
  • DEVELOPMENT OF A NEW LIGHTWEIGHT ENCRYPTION ALGORITHM
    Nursulu Kapalova, Kunbolat Algazy, Armanbek Haumen
    Eastern European Journal of Enterprise Technologies, 2023
    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
  • Development and Study of an Encryption Algorithm
    Nursulu Kapalova, Kairat Sakan, Kunbolat Algazy, Dilmukhanbet Dyusenbayev
    Computation, 2022
  • Differential Analysis of a Cryptographic Hashing Algorithm HBC-256
    Kunbolat Algazy, Kairat Sakan, Nursulu Kapalova, Saule Nyssanbayeva, Dilmukhanbet Dyusenbayev
    Applied Sciences Switzerland, 2022
  • Design of substitution nodes (S-Boxes) of a block cipher intended for preliminary encryption of confidential information
    Ardabek Khompysh, Nursulu Kapalova, Kunbolat Algazy, Dilmukhanbet Dyusenbayev, Kairat Sakan
    Cogent Engineering, 2022
  • DEVELOPMENT AND ANALYSIS OF THE NEW HASHING ALGORITHM BASED ON BLOCK CIPHER
    Kairat Sakan, Saule Nyssanbayeva, Nursulu Kapalova, Kunbolat Algazy, Ardabek Khompysh, et al.
    Eastern European Journal of Enterprise Technologies, 2022
  • Development and analysis of symmetric encryption algorithm qamal based on a substitution-permutation network
    International Journal of Electronics and Telecommunications, 2021
  • ENCRYPTION ALGORITHM "QAMAL NPNS"BASED ON A NONPOSITIONAL POLYNOMIAL NOTATION
    A. Bektemessov, V. E. Vlassyuk
    Kaznu Bulletin Mathematics Mechanics Computer Science Series, 2020
  • A block encryption algorithm based on exponentiation transform
    Nursulu Kapalova, Ardabek Khompysh, Müslüm Arici, Kunbolat Algazy
    Cogent Engineering, 2020
  • Differential cryptanalysis of new qamal encryption algorithm
    International Journal of Electronics and Telecommunications, 2020
  • Investigation of the different implementations for the new cipher Qamal
    Kunbolat Algazy, Rustem Biyashev, Nursulu Kapalova, Ludmila Babenko, Evgeniya Ishchukova, et al.
    ACM International Conference Proceeding Series, 2019
  • Expansion of the operating spectral range of the optical processor
    Valentin H. Kolobrodov, Grygorij S. Tymchyk, Mykyta S. Kolobrodov, Andrzej Kociubinski, Nataliya Denissova, et al.
    Proceedings of SPIE the International Society for Optical Engineering, 2019
  • Development and analysis of the encryption algorithm in nonpositional polynomial notations
    R.G. Biyashev, M.N. Kalimoldayev, S.E. Nyssanbayeva, N.A. Kapalova, D.S. Dyusenbayev, et al.
    Eurasian Journal of Mathematical and Computer Applications, 2018

RECENT SCHOLAR PUBLICATIONS

  • Investigation of the statistical security of a pseudo-random sequence generator
    SE Nysanbayeva, NA Kapalova, DS Dyusenbayev, KT Algazy, KS Sakan
    Москва 2, 137-143 , 2026
    2026
  • A new digital signature scheme based on the Verkle tree using the Chinese remainder theorem
    K Algazy, K Sakan, D Sawicki
    Photonics Applications in Astronomy, Communications, Industry, and High … , 2025
    2025
  • Secret sharing scheme with share verification capability
    N Kapalova, A Haumen, K Algazy
    Computers 14 (9), 393 , 2025
    2025
    Citations: 4
  • Lightweight Hash Function Design for the Internet of Things: Structure and SAT-Based Cryptanalysis
    K Sakan, K Algazy, N Kapalova, A Varennikov
    Algorithms 18 (9), 550 , 2025
    2025
    Citations: 1
  • Design of a Secret Sharing Scheme with Mandatory Subgroup Participation
    N Kapalova, D Dyusenbayev, A Khompysh, K Algazy
    Applied Sciences 15 (17), 9550 , 2025
    2025
    Citations: 1
  • Polynomial Commitment in a Verkle Tree Based on a Non-Positional Polynomial Notation
    KT Algazy, KS Sakan, SE Nyssanbayeva, A Khompysh
    Computers, Materials & Continua 84 (1), 1581-1595 , 2025
    2025
  • Application of satisfiability problem solvers for assessing the strength of hash algorithms
    K Algazy, K Sakan, A Varennikov, N Kapalova
    IJECE 15, 3191-3201 , 2025
    2025
    Citations: 1
  • STATISTICAL PROPERTIES OF THE PSEUDORANDOM SEQUENCE GENERATION ALGORITHM
    A Khompysh, K Algazy, N Kapalova, K Sakan, D Dyusenbayev
    Scientific Journal of Astana IT University, 107-119 , 2024
    2024
  • Syrga2: post-quantum hash-based signature scheme
    K Algazy, K Sakan, S Nyssanbayeva, O Lizunov
    Computation 12 (6), 125 , 2024
    2024
    Citations: 9
  • Development of a new post-quantum digital signature algorithm: Syrga-1
    K Algazy, K Sakan, A Khompysh, D Dyusenbayev
    Computers 13 (1), 26 , 2024
    2024
    Citations: 11
  • STATISTICAL ANALYSIS OF THE HAS03 HASH FUNCTION BASED ON THE SPONGE STRUCTURE
    KT Algazy, KS Sakan, DS Dyusenbayev
    Scientific and practical cyber security journal , 2024
    2024
    Citations: 1
  • Development of a New Post-Quantum Digital Signature Algorithm: Syrga-1. Computers 2024, 13, 26
    K Algazy, K Sakan, A Khompysh, D Dyusenbayev
    2024
    Citations: 1
  • POST-QUANTUM CRYPTOGRAPHY BASED ON HASH FUNCTIONS
    KT Algazy, KS Sakan, NA Kapalova
    С56 Современные методы, средства и технологии защиты информа, 251 , 2024
    2024
  • Statistical analysis of the key scheduling of the new lightweight block cipher
    N Kapalova, K Algazy, A Haumen, K Sakan
    Int. J. Electr. Comput. Eng.(IJECE) 13, 6817-6826 , 2023
    2023
    Citations: 6
  • DEVELOPMENT OF A NEW LIGHTWEIGHT ENCRYPTION ALGORITHM.
    N Kapalova, K Algazy, A Haumen
    Eastern-European Journal of Enterprise Technologies 123 (9) , 2023
    2023
    Citations: 11
  • Evaluation of the strength and performance of a new hashing algorithm based on a block cipher
    K Algazy, K Sakan, N Kapalova
    Int. J. Electr. Comput. Eng.(IJECE) 13, 3124-3130 , 2023
    2023
    Citations: 5
  • Design of substitution nodes (S-Boxes) of a block cipher intended for preliminary encryption of confidential information
    A Khompysh, N Kapalova, K Algazy, D Dyusenbayev, K Sakan
    Cogent Engineering 9 (1), 2080623 , 2022
    2022
    Citations: 23
  • STUDY OF THE CRYPTOGRAPHIC STRENGTH OF THE S-BOX OBTAINED ON THE BASIS OF EXPONENTIATION MODULO
    A Khompysh, N Kapalova, K Algazy, K Sakan
    Scientific Journal of Astana IT University, 81-88 , 2022
    2022
  • Development and study of an encryption algorithm
    N Kapalova, K Sakan, K Algazy, D Dyusenbayev
    Computation 10 (11), 198 , 2022
    2022
    Citations: 7
  • Differential analysis of a cryptographic hashing algorithm HBC-256
    K Algazy, K Sakan, N Kapalova, S Nyssanbayeva, D Dyusenbayev
    Applied Sciences 12 (19), 10173 , 2022
    2022
    Citations: 6

MOST CITED SCHOLAR PUBLICATIONS

  • Design of substitution nodes (S-Boxes) of a block cipher intended for preliminary encryption of confidential information
    A Khompysh, N Kapalova, K Algazy, D Dyusenbayev, K Sakan
    Cogent Engineering 9 (1), 2080623 , 2022
    2022
    Citations: 23
  • DEVELOPMENT AND ANALYSIS OF THE NEW HASHING ALGORITHM BASED ON BLOCK CIPHER.
    K Sakan, S Nyssanbayeva, N Kapalova, K Algazy, A Khompysh, ...
    Eastern-European Journal of Enterprise Technologies 116 (9) , 2022
    2022
    Citations: 17
  • A block encryption algorithm based on exponentiation transform
    N Kapalova, A Khompysh, M Arici, K Algazy
    Cogent engineering 7 (1), 1788292 , 2020
    2020
    Citations: 13
  • Differential cryptanalysis of new Qamal encryption algorithm
    KT Algazy, LK Babenko, RG Biyashev, EA Ishchukova, R Romaniuk, ...
    International journal of electronics and telecommunications 66 (4), 647-653 , 2020
    2020
    Citations: 13
  • Development of a new post-quantum digital signature algorithm: Syrga-1
    K Algazy, K Sakan, A Khompysh, D Dyusenbayev
    Computers 13 (1), 26 , 2024
    2024
    Citations: 11
  • DEVELOPMENT OF A NEW LIGHTWEIGHT ENCRYPTION ALGORITHM.
    N Kapalova, K Algazy, A Haumen
    Eastern-European Journal of Enterprise Technologies 123 (9) , 2023
    2023
    Citations: 11
  • Syrga2: post-quantum hash-based signature scheme
    K Algazy, K Sakan, S Nyssanbayeva, O Lizunov
    Computation 12 (6), 125 , 2024
    2024
    Citations: 9
  • Development and analysis of the encryption algorithm in nonpositional polynomial notations
    RG Biyashev, MN Kalimoldayev, SE Nyssanbayeva, NA Kapalova, ...
    Eurasian Journal of Mathematical and Computer Applications 6 (2), 19-33 , 2018
    2018
    Citations: 9
  • Development and study of an encryption algorithm
    N Kapalova, K Sakan, K Algazy, D Dyusenbayev
    Computation 10 (11), 198 , 2022
    2022
    Citations: 7
  • Development and analysis of symmetric encryption algorithm Qamal based on a substitution-permutation network
    RG Biyashev, NA Kapalova, DS Dyusenbayev, KT Algazy, W Wojcik, ...
    International journal of electronics and telecommunications 67 (1), 127-132 , 2021
    2021
    Citations: 7
  • Statistical analysis of the key scheduling of the new lightweight block cipher
    N Kapalova, K Algazy, A Haumen, K Sakan
    Int. J. Electr. Comput. Eng.(IJECE) 13, 6817-6826 , 2023
    2023
    Citations: 6
  • Differential analysis of a cryptographic hashing algorithm HBC-256
    K Algazy, K Sakan, N Kapalova, S Nyssanbayeva, D Dyusenbayev
    Applied Sciences 12 (19), 10173 , 2022
    2022
    Citations: 6
  • Encryption algorithm" Qamal NPNS" based on a nonpositional polynomial notation
    RG Biyashev, A Smolarz, KT Algazy, A Khompysh
    Journal of Mathematics, Mechanics and Computer Science 105 (1), 198-207 , 2020
    2020
    Citations: 6
  • Evaluation of the strength and performance of a new hashing algorithm based on a block cipher
    K Algazy, K Sakan, N Kapalova
    Int. J. Electr. Comput. Eng.(IJECE) 13, 3124-3130 , 2023
    2023
    Citations: 5
  • Secret sharing scheme with share verification capability
    N Kapalova, A Haumen, K Algazy
    Computers 14 (9), 393 , 2025
    2025
    Citations: 4
  • Algebraic cryptanalysis of block ciphers
    R Biyashev, D Dyusenbayev, K Algazy, N Kapalova
    2019 International Conference on Wireless Communication, Network and … , 2019
    2019
    Citations: 4
  • Investigation of the different implementations for the new cipher Qamal
    K Algazy, R Biyashev, N Kapalova, L Babenko, E Ishchukova, ...
    Proceedings of the 12th International Conference on Security of Information … , 2019
    2019
    Citations: 3
  • Lightweight Hash Function Design for the Internet of Things: Structure and SAT-Based Cryptanalysis
    K Sakan, K Algazy, N Kapalova, A Varennikov
    Algorithms 18 (9), 550 , 2025
    2025
    Citations: 1
  • Design of a Secret Sharing Scheme with Mandatory Subgroup Participation
    N Kapalova, D Dyusenbayev, A Khompysh, K Algazy
    Applied Sciences 15 (17), 9550 , 2025
    2025
    Citations: 1
  • Application of satisfiability problem solvers for assessing the strength of hash algorithms
    K Algazy, K Sakan, A Varennikov, N Kapalova
    IJECE 15, 3191-3201 , 2025
    2025
    Citations: 1