{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T10:10:55Z","timestamp":1764238255386,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T00:00:00Z","timestamp":1718409600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Science and Higher Education of Kazakhstan","award":["AP14870719"],"award-info":[{"award-number":["AP14870719"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>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\u00a0r\u00a0messages 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\u00a0\u03c4. This paper experimentally demonstrates the impossibility of breaking the proposed scheme using a chosen-plaintext attack. Additionally, the scheme\u2019s performance is evaluated for signature creation, signing, and message verification.<\/jats:p>","DOI":"10.3390\/computation12060125","type":"journal-article","created":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T04:48:12Z","timestamp":1718599692000},"page":"125","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Syrga2: Post-Quantum Hash-Based Signature Scheme"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3670-2170","authenticated-orcid":false,"given":"Kunbolat","family":"Algazy","sequence":"first","affiliation":[{"name":"Information Security Laboratory, Institute of Information and Computational Technologies, Almaty 050010, Kazakhstan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6812-6000","authenticated-orcid":false,"given":"Kairat","family":"Sakan","sequence":"additional","affiliation":[{"name":"Information Security Laboratory, Institute of Information and Computational Technologies, Almaty 050010, Kazakhstan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saule","family":"Nyssanbayeva","sequence":"additional","affiliation":[{"name":"Information Security Laboratory, Institute of Information and Computational Technologies, Almaty 050010, Kazakhstan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleg","family":"Lizunov","sequence":"additional","affiliation":[{"name":"Information Security Laboratory, Institute of Information and Computational Technologies, Almaty 050010, Kazakhstan"},{"name":"Institute of Automation and Information Technologies, Satbayev University, Almaty 050013, Kazakhstan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,6,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Li, S., Chen, Y., Chen, L., Liao, J., Kuang, C., Li, K., Liang, W., and Xiong, N. (2023). Post-Quantum Security: Opportunities and Challenges. Sensors, 23.","DOI":"10.3390\/s23218744"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1134\/S1990478923040087","article-title":"Post-Quantum Cryptosystems: Open Problems and Solutions. Lattice-Based Cryptosystems","volume":"17","author":"Malygina","year":"2023","journal-title":"J. Appl. Ind. Math."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"103487","DOI":"10.1016\/j.micpro.2020.103487","article-title":"Post-quantum signature schemes for efficient hardware implementation","volume":"80","author":"Moldovyan","year":"2021","journal-title":"Microprocess. Microsyst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/JIOT.2020.3013019","article-title":"On the Role of Hash-Based Signatures in Quantum-Safe Internet of Things: Current Solutions and Future Directions","volume":"8","author":"Suhail","year":"2021","journal-title":"IEEE Internet Things J."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"100242","DOI":"10.1016\/j.array.2022.100242","article-title":"Post-quantum cryptography Algorithm\u2019s standardization and performance analysis","volume":"15","author":"Kumar","year":"2022","journal-title":"Array"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Pljonkin, A., Petrov, D., Sabantina, L., and Dakhkilgova, K. (2021). Nonclassical Attack on a Quantum Key Distribution System. Entropy, 23.","DOI":"10.3390\/e23050509"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Pljonkin, A. (2021). Vulnerability of the Synchronization Process in the Quantum Key Distribution System. Research Anthology on Advancements in Quantum Technology, IGI Global.","DOI":"10.4018\/978-1-7998-8593-1.ch015"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Palmieri, P. (2018, January 8\u201310). Hash-Based Signatures for the Internet of Things: Position Paper. Proceedings of the 15th ACM International Conference on Computing Frontiers, Ischia, Italy.","DOI":"10.1145\/3203217.3206427"},{"key":"ref_9","unstructured":"Bernstein, D.J., H\u00fclsing, A., Kolbl, S., Niederhagen, R., Rijneveld, J., and Schwabe, P. (2019, January 11\u201315). The SPHINCS + signature framework. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (CCS \u201919), London, UK."},{"key":"ref_10","first-page":"92","article-title":"Hybrid Post Quantum Crypto System","volume":"2","author":"Iavich","year":"2019","journal-title":"Sci. Pract. Cyber Secur. J. (SPCSJ)"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/MSP.2017.3151326","article-title":"Postquantum Cryptography\u2014State of the Art","volume":"15","author":"Buchmann","year":"2017","journal-title":"IEEE Secur. Priv."},{"key":"ref_12","first-page":"129","article-title":"Post-quantum lattice-based cryptography implementations","volume":"51","author":"Nejatollahi","year":"2022","journal-title":"ACM Comput. Surv."},{"key":"ref_13","first-page":"194","article-title":"Optimal Parameters for XMSSMT","volume":"Volume 8128","author":"Cuzzocrea","year":"2013","journal-title":"Security Engineering and Intelligence Informatics"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.ins.2020.05.024","article-title":"WOTS-S: A Quantum Secure Compact Signature Scheme for Distributed Ledger","volume":"539","author":"Shahid","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S1353-4858(20)30105-7","article-title":"The security implications of quantum cryptography and quantum computing","volume":"2020","author":"Cavaliere","year":"2020","journal-title":"Netw. Secur."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Lee, J., and Park, Y. (2021). HORSIC+: An Efficient Post-Quantum Few-Time Signature Scheme. Appl. Sci., 11.","DOI":"10.3390\/app11167350"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Iavich, M., Kuchukhidze, T., and Bocu, R. (2023). A Post-Quantum Digital Signature Using Verkle Trees and Lattices. Symmetry, 15.","DOI":"10.3390\/sym15122165"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Oswald, E., and Fischlin, M. (2015). SPHINCS: Practical Stateless Hash-Based Signatures. EUROCRYPT 2015. Lecture Notes in Computer Science, Springer. Advances in Cryptology\u2014EUROCRYPT 2015.","DOI":"10.1007\/978-3-662-46803-6"},{"key":"ref_19","first-page":"129","article-title":"Security analysis of theW-OTS+ signature scheme: Updating security bounds","volume":"12","author":"Kudinov","year":"2021","journal-title":"Math. Issues Cryptogr."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Katz, J., and Lindell, Y. (2020). Introduction to Modern Cryptography, Chapman & Hall\/CRC. [3rd ed.].","DOI":"10.1201\/9781351133036"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Algazy, K., Sakan, K., Khompysh, A., and Dyusenbayev, D. (2024). Development of a New Post-Quantum Digital Signature Algorithm: Syrga-1. Computers, 13.","DOI":"10.3390\/computers13010026"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/978-3-642-38553-7_10","article-title":"W-OTS+\u2014Shorter Signatures for Hash-Based Signature Schemes","volume":"Volume 7918","author":"Youssef","year":"2013","journal-title":"Progress in Cryptology\u2014AFRICACRYPT 2013"},{"key":"ref_23","unstructured":"Sj\u00f6berg, M. (2017). Post-Quantum Algorithms for Digital Signing in Public Key Infrastructures. [Master\u2019s Thesis, KTH]. Available online: https:\/\/urn.kb.se\/resolve?urn=urn:nbn:se:kth:diva-210909."},{"key":"ref_24","first-page":"1","article-title":"Bit Security as Cost to Demonstrate Advantage","volume":"1","author":"Lee","year":"2024","journal-title":"IACR Commun. Cryptol."},{"key":"ref_25","unstructured":"(2024, January 06). Contribution to the Handbook of Information. Available online: https:\/\/blkcipher.pl\/assets\/pdfs\/NPDF-32.pdf."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Algazy, K., Sakan, K., Kapalova, N., Nyssanbayeva, S., and Dyusenbayev, D. (2022). Differential Analysis of a Cryptographic Hashing Algorithm HBC-256. Appl. Sci., 12.","DOI":"10.3390\/app121910173"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"3124","DOI":"10.11591\/ijece.v13i3.pp3124-3130","article-title":"Evaluation of the strength and performance of a new hashing algorithm based on a block cipher","volume":"13","author":"Algazy","year":"2023","journal-title":"Int. J. Electr. Comput. Eng. (IJECE)"},{"key":"ref_28","first-page":"155","article-title":"A new hashing algorithm\u2014HAS01: Development, cryptographic properties and inclusion in graduate studies","volume":"24","author":"Kapalova","year":"2022","journal-title":"Glob. J. Eng. Educ."}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/12\/6\/125\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:59:27Z","timestamp":1760108367000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/12\/6\/125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,15]]},"references-count":28,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["computation12060125"],"URL":"https:\/\/doi.org\/10.3390\/computation12060125","relation":{},"ISSN":["2079-3197"],"issn-type":[{"type":"electronic","value":"2079-3197"}],"subject":[],"published":{"date-parts":[[2024,6,15]]}}}