MATHEMATICAL MODEL AND COMPUTATIONAL ANALYSIS OF A LIGHTWEIGHT LATTICEBASED SIGNATURE FOR IOT DEVICES
https://doi.org/10.53360/2788-7995-2026-3(23)-19
Abstract
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.
About the Author
A. T. KerimbayevaKazakhstan
Aygerim Kerimbayeva – Master of Science, Department of Cybersecurity
050000, Republic of Kazakhstan, Almaty, 22 Satbayev St.
References
1. 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.
2. 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.
3. 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).
4. National Institute of Standards and Technology. FIPS 206: NTRU-Based Digital Signature Standard (FN-DSA) (Draft) [Electronic resource]. – Gaithersburg: NIST, 2024.
5. 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.
6. 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.
7. FALCON / T. Prest et al. – Gaithersburg: NIST, 2020. – Technical Report.
8. 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.
9. 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.
10. 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.
11. 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.
12. 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.
13. 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.
14. ARM Ltd. ARM Cortex-M4 Processor Technical Reference Manual. – Cambridge: ARM, 2020.
Review
For citations:
Kerimbayeva A.T. MATHEMATICAL MODEL AND COMPUTATIONAL ANALYSIS OF A LIGHTWEIGHT LATTICEBASED SIGNATURE FOR IOT DEVICES. Bulletin of Shakarim University. Technical Sciences. 2026;(3(23)):189-195. https://doi.org/10.53360/2788-7995-2026-3(23)-19
JATS XML















