EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Efficient Serial Systolic Polynomial Multiplier for Lattice-Based Post-Quantum Cryptographic Schemes in IoT Edge Node

Atef Ibrahim, Fayez Gebali

Network · 01.04.2026 · 6 (2) · 21

DOI: 10.3390/network6020021 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Network, online erschienen am 01.04.2026. Verfasst von Atef Ibrahim und 1 weiteren Autor:innen. Die Arbeit nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Prince Sattam bin Abdulaziz University.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The rapid development of the Internet of Things (IoT) is transforming various economic and industrial sectors by embedding interconnected devices within their operational processes. However, security and privacy risks associated with these interconnected devices pose significant barriers to widespread adoption, particularly in light of potential quantum threats. To mitigate these challenges, it is imperative to employ post-quantum cryptographic schemes. However, essential constraints on IoT edge nodes complicate the effective implementation of such schemes. Among the most promising approaches in post-quantum cryptography are lattice-based schemes, which rely heavily on polynomial multiplication operations at their core. Improving the implementation of polynomial multiplication will significantly enhance the performance of these schemes. Therefore, this paper proposes an efficent low-complexity serial systolic array optimized for polynomial multiplication, particularly tailored for the Binary Ring Learning With Errors (BRLWE) scheme. Designed for cryptographic processors targeting capable IoT edge nodes, the proposed architecture demonstrates remarkable performance improvements, achieving a maximum operating frequency of 280 MHz for a field size of 256, while requiring only 8232 lookup tables (LUTs) and 2616 flip-flops (FFs). These results reflect a 16.8% reduction in LUT usage and a 19% reduction in FFs compared to the nearest competing designs, all while maintaining high throughput and low area utilization. This work significantly advances the establishment of secure and efficient infrastructure for IoT systems, bolstering their resilience against post-quantum attacks and supporting the growth of a robust digital economy. Furthermore, it aligns with sustainable development goals 8 and 9 by fostering trust and facilitating the adoption of cutting-edge IoT technologies, ultimately promoting more resilient and innovative economic activities.

Förderung

  • Prince Sattam bin Abdulaziz University

Zitieren

APA

Ibrahim, A., & Gebali, F. (2026). Efficient Serial Systolic Polynomial Multiplier for Lattice-Based Post-Quantum Cryptographic Schemes in IoT Edge Node. Network, 6(2), 21. https://doi.org/10.3390/network6020021

Vancouver

Ibrahim A, Gebali F. Efficient Serial Systolic Polynomial Multiplier for Lattice-Based Post-Quantum Cryptographic Schemes in IoT Edge Node. Network. 2026;6(2):21. doi:10.3390/network6020021

BibTeX
@article{Ibrahim2026,
  author = {Ibrahim, Atef and Gebali, Fayez},
  title = {Efficient Serial Systolic Polynomial Multiplier for Lattice-Based Post-Quantum Cryptographic Schemes in IoT Edge Node},
  journal = {Network},
  year = {2026},
  volume = {6},
  number = {2},
  pages = {21},
  doi = {10.3390/network6020021}
}
Kostenlos starten →