This research evaluated the practicality of implementing Post-Quantum Cryptography (PQC) algorithms onboard resource-constrained computing devices. While PQC is computationally efficient, key sizes, memory usage, and bandwidth constraints are of concern in an embedded environment. The Controller Area Network (CAN) protocol serves as an example of limited communication in an arbitrary embedded environment. It utilizes only eight (8) bytes of data payload per message, requiring the large keys of PQC algorithms to be split into several messages. Improvements upon the CAN protocol exist to increase throughput, although the unmodified version remains in use. This research is likely to be more restricted than future development. Comparison was made between PQC and current standard algorithms to evaluate computational cost. Ultimately, this research determined that PQC algorithms such as CRYSTALS-Kyber [1], CRYSTALS-Dilithium [2], and Falcon [3] are presently viable in low capacity networks.
This research evaluated the practicality of implementing Post-Quantum Cryptography (PQC) algorithms onboard resource-constrained computing devices. While PQC is computationally efficient, key sizes, memory usage, and bandwidth constraints are of concern in an embedded environment. The Controller Area Network (CAN) protocol serves as an example of limited communication in an arbitrary embedded environment. It utilizes only eight (8) bytes of data payload per message, requiring the large keys of PQC algorithms to be split into several messages. Improvements upon the CAN protocol exist to increase throughput, although the unmodified version remains in use. This research is likely to be more restricted than future development. Comparison was made between PQC and current standard algorithms to evaluate computational cost. Ultimately, this research determined that PQC algorithms such as CRYSTALS-Kyber [1], CRYSTALS-Dilithium [2], and Falcon [3] are presently viable in low capacity networks.
The rapid development of quantum computing has introduced serious concerns for modern cryptography, especially in embedded systems. These devices typically rely on well-established cryptographic techniques like RSA and ECC, which have provided secure communications and authentication for ages. However, with the advancement of quantum algorithms such as Shor's and Grover's, these classical approaches are now at risk. Once large-scale quantum computers become operational, they could easily break public-key encryption and weaken symmetric encryption, putting embedded devices at significant risk, especially those that remain in use for over a decade with limited or no ability to receive updates. That's why adopting post-quantum cryptography (PQC) is becoming urgent, not because quantum computers are already here, but because the systems we build today may still be running a decade from now, when those threats become real. Additionally, “record now, decrypt later” attacks mean that sensitive data being encrypted today could be compromised in the future, even if it seems safe now. To respond to this challenge, several possible PQC algorithms have been developed and standardized. NIST has selected Kyber for key encapsulation and Dilithium and SPHINCS+ for digital signatures, and other algorithms like FALCON and SABER are being evaluated for more specialized use. However, implementing these algorithms in embedded environments is quite tricky due to concrete hardware and software constraints like RAM restrictions, CPU power limits, and certainly vulnerability to other independent attacks. In summary, this work discusses the challenges mentioned above and outlines the migration strategies, including cryptographic inventory, hybrid approaches to adoption, and systems with cryptoagility. The report provides a view of how embedded systems can be made ready to become secure in a post-quantum future, relying on literature, governmental resolutions, and real-world implementations.
Post-quantum cryptography (PQC) is a critical area of research aimed at addressing the threat quantum computing poses to traditional cryptographic systems. It focuses on evaluating the efficiency, security, and practical performance of PQC algorithms through experimental analysis. This research supports the development of optimized cryptographic solutions, contributes to standardization efforts, and ensures secure and efficient implementations for a wide range of applications. Despite progress in PQC, gaps still exist in practical performance evaluations, particularly in resource-constrained environments. There is a lack of standardized comparisons, hindering the selection of suitable algorithms for specific use cases like IoT and cloud systems. Furthermore, research on scalability, integration challenges, and the trade-offs between security and efficiency remains insufficient. The methodology involves creating a comprehensive framework to evaluate various PQC algorithms, including lattice-based (e.g., Kyber, Dilithium), code-based (e.g., McEliece), and hash-based (e.g., SPHINCS+). These algorithms will be tested in diverse environments, from resource-constrained devices to high-performance infrastructures such as cloud platforms. Key metrics such as encryption/decryption speed, key sizes, memory usage, and computational efficiency will be measured, focusing on the trade-offs between security, efficiency, and scalability. The results will be benchmarked against standardized metrics to provide a clear understanding of each algorithm's suitability for real-world deployment. The findings indicate that lattice-based algorithms like Kyber offer a strong balance between security and efficiency but require considerable computational resources. Code-based algorithms like McEliece are highly secure but come with large key sizes and slower speeds. Hash-based schemes like SPHINCS+ provide strong security but are computationally expensive, making them less suitable for resource-limited systems. The highlights the importance of optimizing PQC algorithms according to specific application requirements, where the choice of algorithm must balance security, efficiency, and resource constraints, with continuous optimization needed to address evolving real-world demands.
The rapid development of quantum computers threatens traditional cryptographic schemes, prompting the need for Post-Quantum Cryptography (PQC). Although the NIST standardization process has accelerated the development of such algorithms, their application in resource-constrained environments such as embedded systems remains a challenge. Automotive systems relying on the Controller Area Network (CAN) bus for communication are particularly vulnerable due to their limited computational capabilities, high traffic, and need for real-time response. These constraints raise concerns about the feasibility of implementing PQC in automotive environments, where legacy hardware and bit rate limitations must also be considered.In this paper, we introduce PQ-CAN, a modular framework for simulating the performance and overhead of PQC algorithms in embedded systems. We consider the automotive domain as our case study, testing a variety of PQC schemes under different scenarios. Our simulation enables the adjustment of embedded system computational capabilities and CAN bus bit rate constraints. We also provide insights into the trade-offs involved by analyzing each algorithm’s security level and overhead for key encapsulation and digital signature. By evaluating the performance of these algorithms, we provide insights into their feasibility and identify the strengths and limitations of PQC in securing automotive communications in the post-quantum era.
The advent of quantum computing poses significant challenges to traditional cryptographic systems, threatening the confidentiality, integrity and authenticity of digital communications. This paper investigates the integration of post-quantum cryptography (PQC) algorithms into mobile communication systems to address these challenges. The study focuses on evaluating key PQC algorithms shortlisted by the National Institute of Standards and Technology (NIST), including CRYSTALS-Kyber, CRYSTALS-Dilithium, Falcon and SPHINCS+, within the context of 5G and future mobile network architectures. The research encompasses the design and implementation of an experimental framework involving mobile devices, servers, and cloud-based infrastructure to simulate real-world communication scenarios. Performance metrics such as key generation time, signature generation, encryption and decryption speed, and resource consumption were analyzed across various devices to identify algorithms suitable for mobile environments. The findings reveal that lattice-based algorithms, such as Kyber and Dilithium, offer a promising balance between security and efficiency, making them ideal for resource-constrained devices. In contrast, hash-based algorithms like SPHINCS+ exhibit higher computational demands, limiting their practicality in certain applications. This work highlights the importance of algorithm selection and hardware optimization in ensuring secure and efficient communications in the quantum era. By integrating theoretical advancements in PQC with practical applications, this research lays the foundation for quantum-resistant security in mobile networks, ensuring secure and future-ready digital communications.
With the emergence of quantum computing, it will soon break the time-tested cryptography systems, meaning the post-quantum cryptography will be needed to secure next-generation communication networks. This dissertation seeks to explore the implementation and realization of PQC algorithms across different sectors such as vehicular network, IoT devices, as well as large-scale networks of quantum computing. A detailed analysis of the algorithms, including CRYSTALS-Kyber, NTRU, and BB84 Quantum Key Distribution, was conducted to evaluate efficacy, computational efficiency, and quantum-enabled attacks. Key findings reveal that CRYSTALS-Kyber outperforms other algorithms in terms of encryption speed, reducing latency by 40% over NTRU in constrained environments. Furthermore, BB84 QKD protocols were demonstrated successfully with 98% data integrity compared with the noise network conditions. Optimized implementation of the NTRU using parallel computing achieved a 35% gain in processing efficiency and is thus considered worthy for resource-constrained IoT applications. This study confirms that PQC algorithms can be adapted to meet the unique demands of various fields, laying a strong foundation for their integration as quantum-resistant standards in secure communication systems.
The rapid advancement of quantum computing poses a critical threat to classical cryptographic algorithms such as RSA and ECC, particularly in Internet of Things (IoT) devices, where secure communication is essential but often constrained by limited computational resources. This paper investigates the feasibility of deploying post-quantum cryptography (PQC) algorithms on resource-constrained devices. In particular, we implement three PQC algorithms - BIKE, CRYSTALS-Kyber, and HQC - on a lightweight IoT platform built with Raspberry Pi devices. Leveraging the Open Quantum Safe (liboqs) library in conjunction with mbedTLS, we develop quantumsecure key exchange protocols, and evaluate their performance in terms of computational overhead, memory usage, and energy consumption for quantum secure communication. Experimental results demonstrate that the integration of PQC algorithms on constrained hardware is practical, reinforcing the urgent need for quantum-resilient cryptographic frameworks in next-generation IoT devices. The implementation of this paper is available at https://iqsec-lab.github.io/PQC-IoT/.