Optimizing packet size in post-quantum NB-IoT systems: Signature aggregation and Merkle tree pruning approaches

Author affiliations

Authors

  • Thi Bac Do Thai Nguyen University of Information and Communication Technology, Z115 Street, Quyet Thang Ward, Thai Nguyen Province, Viet Nam https://orcid.org/0000-0001-9425-5167
  • Khanh Linh Dinh Thai Nguyen University of Information and Communication Technology, Z115 Street, Quyet Thang Ward, Thai Nguyen Province, Viet Nam https://orcid.org/0009-0000-4027-1065

DOI:

https://doi.org/10.15625/1813-9663/23150

Keywords:

Post-quantum digital signatures, signature aggregation, Merkle tree pruning, packet size optimization, NB-IoT security, ChaCha20-Poly1305, offloading verification, selective signing policy, lightweight IoT security, hybrid authentication mechanisms.

Abstract

With the increasing adoption of post-quantum cryptographic schemes such as SPHINCS+ in Narrowband IoT (NB-IoT) systems, a major challenge arises from large packet size overhead - often reaching approximate 34 KB per transmission due to stateless hash-based signature metadata. This paper investigates practical techniques for reducing this overhead while maintaining quantum resilience, including signature aggregation across multiple devices, Merkle tree pruning within SPHINCS+, and selective signing policies based on session frequency. We implement these strategies on an ESP32-WROOM-32 microcontroller interfaced with a SIM7080 NB-IoT module, demonstrating that packet size can be reduced by up to 60% through intelligent session management and optimized scheduling. Our results provide actionable insights for system architects aiming to deploy post-quantum security within strict bandwidth constraints typical of LPWAN environments.

Downloads

Published

27-11-2025

How to Cite

[1]T. B. Do and K. L. Dinh, “Optimizing packet size in post-quantum NB-IoT systems: Signature aggregation and Merkle tree pruning approaches”, J. Comput. Sci. Cybern., Nov. 2025.

Issue

Section

Articles

Similar Articles

1 2 3 4 5 6 7 8 9 10 > >> 

You may also start an advanced similarity search for this article.