Efficient Lattice-Based Digital Signatures for Embedded IoT Systems

This paper offers a lattice-based digital signature construction, optimized for the provision of post-quantum security in resource-constrained environments, such as Internet of Things (IoT) devices. The offered scheme is built upon structured hardness assumptions, defined over polynomial rings that exhibit inherent algebraic symmetry. By exploiting the cyclic properties of these ring structures and implementing efficient Number Theoretic Transforms (NTTs), the construction achieves compact signatures that are under 3 KB and a runtime feasibility that uses less than 10 KB of RAM. The signature generation process incorporates balanced rejection sampling and carefully designed polynomial encodings that preserve structural regularity and computational efficiency. The security of the offered scheme is proven. The benchmark results generated from using the ARM Cortex-M4 platform demonstrate its practical usability. This study highlights how symmetric algebraic frameworks based on lattice-based cryptography can be leveraged to achieve both theoretical security and real-world performance in the post-quantum era.

Authors

Institutions

Publication Details

Journal
Symmetry
Published
2025-09-12
DOI
https://doi.org/10.3390/sym17091522
Citations
1
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Lattice-Based Digital Signatures for Embedded IoT Systems

Maksim Iavich, Kairat Sakan, Нурсулу Капалова
1 citations
Symmetry
Cryptography and Data Security
2.48
article

Efficient Lattice-Based Digital Signatures for Embedded IoT Systems

Maksim Iavich, Kairat Sakan, Нурсулу Капалова
article en
1 citations

Abstract

This paper offers a lattice-based digital signature construction, optimized for the provision of post-quantum security in resource-constrained environments, such as Internet of Things (IoT) devices. The offered scheme is built upon structured hardness assumptions, defined over polynomial rings that exhibit inherent algebraic symmetry. By exploiting the cyclic properties of these ring structures and implementing efficient Number Theoretic Transforms (NTTs), the construction achieves compact signatures that are under 3 KB and a runtime feasibility that uses less than 10 KB of RAM. The signature generation process incorporates balanced rejection sampling and carefully designed polynomial encodings that preserve structural regularity and computational efficiency. The security of the offered scheme is proven. The benchmark results generated from using the ARM Cortex-M4 platform demonstrate its practical usability. This study highlights how symmetric algebraic frameworks based on lattice-based cryptography can be leveraged to achieve both theoretical security and real-world performance in the post-quantum era.

SymmetryVol. 17(9)
Caucasus University (GE), Institute of Information and Computational Technologies (KZ)
Openalex Percentile: Top 8%
Cryptography and Data Security
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Efficient Lattice-Based Digital Signatures for Embedded IoT Systems — Maksim Iavich, Kairat Sakan, et al. · Symmetry (2025) | TGRS Research Map | TGRS