<?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)-19</article-id><article-id custom-type="elpub" pub-id-type="custom">kaz44-2790</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>МАТЕМАТИЧЕСКАЯ МОДЕЛЬ И ВЫЧИСЛИТЕЛЬНЫЙ АНАЛИЗ ОБЛЕГЧЕННОЙ ПОДПИСИ НА РЕШЕТКАХ ДЛЯ УСТРОЙСТВ IOT</article-title><trans-title-group xml:lang="en"><trans-title>MATHEMATICAL MODEL AND COMPUTATIONAL ANALYSIS OF A LIGHTWEIGHT LATTICEBASED SIGNATURE FOR IOT DEVICES</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-5762-8400</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>Kerimbayeva</surname><given-names>A. T.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Айгерим Танирбергеновна Керимбаева – магистр, кафедра кибербезопасности</p><p>050000 Республика Казахстан, г. Алматы, ул. Сатпаева, 22</p></bio><bio xml:lang="en"><p>Aygerim Kerimbayeva – Master of Science, Department of Cybersecurity</p><p>050000, Republic of Kazakhstan, Almaty, 22 Satbayev St. </p></bio><email xlink:type="simple">aygerim744@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Казахский национальный исследовательский технический университет имени К.И. Сатбаева</institution><country>Казахстан</country></aff><aff xml:lang="en"><institution>Satbayev University</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>189</fpage><lpage>195</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">Kerimbayeva A.T.</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/2790">https://tech.vestnik.shakarim.kz/jour/article/view/2790</self-uri><abstract><p>В данной статье представлены математическая модель и оценка производительности легковесной пост-квантовой схемы подписи FALCON-M, предназначенной для устройств интернета вещей (IoT). Актуальность обусловлена необходимостью защиты IoT-устройств от квантовых атак, в то время как существующие стандарты (Falcon, Dilithium) непригодны для ресурсно-ограниченных сред из-за использования rejection sampling и операций с плавающей точкой. Исследование направлено на преодоление разрыва между теоретической пост-квантовой криптографией и практическим развёртыванием на встраиваемых платформах. Предлагаемая схема основана на решёточной подписи, определённой над кольцом 𝑅𝑞 = ℤ𝑞[𝑥]/(𝑥𝑛 + 1) с параметрами 𝑛 = 512, 𝑞 = 12289, 𝜎 = 4.0, 𝜏 = 60. Ключевая особенность – полное отсутствие rejection sampling, что гарантирует детерминированное время выполнения и устойчивость к атакам по времени выполнения.Результаты показывают компактные размеры: открытый ключ 928 байт, закрытый ключ 256 байт, подпись 973 байта. Оценочное время подписи для ARM Cortex-M4 на частоте 100 МГц составляет 7.4 мс, что конкурентоспособно с существующими пост-квантовыми схемами и превосходит их по устойчивости к атакам по побочным каналам. Научный вклад заключается в разработке математически обоснованной модели, свободной от недостатков существующих схем; практическая значимость состоит в демонстрации пригодности схемы для широкого круга IoT-устройств, включая интеллектуальные датчики, медицинские импланты и промышленные контроллеры.</p></abstract><trans-abstract xml:lang="en"><p>This paper details a mathematical model and a performance evaluation of FALCON-M, a novel, lightweight post-quantum signature scheme specifically engineered for Internet of Things (IoT) applications. The importance of this contribution is underscored by the imperative to secure IoT devices from future quantum attacks, a challenge not adequately met by existing standards like Falcon and Dilithium, which are too demanding for resource-constrained settings owing to their use of rejection sampling and floating-point computations. Our study seeks to close the gap between theoretical post-quantum cryptographic solutions and their feasible integration into embedded systems.The proposed scheme is based on a lattice-based signature defined over the ring 𝑅𝑞 = ℤ𝑞[𝑥]/(𝑥𝑛 + 1) with parameters 𝑛 = 512, 𝑞 = 12289, 𝜎 = 4.0, 𝜏 = 60. A key feature is the complete absence of rejection sampling, which guarantees deterministic execution time and inherent resistance to timing side-channel attacks.Analysis reveals that the scheme achieves notably small key sizes: the public key is 928 bytes, the secret key is 256 bytes, and the signature is 973 bytes. Projections for performance on an ARM Cortex-M4 processor operating at 100 MHz indicate a signing duration of 7.4 ms. This speed is comparable to established post-quantum cryptography methods, yet it provides superior resilience against side-channel vulnerabilities.The primary scientific advancement is the creation of a mathematically rigorous model that avoids the shortcomings of existing approaches. Its practical importance is demonstrated by its applicability to a broad spectrum of Internet of Things devices, including intelligent sensors, implanted medical devices, and industrial control systems.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>постквантовая криптография</kwd><kwd>цифровая подпись</kwd><kwd>интернет вещей</kwd><kwd>решетки</kwd><kwd>FALCON</kwd></kwd-group><kwd-group xml:lang="en"><kwd>post quantum cryptography</kwd><kwd>digital signature</kwd><kwd>Internet of Things</kwd><kwd>lattices</kwd><kwd>FALCON</kwd></kwd-group><funding-group><funding-statement xml:lang="en">The authors express their gratitude to the Vice-Rector for Science and Corporate Development of Satbayev University, Yerzhan Kuldeyev, for the support in securing the funding for this research.</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">Atzori L. The Internet of Things: A Survey / L. Atzori, A. Iera, G. Morabito // Computer Networks. – 2010. – Vol. 54, № 15. – P. 2787-2805. https://doi.org/10.1016/j.comnet.2010.05.010.</mixed-citation><mixed-citation xml:lang="en">Atzori L. The Internet of Things: A Survey / L. Atzori, A. Iera, G. Morabito // Computer Networks. – 2010. – Vol. 54, № 15. – P. 2787-2805. https://doi.org/10.1016/j.comnet.2010.05.010.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Shor P.W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer / P.W. Shor // SIAM Journal on Computing. – 1997. – Vol. 26, № 5. – P. 1484-1509. https://doi.org/10.1137/S0097539795293172.</mixed-citation><mixed-citation xml:lang="en">Shor P.W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer / P.W. Shor // SIAM Journal on Computing. – 1997. – Vol. 26, № 5. – P. 1484-1509. https://doi.org/10.1137/S0097539795293172.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">National Institute of Standards and Technology. FIPS 204: Module-Lattice-Based Digital Signature Standard (ML-DSA) [Electronic resource]. – Gaithersburg: NIST, 2024. https://doi.org/10.6028/NIST.FIPS.204 (accessed: 11.03.2026).</mixed-citation><mixed-citation xml:lang="en">National Institute of Standards and Technology. FIPS 204: Module-Lattice-Based Digital Signature Standard (ML-DSA) [Electronic resource]. – Gaithersburg: NIST, 2024. https://doi.org/10.6028/NIST.FIPS.204 (accessed: 11.03.2026).</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">National Institute of Standards and Technology. FIPS 206: NTRU-Based Digital Signature Standard (FN-DSA) (Draft) [Electronic resource]. – Gaithersburg: NIST, 2024.</mixed-citation><mixed-citation xml:lang="en">National Institute of Standards and Technology. FIPS 206: NTRU-Based Digital Signature Standard (FN-DSA) (Draft) [Electronic resource]. – Gaithersburg: NIST, 2024.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Lyubashevsky V. Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures / V. Lyubashevsky // Advances in Cryptology – ASIACRYPT 2009: Proc. Intern. Conf. – Berlin: Springer, 2009. – P. 598-616. https://doi.org/10.1007/978-3-642-10366-7_35.</mixed-citation><mixed-citation xml:lang="en">Lyubashevsky V. Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures / V. Lyubashevsky // Advances in Cryptology – ASIACRYPT 2009: Proc. Intern. Conf. – Berlin: Springer, 2009. – P. 598-616. https://doi.org/10.1007/978-3-642-10366-7_35.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">CRYSTALS-Dilithium: Digital Signatures from Module Lattices / L. Ducas et al // IACR Transactions on Cryptographic Hardware and Embedded Systems. – 2018. – Vol. 2018, № 1. – P. 238-268. https://doi.org/10.13154/tches.v2018.i1.238-268.</mixed-citation><mixed-citation xml:lang="en">CRYSTALS-Dilithium: Digital Signatures from Module Lattices / L. Ducas et al // IACR Transactions on Cryptographic Hardware and Embedded Systems. – 2018. – Vol. 2018, № 1. – P. 238-268. https://doi.org/10.13154/tches.v2018.i1.238-268.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">FALCON / T. Prest et al. – Gaithersburg: NIST, 2020. – Technical Report.</mixed-citation><mixed-citation xml:lang="en">FALCON / T. Prest et al. – Gaithersburg: NIST, 2020. – Technical Report.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Oder T. Implementing the Candidate FALCON Signature Scheme on Embedded Devices / T. Oder, T. Güneysu // 2019 IEEE International Symposium on Hardware Oriented Security and Trust (HOST): Proc. Intern. Conf. – Piscataway: IEEE, 2019. – P. 272-281.</mixed-citation><mixed-citation xml:lang="en">Oder T. Implementing the Candidate FALCON Signature Scheme on Embedded Devices / T. Oder, T. Güneysu // 2019 IEEE International Symposium on Hardware Oriented Security and Trust (HOST): Proc. Intern. Conf. – Piscataway: IEEE, 2019. – P. 272-281.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Lyubashevsky V. On Ideal Lattices and Learning with Errors over Rings / V. Lyubashevsky, C. Peikert, O. Regev // Journal of the ACM. – 2013. – Vol. 60, № 6. – P. 1-35. https://doi.org/10.1145/2535925.</mixed-citation><mixed-citation xml:lang="en">Lyubashevsky V. On Ideal Lattices and Learning with Errors over Rings / V. Lyubashevsky, C. Peikert, O. Regev // Journal of the ACM. – 2013. – Vol. 60, № 6. – P. 1-35. https://doi.org/10.1145/2535925.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">The SPHINCS+ Signature Framework / D.J. Bernstein et al // Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (CCS '19): Proc. Intern. Conf. – New York: ACM, 2019. – P. 2129-2146. https://doi.org/10.1145/3319535.3363229.</mixed-citation><mixed-citation xml:lang="en">The SPHINCS+ Signature Framework / D.J. Bernstein et al // Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (CCS '19): Proc. Intern. Conf. – New York: ACM, 2019. – P. 2129-2146. https://doi.org/10.1145/3319535.3363229.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Micciancio D. Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller / D. Micciancio, C. Peikert // Advances in Cryptology – EUROCRYPT 2012: Proc. Intern. Conf. – Berlin: Springer, 2012. – P. 700-718. https://doi.org/10.1007/978-3-642-29011-4_41.</mixed-citation><mixed-citation xml:lang="en">Micciancio D. Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller / D. Micciancio, C. Peikert // Advances in Cryptology – EUROCRYPT 2012: Proc. Intern. Conf. – Berlin: Springer, 2012. – P. 700-718. https://doi.org/10.1007/978-3-642-29011-4_41.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Longa P. Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography / P. Longa, M. Naehrig // Cryptology and Network Security – CANS 2016: Proc. Intern. Conf. – Cham: Springer, 2016. – P. 124-139. https://doi.org/10.1007/978-3-319-48965-0_8.</mixed-citation><mixed-citation xml:lang="en">Longa P. Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography / P. Longa, M. Naehrig // Cryptology and Network Security – CANS 2016: Proc. Intern. Conf. – Cham: Springer, 2016. – P. 124-139. https://doi.org/10.1007/978-3-319-48965-0_8.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Testing and Benchmarking NIST PQC on ARM Cortex-M4 / M.J. Kannwischer et al // IACR Cryptology ePrint Archive. – 2019. – № 844. https://api.semanticscholar.org/CorpusID:201059112.</mixed-citation><mixed-citation xml:lang="en">Testing and Benchmarking NIST PQC on ARM Cortex-M4 / M.J. Kannwischer et al // IACR Cryptology ePrint Archive. – 2019. – № 844. https://api.semanticscholar.org/CorpusID:201059112.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">ARM Ltd. ARM Cortex-M4 Processor Technical Reference Manual. – Cambridge: ARM, 2020.</mixed-citation><mixed-citation xml:lang="en">ARM Ltd. ARM Cortex-M4 Processor Technical Reference Manual. – Cambridge: ARM, 2020.</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>
