Differential Analysis of a Cryptographic Hashing Algorithm HBC-256

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

doi:10.3390/app121910173

Cited by 2 publications

(4 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have developed the HAS01 hashing algorithm based on the cryptographic sponge construction. The reliability of this algorithm has been studied through an analysis of the avalanche effect, and the F-function of the HAS01 algorithm has been investigated using methods such as exhaustive search and collision search through chain and differential cryptanalysis [22].…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Development of a New Post-Quantum Digital Signature Algorithm: Syrga-1

Algazy,

Sakan,

Khompysh

et al. 2024

Computers

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Discussionmentioning

confidence: 99%

“…The sponge construction operates on a state consisting of 𝑏 = 𝑟 + 𝑐 bits, where 𝑟 is the bitrate and c is the capacity of the sponge. The sponge function has two phases-absorbing and squeezing [21,22].…”

Section: Hashing Algorithm Has01mentioning

confidence: 99%

Development of a New Post-Quantum Digital Signature Algorithm: Syrga-1

Algazy,

Sakan,

Khompysh

et al. 2024

Computers

Self Cite

View full text Add to dashboard Cite

show abstract

“…In this subsection, the efficiency of Syrga2 is analyzed using the HBC-256 and HAS01 hash functions developed at the IICT [26][27][28]. Software was implemented in the C++…”

Section: Performance Evaluation Of Syrga2mentioning

confidence: 99%

“…In this subsection, the efficiency of Syrga2 is analyzed using the HBC-256 and HAS01 hash functions developed at the IICT [26][27][28]. Software was implemented in the C++ programming language using the Microsoft Visual Studio integrated development environment for an objective performance evaluation.…”

Section: Performance Evaluation Of Syrga2mentioning

confidence: 99%

Syrga2: Post-Quantum Hash-Based Signature Scheme

Algazy,

Sakan,

Nyssanbayeva

et al. 2024

Computation

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Differential Analysis of a Cryptographic Hashing Algorithm HBC-256

Cited by 2 publications

References 26 publications

Development of a New Post-Quantum Digital Signature Algorithm: Syrga-1

Development of a New Post-Quantum Digital Signature Algorithm: Syrga-1

Syrga2: Post-Quantum Hash-Based Signature Scheme

Contact Info

Product

Resources

About