Quantum-safe public key exchange protocols face significant challenges in hardware- and software-based approaches. Quantum key distribution, which relies on specialized quantum hardware, presents a significant barrier to widespread adoption due to its high cost and limited scalability. Conversely, software-based solutions using post-quantum algorithms introduce complications, such as increased resource demands and larger cipher-texts. Furthermore, the security of these post-quantum algorithms remains relatively untested, which has led to the emerging trend of hybrid deployment, combining clas-sical and quantum-resistant techniques to hedge against potential vulnerabilities. Recently, Arqit proposed a quantum-secure symmet-ric key agreement (SKA) protocol, claiming that it is lightweight and scalable [1] to address these problems. However, their proprietary solution is not available for independent analysis. To evaluate the performance and scalability of quantum-secure SKA techniques, we develop variations of the SKA protocol using open-source and accessible components in this work. To analyze quantum-secure SKA scheme, we imple-mented an SKA technique that involves a hybrid mech-anism, leveraging secret strings distributed through a combination of existing classical and quantum public key pairs during the initial key exchange. We analyze our scheme and demonstrate that it incurs minimal performance overhead, with only 99ms for purely quantum SKA and 199ms for the hybrid version, compared to the classical SKA protocol. We also show that our scheme remains robust under various network conditions, including delays, packet losses, and bandwidth variations, maintaining small and consistent overheads. We also show that this solution is scalable, with an overhead of only one second for every additional five concurrent users. This performance improves significantly with increased computational resources-achieving a 50-60% improvement when scaling from two to four CPUs. Additionally, our security evaluations confirm that the protocol provides consistent and sufficient randomness throughout the key agreement process, ensuring quantum-resistance at every stage.
Quantum-safe public key exchange protocols face significant challenges in hardware- and software-based approaches. Quantum key distribution, which relies on specialized quantum hardware, presents a significant barrier to widespread adoption due to its high cost and limited scalability. Conversely, software-based solutions using post-quantum algorithms introduce complications, such as increased resource demands and larger cipher-texts. Furthermore, the security of these post-quantum algorithms remains relatively untested, which has led to the emerging trend of hybrid deployment, combining clas-sical and quantum-resistant techniques to hedge against potential vulnerabilities. Recently, Arqit proposed a quantum-secure symmet-ric key agreement (SKA) protocol, claiming that it is lightweight and scalable [1] to address these problems. However, their proprietary solution is not available for independent analysis. To evaluate the performance and scalability of quantum-secure SKA techniques, we develop variations of the SKA protocol using open-source and accessible components in this work. To analyze quantum-secure SKA scheme, we imple-mented an SKA technique that involves a hybrid mech-anism, leveraging secret strings distributed through a combination of existing classical and quantum public key pairs during the initial key exchange. We analyze our scheme and demonstrate that it incurs minimal performance overhead, with only 99ms for purely quantum SKA and 199ms for the hybrid version, compared to the classical SKA protocol. We also show that our scheme remains robust under various network conditions, including delays, packet losses, and bandwidth variations, maintaining small and consistent overheads. We also show that this solution is scalable, with an overhead of only one second for every additional five concurrent users. This performance improves significantly with increased computational resources-achieving a 50-60% improvement when scaling from two to four CPUs. Additionally, our security evaluations confirm that the protocol provides consistent and sufficient randomness throughout the key agreement process, ensuring quantum-resistance at every stage.
The increasing reliance on cloud storage across sectors has made the protection of sensitive data a critical concern especially as advances in quantum computing threaten to break traditional public-key cryptographic systems. This growing vulnerability raises urgent questions about how to secure digital assets in a post-quantum future. To address this challenge, this study aims to design, implement, and evaluate a hybrid encryption framework that combines symmetric encryption for data confidentiality with quantum-resistant public-key algorithms for key management and digital signatures. The objective was to develop a secure and practical solution that can be readily adopted using open-source tools. The system was built in a Linux-based virtual environment using an S3-compatible object storage platform, integrated with quantum-safe cryptographic libraries, and automated through scripting. Performance testing was conducted using files ranging from 100 MB to 1 GB, with metrics such as encryption and decryption time, CPU usage, upload/download latency, and internet throughput analyzed. The results showed that while quantum-safe operations added some overhead, even large files could be securely processed in under two minutes with stable system performance and no data corruption. These findings confirm that hybrid encryption models can be deployed today without specialized hardware, offering a forward-compatible and robust approach to cloud security. This work contributes a tested and reproducible framework for early adoption of quantum-safe cryptography in real-world cloud environments.
Advancements in quantum computing pose critical risks to classical cryptographic systems that rely on the computational hardness of integer factorization and discrete logarithms. This paper presents an evaluation of quantum resistant key exchange mechanisms, emphasizing the BB84 Quantum Key Distribution (QKD) protocol and exploring emerging alternatives such as muon-based randomness for key generation. An implementation of the BB84 protocol using Microsoft’s Q# quantum programming language demonstrates its effectiveness in detecting eavesdropping through observable disturbances in quantum states. Simulations under both secure and compromised conditions confirm the protocol’s resilience against quantum based interception. Practical considerations such as scalability, noise tolerance, and hardware constraints are addressed, offering insight into the deployment challenges of QKD systems. Additionally, a comparative perspective is provided between quantum native approaches and post-quantum classical cryptographic solutions, including lattice-based schemes. The analysis supports the development of hybrid cryptographic infrastructures capable of withstanding quantum threats, thereby contributing to the future of secure communication systems.
With the development of quantum computing, traditional public-key cryptographic systems based on integer factorization and discrete logarithm problems face security challenges. To systematically review the research progress of post-quantum cryptography, its theoretical foundations, algorithmic systems, engineering implementation, and deployment issues were surveyed. First, the vulnerabilities of traditional cryptographic systems under quantum attack models and the constraints of protocol migration were analyzed. Then, post-quantum cryptographic schemes, including lattice-based, hash-based, code-based, multivariate, and isogeny-based schemes, were classified and compared, and hardware adaptation, implementation optimization, and implementation security were discussed in combination with CPU, FPGA, and embedded platforms. Under a unified testing environment, the performance and communication overhead of traditional, post-quantum, hybrid, and selected signature and KEM schemes proposed and publicly implemented by domestic research teams were evaluated. The results show that different technical routes involve obvious trade-offs among security, computational efficiency, and communication cost. Finally, challenges in long-term security validation, implementation security, system migration, and engineering deployment were summarized, providing a reference for post-quantum cryptography research and application.
The advent of quantum computing technology has created an existential risk for classical cryptographic systems, motivating the development of quantum-resistant security mechanisms for network communications. This paper presents the design, implementation, and performance evaluation of a Hybrid Classical Quantum Network (HCQN) model, a framework that unifies quantum with conventional network infrastructure for secure key exchange. Unlike approaches that require full quantum network deployment, our model retains existing classical data and control planes while abstracting QKD operation to the protocol level, easing practical adoption. To support this, we implement a comprehensive simulation framework in NS-3 that models QKD key generation delays, quantum channel characteristics, and classical-quantum coordination overhead without relying on physical quantum hardware simulation. The proposed architecture features a novel Key Management Layer (KML) that handles the transition between quantum-derived keys and classical fallback mechanisms. Through extensive simulations across metropolitan-scale topologies, we evaluate network performance metrics including end-to-end delay, throughput, packet delivery ratio, and key exchange latency. Results demonstrate that our HCQN model achieves information-theoretic security with only 12-18% throughput reduction compared to classical-only networks, while maintaining key exchange latencies below 45 ms for distances up to 100 km. Comparative analysis reveals significant security improvements over pre-shared key and Diffie-Hellman schemes under quantum adversary threat models.
Aim: The imminent advent of large-scale quantum computers within the next years is expected to highly affect the security of several cryptosystems that are now considered secure; this mainly holds for classical, long-established, public key cryptographic algorithms such as RSA and elliptic curve cryptography. Apparently, any security protocol that relies on such ciphers, including the transport layer security (TLS) protocol which constitutes a somewhat de facto standard for the security on the web, will not be considered secure in the post-quantum era. To alleviate the security risks stemming from quantum computing, several proposals have been submitted to the relevant procedure initiated by NIST towards evaluating and standardizing one or more quantum-resistant public-key cryptographic algorithms. This paper focuses on embedding post-quantum secure cryptographic algorithms into the TLS protocol to analyze its performance. More precisely, the paper aims to analyze whether this transition to post-quantum secure algorithms will have a significant impact on the user experience due to the possible increase of client--server communication times. Methods: Having as the starting point several important works in the field, several experiments were carried out, using combinations of cloud and local virtual machines per case and considering all the post-quantum cryptographic algorithm finalists for key exchange from the third round of the ongoing NIST process, for various cryptographic as well as network parameters. Results: Our results exhibit that, for key exchange in TLS, the best performance among the post-quantum secure ciphers is achieved by the Saber and CRYSTAL-Kyber variants for all security levels, regardless of the underlying computing power. The performance is comparable to that of the corresponding one achieved by a classical elliptic curve algorithm for key exchange for both RTT and packet loss ratio — i.e., the network parameters seem to have the same effect on post-quantum secure algorithms as in the case of a conventional elliptic curve algorithm. However, the effect of the network parameters on the performance is more crucial than the effect of the underlying chosen ciphers. Conclusion: According to the experiments, we conclude that there exist very promising algorithms that could be utilized in TLS in the near future, which may behave even better than the conventional elliptic curve algorithms for key exchange. It should also be pointed out that NIST announced on 5 July 2022 (i.e., after the completion of our research experiments) that, for general encryption used when we access secure websites, the CRYSTALS-Kyber algorithm has been selected, having as one of its advantages the speed of operation. Hence, the results of our paper are fully in line with the progress of the NIST process. Taking into account that the NIST process is still ongoing (now in its fourth round) with the aim to select more algorithms, as well as that some algorithms may be standardized outside NIST, it becomes evident that our results provide very useful insights on performance aspects of the post-quantum secure algorithms.
The rapid progress of quantum computing now poses a substantial security risk to the information infrastructures of various nations, which are fundamentally reliant on classical cryptographic systems. Encryption algorithms such as RSA, ECC, and, notably, Satyamani’s, Shor, and Grover algorithms are vulnerable to quantum attacks; indeed, these algorithms can compromise code creation and encryption protocols within seconds when subjected to powerful quantum computing devices. In response to this emerging threat, this paper presents the design and evaluation of a quantum-resilient cryptographic protocol suite intended for national information systems security. The proposed version integrates lattice-based key exchange and hash-based digital signatures, rendering it post-quantum and compatible with the existing Public Key Infrastructure (PKI) and network protocol stack. Formal security analysis and performance evaluation were conducted using simulated nationwide network environments. Experimental results demonstrate that the proposed scheme achieves a computational latency reduction of up to 45% compared to baseline post-quantum algorithms, while maintaining high resilience against both classical and quantum adversaries. The scalability test indicates that quantum-resilient cryptography can be deployed across various government apparatuses, promoting national cybersecurity and digital autonomy, while maintaining security and interoperability