Kunbolat T. Algazy1, Kairat S. Sakan1,2,*, Saule E. Nyssanbayeva1,2, Ardabek Khompysh1,3
CMC-Computers, Materials & Continua, Vol.84, No.1, pp. 1581-1595, 2025, DOI:10.32604/cmc.2025.065085
- 09 June 2025
Abstract 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… More >