We are pleased to announce a new scientific publication developed within the framework of the NATO Science for Peace and Security Programme.
The paper, titled “Polynomial Commitment Schemes from Classical Constructions to Post-Quantum Directions”, is authored by Maksim Iavich, Tamari Kuchukhidze, and Razvan Bocu.
Polynomial commitment schemes (PCS) enable efficient and verifiable proofs of polynomial evaluations and are widely used in systems such as zk-SNARKs and Verkle trees. This study compares classical approaches (e.g., KZG, Bulletproofs) with emerging post-quantum alternatives, highlighting a key trade-off between efficiency and quantum resistance. While classical schemes offer compact proofs and high performance, post-quantum designs provide stronger security at the cost of increased computational overhead. The paper also outlines a research roadmap to bridge this gap and advance practical quantum-resistant solutions.
This publication serves as both a technical reference and a strategic guide for developing next-generation cryptographic systems that remain secure in the era of quantum computing.
🔗 Read the full article: https://www.mdpi.com/2410-387X/10/2/27
Cite As:
MDPI and ACS Style
Iavich, M.; Kuchukhidze, T.; Bocu, R. Polynomial Commitment Schemes from Classical Constructions to Post-Quantum Directions. Cryptography 2026, 10, 27. https://doi.org/10.3390/cryptography10020027
AMA Style
Iavich M, Kuchukhidze T, Bocu R. Polynomial Commitment Schemes from Classical Constructions to Post-Quantum Directions. Cryptography. 2026; 10(2):27. https://doi.org/10.3390/cryptography10020027
Chicago/Turabian Style
Iavich, Maksim, Tamari Kuchukhidze, and Razvan Bocu. 2026. “Polynomial Commitment Schemes from Classical Constructions to Post-Quantum Directions” Cryptography 10, no. 2: 27. https://doi.org/10.3390/cryptography10020027
APA Style
Iavich, M., Kuchukhidze, T., & Bocu, R. (2026). Polynomial Commitment Schemes from Classical Constructions to Post-Quantum Directions. Cryptography, 10(2), 27. https://doi.org/10.3390/cryptography10020027
