<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">kaz44</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник Университета Шакарима. Серия технические науки</journal-title><trans-title-group xml:lang="en"><trans-title>Bulletin of Shakarim University. Technical Sciences</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2788-7995</issn><issn pub-type="epub">3006-0524</issn><publisher><publisher-name>«Шәкәрім университеті» КеАҚ</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.53360/2788-7995-2026-3(23)-7</article-id><article-id custom-type="elpub" pub-id-type="custom">kaz44-2834</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>АВТОМАТИЗАЦИЯ И ИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ (ОРИГИНАЛЬНАЯ СТАТЬЯ)</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>AUTOMATION AND INFORMATION TECHNOLOGY (ORIGINAL ARTICLE)</subject></subj-group></article-categories><title-group><article-title>РЕАЛИЗАЦИЯ И СРАВНИТЕЛЬНЫЙ АНАЛИЗ СХЕМ ЦИФРОВОЙ ПОДПИСИ НА ОСНОВЕ SPHINCS+</article-title><trans-title-group xml:lang="en"><trans-title>IMPLEMENTATION AND COMPARATIVE ANALYSIS OF SPHINCS+-BASED DIGITAL SIGNATURE SCHEMES</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-5172-8339</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Сейткулов</surname><given-names>Е.</given-names></name><name name-style="western" xml:lang="en"><surname>Seitkulov</surname><given-names>Ye.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Ержан Сейткулов – PhD</p><p>010008, Республика Казахстан, Астана</p></bio><bio xml:lang="en"><p>Yerzhan Seitkulov – PhD</p><p>010008, Republic of Kazakhstan, Astana</p></bio><email xlink:type="simple">yerzhan.seitkulov@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-0771-575X</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Оспанов</surname><given-names>Р.</given-names></name><name name-style="western" xml:lang="en"><surname>Ospanov</surname><given-names>R.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Руслан Оспанов – научный сотрудник </p><p>010008, Республика Казахстан, Астана</p></bio><bio xml:lang="en"><p>Ruslan Ospanov – Researcher, Gumilyov Eurasian National University, Republic of Kazakhstan; email: </p><p>010008, Republic of Kazakhstan, Astana</p></bio><email xlink:type="simple">ospanovrm@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-1252-857X</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Ергалиева</surname><given-names>Б.</given-names></name><name name-style="western" xml:lang="en"><surname>Yergaliyeva</surname><given-names>B.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Бану Ергалиева – научный сотрудник</p><p>010008, Республика Казахстан, Астана</p></bio><bio xml:lang="en"><p>Banu Yergaliyeva – Researcher</p><p>010008, Republic of Kazakhstan, Astana</p></bio><email xlink:type="simple">banu.yergalieva@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0004-3032-5049</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Утебаев</surname><given-names>К.</given-names></name><name name-style="western" xml:lang="en"><surname>Utebayev</surname><given-names>K.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Куат Утебаев – магистрант</p><p>050040, Республика Казахстан, Казахстан</p></bio><bio xml:lang="en"><p>Kuat Utebayev – Master student, Almaty Branch, National Research Nuclear University MEPhi,Almaty 050040, Kazakhstan; e-mail: </p><p>050040, Republic of Kazakhstan, Almaty </p></bio><email xlink:type="simple">utebayevkuat@gmail.com</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Евразийский национальный университет им. Л.Н. Гумилева</institution><country>Казахстан</country></aff><aff xml:lang="en"><institution>L.N.Gumilyov Eurasian National University</institution><country>Kazakhstan</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Алматинский филиал Национального исследовательского ядерного университета МИФИ</institution><country>Казахстан</country></aff><aff xml:lang="en"><institution>Almaty branch of the National Research Nuclear University MEPhI</institution><country>Kazakhstan</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2026</year></pub-date><pub-date pub-type="epub"><day>20</day><month>11</month><year>2026</year></pub-date><volume>0</volume><issue>3(23)</issue><fpage>62</fpage><lpage>73</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Сейткулов Е., Оспанов Р., Ергалиева Б., Утебаев К., 2026</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="ru">Сейткулов Е., Оспанов Р., Ергалиева Б., Утебаев К.</copyright-holder><copyright-holder xml:lang="en">Seitkulov Y., Ospanov R., Yergaliyeva B., Utebayev K.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://tech.vestnik.shakarim.kz/jour/article/view/2834">https://tech.vestnik.shakarim.kz/jour/article/view/2834</self-uri><abstract><p>В постквантовой криптографии рассматриваются вопросы создания алгоритмов, способных устойчивость к угрозам со стороны квантовых компьютеров, что предполагает применение новых подходов к построению их внутренней архитектуры. Значительное внимание в этой области уделяется цифровым подписям, поскольку они обеспечивают подтверждение подлинности и сохранность данных в цифровой среде. Одним из наиболее перспективных направлений считаются схемы цифровой подписи, основанные на хешировании. Они отличаются высокой эффективностью и обладают доказанной криптографической стойкостью, благодаря чему относятся к числу ключевых постквантовых решений для электронной подписи. В данной работе проведено сравнение основных компонентов, размеров закрытых ключей, открытых ключей и подписей (в байтах) для некоторых вариантов схем на основе SPHINCS и SPHINCS+, включая схему TANBA-SPHINCS+, новый вариант SPHINCS+. В этой схеме применяется криптографическая хеш-функция на основе модифицированной схемы Sponge с несколькими внутренними функциями. Предложенный подход расширяет классическую архитектуру SPHINCS+ и позволяет гибко настраивать внутренние преобразования. Такая конструкция повышает структурное разнообразие алгоритма и может способствовать повышению устойчивости к определенным типам криптоаналитических атак. Для проведения вычислительных экспериментов была написана программная реализация. В статье представлены сравнительные экспериментальные результаты по производительности.</p></abstract><trans-abstract xml:lang="en"><p>In post-quantum cryptography, the focus is on the design of algorithms capable of withstanding threats posed by quantum computers, which requires the adoption of new approaches to constructing their internal architecture. Significant attention in this field is devoted to digital signatures, as they provide authentication and integrity protection for data in digital environments. One of the most promising directions is considered to be hash-based digital signature schemes. They are characterized by high efficiency and proven cryptographic security, which makes them one of the key post-quantum solutions for electronic signatures. This paper presents a comparison of the main components, as well as the sizes of private keys, public keys, and signatures (in bytes), for several SPHINCS and SPHINCS+-based schemes, including the TANBA-SPHINCS+ scheme, a new variant of SPHINCS+. This scheme employs a cryptographic hash function based on a modified Sponge construction with multiple internal functions. The proposed approach extends the classical SPHINCS+ architecture and allows flexible configuration of internal transformations. Such a design increases the structural diversity of the algorithm and may contribute to improved resistance against certain types of cryptanalytic attacks. For experimental evaluation, a software implementation was developed. The paper also presents comparative experimental performance results.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>криптографический алгоритм</kwd><kwd>цифровая подпись</kwd><kwd>криптографическая хешфункция</kwd><kwd>постквантовая криптография</kwd><kwd>информационная безопасность</kwd></kwd-group><kwd-group xml:lang="en"><kwd>cryptographic algorithm</kwd><kwd>digital signature</kwd><kwd>cryptographic hash function</kwd><kwd>post-quantum cryptography</kwd><kwd>information security</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">This research was funded by Ministry of Science and Higher Education of the Republic of Kazakhstan, grant number AP23486901.</funding-statement><funding-statement xml:lang="en">This research was funded by Ministry of Science and Higher Education of the Republic of Kazakhstan, grant number AP23486901.</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">The SPHINCS+ Signature Framework. In Proceedings of the 2019 ACM SIGSAC Conference / D.J. Bernstein et al. – New York, NY, USA, Р. 2129-2146. https://doi.org/10.1145/3319535.3363229.</mixed-citation><mixed-citation xml:lang="en">The SPHINCS+ Signature Framework. In Proceedings of the 2019 ACM SIGSAC Conference / D.J. Bernstein et al. – New York, NY, USA, Р. 2129-2146. https://doi.org/10.1145/3319535.3363229.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Aumasson, et al. SPHINCS+ - Submission to the NIST post-quantum project, v.3.1. 10 June 2022. https://sphincs.org/data/sphincs+-r3.1-specification.pdf.</mixed-citation><mixed-citation xml:lang="en">Aumasson, et al. SPHINCS+ - Submission to the NIST post-quantum project, v.3.1. 10 June 2022. https://sphincs.org/data/sphincs+-r3.1-specification.pdf.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Sphincs+ post-quantum digital signature scheme with Streebog hash function / E. Kiktenko et al // AIP Conference Proceedings. – 2020. – vol. 2241. – Р. 020014. https://doi.org/10.1063/5.0011441.</mixed-citation><mixed-citation xml:lang="en">Sphincs+ post-quantum digital signature scheme with Streebog hash function / E. Kiktenko et al // AIP Conference Proceedings. – 2020. – vol. 2241. – Р. 020014. https://doi.org/10.1063/5.0011441.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">GOST 34.11-2018. Mezhgosudarstvennyi standart. Informatsionnaya tekhnologiya. Kriptograficheskaya zashchita informatsii. Funktsiya kheshirovaniya. (In Russian).</mixed-citation><mixed-citation xml:lang="en">GOST 34.11-2018. Mezhgosudarstvennyi standart. Informatsionnaya tekhnologiya. Kriptograficheskaya zashchita informatsii. Funktsiya kheshirovaniya. (In Russian).</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">K-XMSS and K-SPHINCS+: Hash based signatures with korean cryptography algorithms / M. Sim et al // Cryptology ePrint Archive, 2022. https://eprint.iacr.org/2022/152.pdf.</mixed-citation><mixed-citation xml:lang="en">K-XMSS and K-SPHINCS+: Hash based signatures with korean cryptography algorithms / M. Sim et al // Cryptology ePrint Archive, 2022. https://eprint.iacr.org/2022/152.pdf.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">K-XMSS and K-SPHINCS+: Enhancing Security in Next-Generation Mobile Communication and Internet Systems with Hash Based Signatures Using Korean Cryptography Algorithms / M. Sim et al // Sensors. – 2023. – № 23(17). – Р. 7558. https://doi.org/10.3390/s23177558.</mixed-citation><mixed-citation xml:lang="en">K-XMSS and K-SPHINCS+: Enhancing Security in Next-Generation Mobile Communication and Internet Systems with Hash Based Signatures Using Korean Cryptography Algorithms / M. Sim et al // Sensors. – 2023. – № 23(17). – Р. 7558. https://doi.org/10.3390/s23177558.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">A cryptographic hash function based on a modified Sponge scheme / R.M. Ospanov et al // Eurasian Journal of Mathematical and Computer Applications. – 2022. – № 10(2). – Р. 55-70. https://doi.org/10.32523/2306-6172-2022-10-2-55-70.</mixed-citation><mixed-citation xml:lang="en">A cryptographic hash function based on a modified Sponge scheme / R.M. Ospanov et al // Eurasian Journal of Mathematical and Computer Applications. – 2022. – № 10(2). – Р. 55-70. https://doi.org/10.32523/2306-6172-2022-10-2-55-70.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">TANBA-SPHINCS+ - post-quantum cryptographic hash-based digital signature algorithm. / R.M. Ospanov et al // Bulletin Abai KazNPU. Series of Physics &amp; Mathematical Sciences. – 2025. – № 1(89). – Р. 235-246. https://doi.org/10.51889/2959-5894.2025.89.1.020. (In Russian).</mixed-citation><mixed-citation xml:lang="en">TANBA-SPHINCS+ - post-quantum cryptographic hash-based digital signature algorithm. / R.M. Ospanov et al // Bulletin Abai KazNPU. Series of Physics &amp; Mathematical Sciences. – 2025. – № 1(89). – Р. 235-246. https://doi.org/10.51889/2959-5894.2025.89.1.020. (In Russian).</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Goldreich O. Foundations of Cryptography: Basic Applications, volume 2. Cambridge University Press, Cambridge, UK, 2004.</mixed-citation><mixed-citation xml:lang="en">Goldreich O. Foundations of Cryptography: Basic Applications, volume 2. Cambridge University Press, Cambridge, UK, 2004.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">SPHINCS: Practical Stateless Hash-based Signatures / D.J. Bernstein et al // In: Osvald, E., Fischlin, M. (eds), Advances in Cryptology, Lecture Notes in Computer Science. – 2015. – vol 9056. – Р. 368-397. https://doi.org/10.1007/978-3-662-46800-5_15.</mixed-citation><mixed-citation xml:lang="en">SPHINCS: Practical Stateless Hash-based Signatures / D.J. Bernstein et al // In: Osvald, E., Fischlin, M. (eds), Advances in Cryptology, Lecture Notes in Computer Science. – 2015. – vol 9056. – Р. 368-397. https://doi.org/10.1007/978-3-662-46800-5_15.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Gueron S. Sphincs-Simpira: Fast Stateless Hash-Based Signatures with Post-Quantum Security / S. Gueron, N. Mouha // Cryptology ePrint Archive. – 2017. – P. 2017/645. https://eprint.iacr.org/2017/645.</mixed-citation><mixed-citation xml:lang="en">Gueron S. Sphincs-Simpira: Fast Stateless Hash-Based Signatures with Post-Quantum Security / S. Gueron, N. Mouha // Cryptology ePrint Archive. – 2017. – P. 2017/645. https://eprint.iacr.org/2017/645.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">A Family of Efficient Permutations Using the AES Round Function / S. Gueron et al // Advances in Cryptology ASIACRYPT. – 2016. – vol. 10031. – Р. 95-125. https://doi.org/10.1007/978-3-662-53887-6_4.</mixed-citation><mixed-citation xml:lang="en">A Family of Efficient Permutations Using the AES Round Function / S. Gueron et al // Advances in Cryptology ASIACRYPT. – 2016. – vol. 10031. – Р. 95-125. https://doi.org/10.1007/978-3-662-53887-6_4.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Kölbl S. Putting Wings on SPHINCS / S. Kölbl // Cryptology ePrint Archive. – 2017. – P. 2017/898. https://eprint.iacr.org/2017/898.</mixed-citation><mixed-citation xml:lang="en">Kölbl S. Putting Wings on SPHINCS / S. Kölbl // Cryptology ePrint Archive. – 2017. – P. 2017/898. https://eprint.iacr.org/ 2017/898.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Aumasson J.-P. Improving stateless hash-based signatures / J.-P. Aumasson, G. Endignoux // In: Smart, N. (eds) Topics in Cryptology – CT-RSA. – 2018. – vol 10808. – Р. 219-242. https://doi.org/10.1007/978-3-319-76953-0_12.</mixed-citation><mixed-citation xml:lang="en">Aumasson J.-P. Improving stateless hash-based signatures / J.-P. Aumasson, G. Endignoux // In: Smart, N. (eds) Topics in Cryptology – CT-RSA. – 2018. – vol 10808. – Р. 219-242. https://doi.org/10.1007/978-3-319-76953-0_12.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Zhang K. Sphincs-α: A compact stateless hash-based signature scheme / K. Zhang, H. Cui, Y. Yu // Cryptology ePrint Archive. – 2022. – P. 2022/059. https://eprint.iacr.org/2022/059.</mixed-citation><mixed-citation xml:lang="en">Zhang K. Sphincs-α: A compact stateless hash-based signature scheme / K. Zhang, H. Cui, Y. Yu // Cryptology ePrint Archive. – 2022. – P. 2022/059. https://eprint.iacr.org/2022/059.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">SPHINCS+C: Compressing SPHINCS+ with (Almost) No Cost / A. Hulsing et al // In: Proceedings of the 2023 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA, 22-24 May 2023, Р. 1435-1453. https://doi.org/10.1109/SP46215.2023.10179381.</mixed-citation><mixed-citation xml:lang="en">SPHINCS+C: Compressing SPHINCS+ with (Almost) No Cost / A. Hulsing et al // In: Proceedings of the 2023 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA, 22-24 May 2023, Р. 1435-1453. https://doi.org/10.1109/SP46215.2023.10179381.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Grebnev S. Hypericum – a quantum-resistant digital signature project for standardization in Russia, RusCrypto 2023. Available online: https://ruscrypto.ru/resource/archive/rc2023/files/02_grebnev.pdf. (In Russian).</mixed-citation><mixed-citation xml:lang="en">Grebnev S. Hypericum – a quantum-resistant digital signature project for standardization in Russia, RusCrypto 2023. Available online: https://ruscrypto.ru/resource/archive/rc2023/files/02_grebnev.pdf. (In Russian).</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Turchenko O. Hypericum: a post-quantum digital signature for standardization in Russia / O. Turchenko, S. Grebnev // J Comput Virol Hack Tech. – 2024. – № 20. – Р. 455-483. https://doi.org/10.1007/s11416-024-00520-6.</mixed-citation><mixed-citation xml:lang="en">Turchenko O. Hypericum: a post-quantum digital signature for standardization in Russia / O. Turchenko, S. Grebnev // J Comput Virol Hack Tech. – 2024. – № 20. – Р. 455-483. https://doi.org/10.1007/s11416-024-00520-6.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Sphinx-in-the-Head: Group Signatures from Symmetric Primitives / L. Chen et al // ACM Trans. Priv. Sec. – 2024. – Vol. 27, Issue 1, Article 11. – Р. 1-35. https://doi.org/10.1145/3638763.</mixed-citation><mixed-citation xml:lang="en">Sphinx-in-the-Head: Group Signatures from Symmetric Primitives / L. Chen et al // ACM Trans. Priv. Sec. – 2024. – Vol. 27, Issue 1, Article 11. – Р. 1-35. https://doi.org/10.1145/3638763.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Abri M. Shorter Hash-Based Signatures Using Forced Pruning / M. Abri, J. Katz // Cryptology ePrint Archive. – 2025. – P. 2025/2069. https://eprint.iacr.org/2025/2069.</mixed-citation><mixed-citation xml:lang="en">Abri M. Shorter Hash-Based Signatures Using Forced Pruning / M. Abri, J. Katz // Cryptology ePrint Archive. – 2025. – P. 2025/2069. https://eprint.iacr.org/2025/2069.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Qin Z. Extending the SPHINCS+ Framework: Varying the Tree Heights and Chain Lengths / Z. Qin, S. Sun // Cryptology ePrint Archive. – 2025. – P. 2025/2236. https://eprint.iacr.org/2025/2236.</mixed-citation><mixed-citation xml:lang="en">Qin Z. Extending the SPHINCS+ Framework: Varying the Tree Heights and Chain Lengths / Z. Qin, S. Sun // Cryptology ePrint Archive. – 2025. – P. 2025/2236. https://eprint.iacr.org/2025/2236.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
