Next Article in Journal
LLMPC: Large Language Model Predictive Control
Previous Article in Journal
Advanced Identification of Prosodic Boundaries, Speakers, and Accents Through Multi-Task Audio Pre-Processing and Speech Language Models
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Optimizing Post-Quantum Digital Signatures with Verkle Trees and Quantum Seed-Based Pseudo-Random Generators

1
Department of Computer Science, Caucasus University, Tbilisi 0102, Georgia
2
Laboratory of Information Security at the Institute of Information and Computational Technologies, Ministry of Science and Higher Education of the Republic of Kazakhstan, Almaty 050010, Kazakhstan
*
Author to whom correspondence should be addressed.
Computers 2025, 14(3), 103; https://doi.org/10.3390/computers14030103
Submission received: 28 January 2025 / Revised: 1 March 2025 / Accepted: 12 March 2025 / Published: 14 March 2025

Abstract

Nowadays, quantum computing is developing at an unprecedented speed. This will pose a serious threat to the security of widely used public-key cryptosystems in the near future. Scientists are actively looking for ways to protect against quantum attacks; however, existing solutions still face different limitations in terms of efficiency and practicality. This paper explores hash-based digital signature schemes, post-quantum vector commitments and Verkle tree-based approaches for protecting against quantum attacks. The paper proposes an improved approach to generating digital signatures based on Verkle trees using lattice based vector commitments. In order to further reduce the memory space, the paper offers the methodology of integrating a post-quantum secure pseudo-random number generator into the scheme. Finally, the paper proposes an efficient post-quantum digital signature scheme based on Verkle trees, which minimizes memory requirements and reduces the signature size. Our proposed framework has strong resistance to quantum attacks, as well as high speed and efficiency. This study is an important contribution to the elaboration of post-quantum cryptosystems, which lays the foundation for developing secure and practical digital signature systems in the face of emerging quantum threats.
Keywords: post-quantum cryptography; security; memory optimization; cryptographic applications; Merkle tree hash; Verkle tree; vector commitment schemes; lattices post-quantum cryptography; security; memory optimization; cryptographic applications; Merkle tree hash; Verkle tree; vector commitment schemes; lattices

Share and Cite

MDPI and ACS Style

Iavich, M.; Kapalova, N. Optimizing Post-Quantum Digital Signatures with Verkle Trees and Quantum Seed-Based Pseudo-Random Generators. Computers 2025, 14, 103. https://doi.org/10.3390/computers14030103

AMA Style

Iavich M, Kapalova N. Optimizing Post-Quantum Digital Signatures with Verkle Trees and Quantum Seed-Based Pseudo-Random Generators. Computers. 2025; 14(3):103. https://doi.org/10.3390/computers14030103

Chicago/Turabian Style

Iavich, Maksim, and Nursulu Kapalova. 2025. "Optimizing Post-Quantum Digital Signatures with Verkle Trees and Quantum Seed-Based Pseudo-Random Generators" Computers 14, no. 3: 103. https://doi.org/10.3390/computers14030103

APA Style

Iavich, M., & Kapalova, N. (2025). Optimizing Post-Quantum Digital Signatures with Verkle Trees and Quantum Seed-Based Pseudo-Random Generators. Computers, 14(3), 103. https://doi.org/10.3390/computers14030103

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop