ntvНаучно-технический вестник информационных технологий, механики и оптикиScientific and Technical Journal of Information Technologies, Mechanics and Optics2226-14942500-0373Университет ИТМО10.17586/2226-1494-2025-25-1-174-177ntv-433Research ArticleКРАТКИЕ СООБЩЕНИЯBRIEF PAPERSWaveVRF: постквантовая проверяемая псевдослучайная функция, основанная на кодах, исправляющих ошибкиWaveVRF: post-quantum verifiable random function based on error-correcting codeshttps://orcid.org/0000-0002-4084-8829ДакуоЖ.-М. Н.DakuoZh-M. N.

Дакуо Жан-Мишель Никодэмович — аспирант; ассистент; криптограф-исследователь

Санкт-Петербург, 197101

Санкт-Петербург, 190000

Москва, 121205

Zhan-Mishel N. Dakuo — PhD Student; Assistant; Сryptographer Researcher

Saint Petersburg, 197101

Saint Petersburg, 190000

Moscow, 121205

jeandakuo@mail.ruУниверситет ИТМО; Санкт-Петербургский государственный университет аэрокосмического приборостроения; КуАппРоссияITMO University; Saint Petersburg State University of Aerospace Instrumentation; QAppRussian Federation202528022025251174177Copyright © Дакуо Ж.Н., 20252025Дакуо Ж.Н.Dakuo Z.N.Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://ntv.elpub.ru/jour/article/view/433

Предложена новая проверяемая псевдослучайная функция (Verifiable Random Function, VRF), основанная на задаче синдромного декодирования и подписи Wave, устойчивая к атакам квантового компьютера. Разработанная новая схема VRF демонстрирует возможность применения задачи синдромного декодирования для реализации криптографически стойких решений. Представлено описание ключевых алгоритмов VRF (KeyGen, VRFEval, VRFVerify). Показаны основные свойства функции: полная доказуемость, уникальная доказуемость и псевдослучайность.

This paper introduces a novel Verifiable Random Function (VRF) based on the syndrome decoding problem and Wave signature, resistant to quantum computer attacks. The primary goal of this work is to present a new VRF scheme that demonstrates the applicability of the syndrome decoding problem for constructing cryptographically robust solutions. The paper describes the core VRF algorithms (KeyGen, VRFEval, VRFVerify) and highlights its essential properties: provability, uniqueness, and pseudo-randomness.

VRFкриптографияWavePRGпроблема синдромного декодированияVRFcryptographyWavePRGsyndrome decoding problemРабота выполнена в рамках государственного задания (проект FSER-2025-0003).The work was carried out within the framework of the state assignment (project FSER-2025-0003).ReferencesKiayias A., Russell A., David B., Oliynykov R. Ouroboros: A provably secure proof-of-stake blockchain protocol // Lecture Notes in Computer Science. 2017. V. 10401. P. 357–388. https://doi.org/10.1007/978-3-319-63688-7_12Kiayias A., Russell A., David B., Oliynykov R. Ouroboros: A provably secure proof-of-stake blockchain protocol // Lecture Notes in Computer Science. 2017. V. 10401. P. 357–388. https://doi.org/10.1007/978-3-319-63688-7_12Chagas V., Da-Costa G. WhatsApp and transparency: an analysis on the effects of digital platforms´ opacity in political communication research agendas in Brazil // Profesional de la información. 2023. V. 32. N 2. P. e320223. https://doi.org/10.3145/epi.2023.mar.23Chagas V., Da-Costa G. WhatsApp and transparency: an analysis on the effects of digital platforms´ opacity in political communication research agendas in Brazil // Profesional de la información. 2023. V. 32. N 2. P. e320223. https://doi.org/10.3145/epi.2023.mar.23Micali S., Rabin M., Vadhan S. Verifiable random functions // Proc. of the 40th Annual Symposium on Foundations of Computer Science (cat. No. 99CB37039). 1999. P. 1–11. https://doi.org/10.1109/SFFCS.1999.814584Micali S., Rabin M., Vadhan S. Verifiable random functions // Proc. of the 40th Annual Symposium on Foundations of Computer Science (cat. No. 99CB37039). 1999. P. 1–11. https://doi.org/10.1109/SFFCS.1999.814584Dodis Y., Yampolskiy A. A verifiable random function with short proofs and keys // Lecture Notes in Computer Science. 2005. V. 3386. P. 416–431. https://doi.org/10.1007/978-3-540-30580-4_28Dodis Y., Yampolskiy A. A verifiable random function with short proofs and keys // Lecture Notes in Computer Science. 2005. V. 3386. P. 416–431. https://doi.org/10.1007/978-3-540-30580-4_28Esgin M.F., Steinfeld R., Liu D., Ruj S. Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs // Lecture Notes in Computer Science. 2023. V. 14085. P. 484–517. https://doi.org/10.1007/978-3-031-38554-4_16Esgin M.F., Steinfeld R., Liu D., Ruj S. Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs // Lecture Notes in Computer Science. 2023. V. 14085. P. 484–517. https://doi.org/10.1007/978-3-031-38554-4_16Leroux A. Verifiable random function from the Deuring correspondence and higher dimensional isogenies: Preprint // HAL science ouverte. 2023. https://hal.science/hal-04389904v1Leroux A. Verifiable random function from the Deuring correspondence and higher dimensional isogenies: Preprint // HAL science ouverte. 2023. https://hal.science/hal-04389904v1Esgin M.F., Ersoy O., Kuchta V., Loss J., Sakzad A., Steinfeld R., Yang X., Zhao R.K., A new look at blockchain leader election: Simple, efficient, sustainable and post-quantum // Proc. of the ACM Asia Conference on Computer and Communications Security. 2023. P. 623–637. https://doi.org/10.1145/3579856.3595792Esgin M.F., Ersoy O., Kuchta V., Loss J., Sakzad A., Steinfeld R., Yang X., Zhao R.K., A new look at blockchain leader election: Simple, efficient, sustainable and post-quantum // Proc. of the ACM Asia Conference on Computer and Communications Security. 2023. P. 623–637. https://doi.org/10.1145/3579856.3595792Gasparovic R.F., Apel J.R., Kasischke E.S. An overview of the SAR internal wave signature experiment // Journal of Geophysical Research: Oceans. 1988. V. 93. N C10. P. 12304–12316. https://doi.org/10.1029/jc093ic10p12304Gasparovic R.F., Apel J.R., Kasischke E.S. An overview of the SAR internal wave signature experiment // Journal of Geophysical Research: Oceans. 1988. V. 93. N C10. P. 12304–12316. https://doi.org/10.1029/jc093ic10p12304Thomas Debris-Alazard. Post-Quantum Cryptography - Codes; Lecture 2: Random Codes [Электронный ресурс] URL: https:// tdalazard.io/lecture2.pdf (дата обращения: 28.10.2024).Thomas Debris-Alazard. Post-Quantum Cryptography - Codes; Lecture 2: Random Codes [Электронный ресурс] URL: https:// tdalazard.io/lecture2.pdf (дата обращения: 28.10.2024).Fischer J.B., Stern J. An efficient pseudo-random generator provably as secure as syndrome decoding // Lecture Notes in Computer Science. 1996. V. 1070. P. 245–255. https://doi.org/10.1007/3-540-68339-9_22Fischer J.B., Stern J. An efficient pseudo-random generator provably as secure as syndrome decoding // Lecture Notes in Computer Science. 1996. V. 1070. P. 245–255. https://doi.org/10.1007/3-540-68339-9_22Kuznetsov A., Kiian A., Smirnov O., Cherep A., Kanabekova M., Chepurko I. Testing of code-based pseudorandom number generators for post-quantum application // Proc. of the 2020 IEEE 11th International conference on dependable systems, services and technologies (DESSERT). 2020. P. 172–177. https://doi.org/10.1109/dessert50317.2020.9125045Kuznetsov A., Kiian A., Smirnov O., Cherep A., Kanabekova M., Chepurko I. Testing of code-based pseudorandom number generators for post-quantum application // Proc. of the 2020 IEEE 11th International conference on dependable systems, services and technologies (DESSERT). 2020. P. 172–177. https://doi.org/10.1109/dessert50317.2020.9125045

The authors declare that there are no conflicts of interest present.