Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Robotics and Control (JRC)

Investigating Quantum-Resilient Security Mechanisms for Flying Ad-Hoc Networks (FANETs)

Abdul Nasser Abdul Jabbar Abbood, Faris K. AL-Shammri, Zainab Marid Alzamili, ‪Mahmood A. Al-Shareeda‬, Mohammed Amin Almaiah, Rommel Mahmoud AlAli

Published Feb 26, 2025• 28 citations
Publisher

Abstract

Flying Ad Hoc Networks (FANETs) are indispensable in applications such as Surveillance, Disaster response missions, and Military operations. Both security and communication efficiency must meet certain requirements. However, their effectiveness is hobbled by dynamic topologies, resource constraints, and cyber threats. Therefore, Post-Quantum Cryptography (PQC) is necessary. Classical algorithms and current PQC schemes for FANETs have been discussed in this thesis, including cryptographic solutions that are lightweight enough for resourceconstrained environments. The numerical results of the experiment show that while lattice-based cryptography involves minimal risk of breaches, its power consumption is 25% higher than that for other systems and its processing time 30% slower. In contrast, multivariate polynomial cryptography is better on metrics like usage of electricity: only 10% more power consumed energywise and 15% more CPU cycles needed for processing. The introduction of PQC algorithms and architectures resulted in a 5–10% reduction in network throughput and increased latency to 20% in some scenarios. The results show that hybrid cryptographic systems—combining classical with PQC techniques— have the potential to achieve both high efficiency and long-term security. Case studies have validated the feasibility of tailored quantum-safe algorithms in FANETs, which can offer considerable security benefits while standing rigorous scrutiny in terms of scalability and computational performance on dynamic, missioncritical operations.

DOI
10.18196/jrc.v6i1.25351

Related papers

Survey on Post-Quantum Cryptographic Techniques for Securing MANETs

A. H. Galadima, Ahmed Abubakar Aliyu, F. U. Zambuk +4 more

Mobile Ad Hoc Networks (MANETs) enable flexible, infrastructure-less communication for mission critical applications but they are vulnerable impersonation and routing attacks. Quantum computing threatens classical public-key primitives (RSA, ECC) used in MANET security, driving interest in post-quantum cryptography (PQC) for decentralized, resource limited settings. This survey reviews PQC techniques and its application to MANETs, focusing on signature, key exchange, and encryption primitives from lattice based, code base, hash base, and multivariate based families. Synthesizing findings from 40+ studies, we compare security, overheads, and feasibility for constrained nodes and dynamic topologies. Lattice based schemes (Kyber, Dilithium) offer the best balance of security and efficiency, though large keys and CPU costs hinder adoption. Lightweight primitives and hybrid models (PQC with symmetric cryptography) show promise. Key gaps include few lightweight implementations, limited routing level integration (e.g., OLSRv2), and scarce real world validation. Future work should optimize PQC for low power devices, embed it into MANET protocols, and test via simulation and hardware to enable practical, quantum resilient deployments.

BIMA JOURNAL OF SCIENCE AND TECHNOLOGY GOMBE•Jan 31, 2026•0 citations

Quantum Cryptography and FANET Security

M Sumithra, R. Remya, A. Ashwini +2 more

Many cryptographic techniques were available to achieve a secure communication. Because of the open nature of wireless transmission, the communication is not regarded secure. Moreover, with the arrival of quantum computing technology, it overcomes the issues faced during the communication. Quantum cryptography uses the principle of quantum physics for secured information processing. Such processed information is transmitted from one end to the other end. It is regarded as a necessary one, if the communication channel cannot be trusted. Furthermore, a flying ad hoc network (FANET) is an ad hoc network, which rectifies the problem associated with communication among the ground station and unmanned ariel vehicles. It is supportive of real-time data transfer; also, it holds security features of an ad hoc network.

Wiley eBooks•Oct 10, 2025•0 citations

Quantum Cryptography for Secure FANET

Taskeen Zaidi, S. Neha

The security of a flying ad hoc network (FANET) is crucial because of its unique characteristics, such as its dynamic topology, high mobility, and decentralized network. The existing routing used by unmanned aerial vehicles (UAVs) comes with certain routing attacks, such as sinkhole attacks, dropping attacks, blackhole attacks, identity spoofing, data tampering, data leakage, and radio spoofing. The encrypting method used in UAV networks at present is based on mathematical complexity, which works quite well but can be easily decoded by quantum computers in no time. Quantum cryptography addresses the limitations of classical cryptographic methods. The protocol designed with a quantum mechanism based on the laws of physics will be a solution to many security threats for UAVs. The implementation of quantum cryptography requires specialized hardware that provides secure communication links, data protection, and detection of eavesdropping attempts. Post-quantum cryptography, the no-cloning theorem, and quantum key distribution (QKD) establish a shared secret key for both UAVs, which makes it impossible to be decoded by man-in-the-middle attacks.

Wiley eBooks•Oct 10, 2025•0 citations

Investigating Post-Quantum Cryptography to Secure Transmitted Data via

Zhou Rongjie

The advent of quantum computing poses significant challenges to traditional cryptographic systems, threatening the confidentiality, integrity and authenticity of digital communications. This thesis 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 analysed 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 resourceconstrained 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. xi By integrating theoretical advancements in PQC with practical applications, this research lays the foundation for quantum-resistant security in mobile networks, ensuring secure and futureready digital communications.

•Mar 25, 2025•0 citations

Exploring Post-Quantum Cryptographic Algorithms for Secure Data Transmission

Sherzod Gulomov, Худайберганов Темур Рустамович, Maftuna X. Ravshanova +2 more

The rapid advancement of quantum computing introduces a critical threat to established cryptographic systems, such as RSA and ECC, by enabling quantum attacks those classical systems cannot withstand. This evolving threat creates a necessity for post-quantum cryptographic (PQC) algorithms to ensure secure data transmission in the quantum era. PQC encompasses diverse approaches, including lattice-based, hash-based, code-based, and multivariate polynomial cryptography. Each category offers distinct advantages and challenges: lattice-based algorithms provide robust security but may require substantial computational resources, while hash-based approaches are easier to implement but limited in flexibility. Code-based algorithms deliver strong security with significant computational demand, and multivariate polynomial approaches boast efficiency, though they face scrutiny over quantum resilience. This paper evaluates these PQC algorithms in terms of their security, performance, and feasibility, identifying optimal methods to secure data transmission in a future where quantum threats are prevalent.

IEEE International Conference on Problems of Informatics, Electronics and Radio Engineering (PIERE)•Nov 15, 2024•13 citations

Operationalizing Post-Quantum Cryptography in Multi-Cloud Environments

Syed Mohiuddin Qadri

The emergence of quantum computing is a serious threat to traditional cryptographic algorithms, making it critical to transition to post-quantum cryptography (PQC). This work proposes a holistic conceptual and analytical framework for deploying PQC in multi-cloud environments where the complexity of different infrastructure, workloads and key management schemes pose significant security and efficiency problems. The proposed framework for crypto-agility follows a layered approach, with a cryptographic abstraction layer, a policy-based orchestration engine, a centralized hardware security module (HSM) management plane, and an ongoing monitoring module to facilitate a smooth transition from classical to hybrid and fully quantum-resistant cryptographic systems. He researches identifies and critically analyzes major challenges in deploying PQC technologies in multi-cloud environments, such as inter-cloud interoperability, computational complexity, latency, key management, and regulatory and compliance considerations. The framework tackles these challenges by incorporating hybrid cryptographic protocols that blend classic cryptographic algorithms with NIST-approved PQC algorithms, namely ML-KEM (FIPS 203) and ML-DSA (FIPS 204), to maintain backward compatibility and increase security against quantum-powered adversaries. Moreover, the framework proposes dynamic policy-driven algorithm selection to implement context-sensitive cryptographic enforcement based on sensitivity labels, security threats, and regulatory considerations. An experimental framework is proposed to assess the efficiency and scalability of PQC algorithms deployed in a multi-cloud environment, including metrics such as CPU usage, memory usage, latency and throughput with different workloads. Although this research is conceptual, it draws on previous benchmarking to discuss the securityperformance trade-offs associated with PQC. The results highlight the need for centralized trust anchors, crypto-agility and hybrid deployment models to address risks from cryptographic diversity and ensure the sustainability of security operations. This study advances the research on quantum-safe cloud security by offering a systematic, scalable and policy-oriented framework for PQC deployment. It provides practical guidance for businesses, cloud architects, and security professionals on how to safeguard against quantum vulnerabilities and ensure efficient operations in distributed systems by implementing quantum-safe cryptographic infrastructures.

Frontiers in Computer Science and Artificial Intelligence•May 15, 2026•0 citations
Flying Ad Hoc Networks (FANETs) are indispensable in applications such as Surveillance, Disaster response missions, and Military operations. Both security and communication efficiency must meet certain requirements. However, their effectiveness is hobbled by dynamic topologies, resource constraints, and cyber threats. Therefore, Post-Quantum Cryptography (PQC) is necessary. Classical algorithms and current PQC schemes for FANETs have been discussed in this thesis, including cryptographic solutions that are lightweight enough for resourceconstrained environments. The numerical results of the experiment show that while lattice-based cryptography involves minimal risk of breaches, its power consumption is 25% higher than that for other systems and its processing time 30% slower. In contrast, multivariate polynomial cryptography is better on metrics like usage of electricity: only 10% more power consumed energywise and 15% more CPU cycles needed for processing. The introduction of PQC algorithms and architectures resulted in a 5–10% reduction in network throughput and increased latency to 20% in some scenarios. The results show that hybrid cryptographic systems—combining classical with PQC techniques— have the potential to achieve both high efficiency and long-term security. Case studies have validated the feasibility of tailored quantum-safe algorithms in FANETs, which can offer considerable security benefits while standing rigorous scrutiny in terms of scalability and computational performance on dynamic, missioncritical operations.
Mobile Ad Hoc Networks (MANETs) enable flexible, infrastructure-less communication for mission critical applications but they are vulnerable impersonation and routing attacks. Quantum computing threatens classical public-key primitives (RSA, ECC) used in MANET security, driving interest in post-quantum cryptography (PQC) for decentralized, resource limited settings. This survey reviews PQC techniques and its application to MANETs, focusing on signature, key exchange, and encryption primitives from lattice based, code base, hash base, and multivariate based families. Synthesizing findings from 40+ studies, we compare security, overheads, and feasibility for constrained nodes and dynamic topologies. Lattice based schemes (Kyber, Dilithium) offer the best balance of security and efficiency, though large keys and CPU costs hinder adoption. Lightweight primitives and hybrid models (PQC with symmetric cryptography) show promise. Key gaps include few lightweight implementations, limited routing level integration (e.g., OLSRv2), and scarce real world validation. Future work should optimize PQC for low power devices, embed it into MANET protocols, and test via simulation and hardware to enable practical, quantum resilient deployments.
Many cryptographic techniques were available to achieve a secure communication. Because of the open nature of wireless transmission, the communication is not regarded secure. Moreover, with the arrival of quantum computing technology, it overcomes the issues faced during the communication. Quantum cryptography uses the principle of quantum physics for secured information processing. Such processed information is transmitted from one end to the other end. It is regarded as a necessary one, if the communication channel cannot be trusted. Furthermore, a flying ad hoc network (FANET) is an ad hoc network, which rectifies the problem associated with communication among the ground station and unmanned ariel vehicles. It is supportive of real-time data transfer; also, it holds security features of an ad hoc network.
The security of a flying ad hoc network (FANET) is crucial because of its unique characteristics, such as its dynamic topology, high mobility, and decentralized network. The existing routing used by unmanned aerial vehicles (UAVs) comes with certain routing attacks, such as sinkhole attacks, dropping attacks, blackhole attacks, identity spoofing, data tampering, data leakage, and radio spoofing. The encrypting method used in UAV networks at present is based on mathematical complexity, which works quite well but can be easily decoded by quantum computers in no time. Quantum cryptography addresses the limitations of classical cryptographic methods. The protocol designed with a quantum mechanism based on the laws of physics will be a solution to many security threats for UAVs. The implementation of quantum cryptography requires specialized hardware that provides secure communication links, data protection, and detection of eavesdropping attempts. Post-quantum cryptography, the no-cloning theorem, and quantum key distribution (QKD) establish a shared secret key for both UAVs, which makes it impossible to be decoded by man-in-the-middle attacks.
The advent of quantum computing poses significant challenges to traditional cryptographic systems, threatening the confidentiality, integrity and authenticity of digital communications. This thesis 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 analysed 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 resourceconstrained 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. xi By integrating theoretical advancements in PQC with practical applications, this research lays the foundation for quantum-resistant security in mobile networks, ensuring secure and futureready digital communications.
The rapid advancement of quantum computing introduces a critical threat to established cryptographic systems, such as RSA and ECC, by enabling quantum attacks those classical systems cannot withstand. This evolving threat creates a necessity for post-quantum cryptographic (PQC) algorithms to ensure secure data transmission in the quantum era. PQC encompasses diverse approaches, including lattice-based, hash-based, code-based, and multivariate polynomial cryptography. Each category offers distinct advantages and challenges: lattice-based algorithms provide robust security but may require substantial computational resources, while hash-based approaches are easier to implement but limited in flexibility. Code-based algorithms deliver strong security with significant computational demand, and multivariate polynomial approaches boast efficiency, though they face scrutiny over quantum resilience. This paper evaluates these PQC algorithms in terms of their security, performance, and feasibility, identifying optimal methods to secure data transmission in a future where quantum threats are prevalent.
The emergence of quantum computing is a serious threat to traditional cryptographic algorithms, making it critical to transition to post-quantum cryptography (PQC). This work proposes a holistic conceptual and analytical framework for deploying PQC in multi-cloud environments where the complexity of different infrastructure, workloads and key management schemes pose significant security and efficiency problems. The proposed framework for crypto-agility follows a layered approach, with a cryptographic abstraction layer, a policy-based orchestration engine, a centralized hardware security module (HSM) management plane, and an ongoing monitoring module to facilitate a smooth transition from classical to hybrid and fully quantum-resistant cryptographic systems. He researches identifies and critically analyzes major challenges in deploying PQC technologies in multi-cloud environments, such as inter-cloud interoperability, computational complexity, latency, key management, and regulatory and compliance considerations. The framework tackles these challenges by incorporating hybrid cryptographic protocols that blend classic cryptographic algorithms with NIST-approved PQC algorithms, namely ML-KEM (FIPS 203) and ML-DSA (FIPS 204), to maintain backward compatibility and increase security against quantum-powered adversaries. Moreover, the framework proposes dynamic policy-driven algorithm selection to implement context-sensitive cryptographic enforcement based on sensitivity labels, security threats, and regulatory considerations. An experimental framework is proposed to assess the efficiency and scalability of PQC algorithms deployed in a multi-cloud environment, including metrics such as CPU usage, memory usage, latency and throughput with different workloads. Although this research is conceptual, it draws on previous benchmarking to discuss the securityperformance trade-offs associated with PQC. The results highlight the need for centralized trust anchors, crypto-agility and hybrid deployment models to address risks from cryptographic diversity and ensure the sustainability of security operations. This study advances the research on quantum-safe cloud security by offering a systematic, scalable and policy-oriented framework for PQC deployment. It provides practical guidance for businesses, cloud architects, and security professionals on how to safeguard against quantum vulnerabilities and ensure efficient operations in distributed systems by implementing quantum-safe cryptographic infrastructures.