Next Article in Journal
Mitigating Metamorphic Malware Through Adversarial Learning Techniques
Next Article in Special Issue
A Risk-Gated Security Attention Mechanism for Rare-Threat Detection in Industrial IoT Networks
Previous Article in Journal
Techno-Economic and SLA-Aware Control of 5G Cloud-RAN via Multi-Objective and Penalty-Constrained Reinforcement Learning
Previous Article in Special Issue
Securing IoT Networks Using Machine Learning-Resistant Physical Unclonable Functions (PUFs) on Edge Devices
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

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

1
Computer Engineering Department, College of Computer Engineering and Sciences, Prince Sattam Bin Abdulaziz University, Al-Kharj 16278, Saudi Arabia
2
Electrical and Computer Engineering Department, University of Victroia, Victoria, BC V8P 5C2, Canada
*
Author to whom correspondence should be addressed.
Network 2026, 6(2), 21; https://doi.org/10.3390/network6020021
Submission received: 28 January 2026 / Revised: 26 March 2026 / Accepted: 30 March 2026 / Published: 1 April 2026

Abstract

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.
Keywords: post-quantum cryptography; lattice-based cryptography; polynomial multiplication; IoT edge devices; serial systolic array; IoT secuirty; Sustainable Development Goals (SDGs) post-quantum cryptography; lattice-based cryptography; polynomial multiplication; IoT edge devices; serial systolic array; IoT secuirty; Sustainable Development Goals (SDGs)

Share and Cite

MDPI and ACS Style

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

AMA Style

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. https://doi.org/10.3390/network6020021

Chicago/Turabian Style

Ibrahim, Atef, and Fayez Gebali. 2026. "Efficient Serial Systolic Polynomial Multiplier for Lattice-Based Post-Quantum Cryptographic Schemes in IoT Edge Node" Network 6, no. 2: 21. https://doi.org/10.3390/network6020021

APA Style

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

Article Metrics

Back to TopTop