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

EPJ Quantum Technology

Quantum-lattice synergy: a next-generation blueprint for post-quantum cloud security

Hatoon S. AlSagri, Ankit Kumar, Abdul Khader Jilani Saudagar, Abhishek Kumar, Linesh Raja

Published Feb 2, 2026• 3 citations
Publisher

Abstract

Quantum computing poses a fundamental threat to the classical cryptographic mechanisms that underpin contemporary cloud security, motivating an urgent transition toward post-quantum solutions. This study introduces Quantum-Lattice Synergy (QLS), a next-generation security blueprint that integrates the computational hardness of lattice-based cryptography with the information-theoretic guarantees of quantum cryptographic primitives. QLS is a mix of Learning with Errors (LWE)-based encryption, quantum key distribution (QKD), and quantum-generated randomness to offer robust and scalable with resilience to future protection of cloud infrastructures. The architecture consists of three modules which are closely interrelated, namely, QLS-KG to generate quantum-lattice hybrid keys, QLS-Enc for lattice-based encryption with quantum-derived keys, and QLS-Auth to achieve secure authentication with quantum hashing and lattice trapdoors. Through rigorous mathematical modelling, security proofs and complexity analysis, it has been demonstrated that QLS provides a dual-layered defence which provides, at the computational level, computational security based on hard lattice problems, and at the physical level, physical security based on quantum mechanics. It has been experimentally shown that QLS is more efficient in key generation, encryption, and decryption compared to the state-of-the-art post-quantum protocols, such as LWE-based encryption, NTRU Encrypt, and Kyber512, depending on the quantum-assisted keying and parameterizing lattices, and achieving the same level of classical symmetric-key security at 256 bits. This characterization of security is not intended to mean an AES-256 baseline or to exclude the ability of existent schemes to meet similar security levels in the right configurations, it simply indicates that QLS has a strength in its hybrid, defence-in-depth architecture. QLS is created in a way that it can be deployed in the context of existing cloud facilities, which tackles durability of confidentiality, future economics, scalability and reliability of trust during the post-quantum era.

DOI
10.1140/epjqt/s40507-026-00468-0

Related papers

Post-quantum investigating Cryptography for Data Safeguard Transmission in Future Network Communication

Laith H. Jasim Alzubaidi, M. Sivabharathy, V. Venkataiah +3 more

With the fast-paced development of quantum computing, classical cryptographic techniques are under severe security threats, prompting the need for post-quantum cryptographic mechanisms for secure data exchange in next-generation network communications. Post-quantum cryptography seeks to protect sensitive data against quantum attacks to provide long-term data confidentiality. But all current cryptographic techniques, including RSA and ECC, are susceptible to quantum algorithms like Shor's algorithm, which can factor large integers efficiently and break discrete logarithm problems, making classical cryptography useless. There is thus a pressing need for quantum attack-resistant encryption mechanisms. To meet these challenges, we introduce the Lattice-Based Cryptography with Hybrid Key Exchange (L-CHKE) framework, which combines lattice-based encryption with a hybrid key exchange mechanism. Lattice-based cryptography provides quantum resistance because it is based on hard mathematical problems such as Learning with Errors (LWE), which provides greater security and efficiency. The designed L-CHKE algorithm strengthens secure key distribution and authentication for next-generation networks, especially for applications needing strong security like financial transactions, IoT, and military communications. Experimental results verify that L-CHKE noticeably boosts computational efficiency by 98.45%, decreases key exchange latency by 42.56%, and guarantees robustness by 97.64% against quantum attacks, indicating it is an appropriate solution for post-quantum secure communication.

International Conference on Computational Innovations and Engineering Sustainability (ICCIES)•Apr 24, 2025•0 citations

Quantum-Resistant Cryptographic Models for Blockchain-Based Cloud Security

Nithisha J, Imad Shalout, S. Sasikumar +2 more

While blockchain and cloud security infrastructures rely on existing public-key cryptographic schemes, their dramatic risk will be the advent of quantum computing. Classical algorithms previously deemed secure, such as RSA, ECDSA and Diffie-Hellman, can be broken by quantum attacks based on Shor's and Grover's algorithms that efficiently break asymmetric encryption and hash-based authentication mechanisms. To mitigate these vulnerabilities, this work introduces a Quantum-Resistant Cryptographic Framework (QRCF), tailored to guard blockchain-based cloud settings from potential quantum threat actors using post-quantum cryptography (PQC) primitives and hybrid crypto protocols. The suggested framework incorporates a combination of Lattice Based Cryptography (LBC) for digital signatures and key exchange, Hash-Based Signatures (HBS) for lightweight cloud authentication, and Multivariate Polynomial Cryptography (MPC) for decentralized identity management. Coin Quantum-Secure PoA. In federated cloud deployments, privacy-preserving computations are achieved through the combination of (ZKPs) and homomorphic encryption (HE). Through experimental simulations performed on a hybrid blockchain test-bed, we show that the QRCF framework provides an impressive 42% less signature verification time and a 55% better key-exchange robustness factor as compared to classical block chain models. It retains compatibility with the conventional blockchain API layer while being resistant to decryption by quantum computers. This provides a quantum-resilient basis for blockchain-based cloud security and will help us gradually move towards sustainable, long-term trust and compliance in next-generation distributed ecosystems.

International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT)•Apr 1, 2026•0 citations

Toward Quantum-Resilient Cloud and Edge Security: Post-Quantum Cryptographic Architectures

Dr. C. Nagesh, Chatta Balaji, K Sudhakar, Dr. V. Sujay

The rapid advancement of quantum computing threatens the security foundations of classical public-key cryptographic systems such as RSA and Elliptic Curve Cryptography (ECC), which underpin cloud and edge infrastructures. With scalable quantum algorithms capable of breaking widely deployed cryptographic primitives, organizations must transition toward quantum-resilient security models. This paper proposes a comprehensive Quantum-Resilient Cryptographic Architecture (QRCA) designed specifically for cloud and edge computing environments. The framework integrates post-quantum cryptographic (PQC) algorithms, hybrid key exchange protocols, zero-trust principles, and hardware-assisted secure enclaves. We present a layered security model that balances computational overhead, latency constraints, and scalability requirements in distributed systems. Experimental simulations evaluate performance metrics including encryption latency, key exchange overhead, and throughput across cloud data centres and edge nodes. Results indicate that hybrid PQC deployments achieve strong quantum resilience with manageable performance trade-offs. The proposed architecture offers a practical migration pathway for organizations seeking future-proof cryptographic security in distributed computing ecosystems.

International Journal of Advanced Research in Science Communication and Technology•Feb 4, 2026•0 citations

Quantum Resilience: Lattice-Based Cryptography for the Post-RSA Era

Revista, Zen, MATH, 10

The advent of quantum computing poses a significant existential threat to current public-key cryptographic standards, particularly RSA and Elliptic Curve Cryptography (ECC), which underpin global digital security. Shor's algorithm, if implemented on a sufficiently powerful quantum computer, can efficiently break these foundational schemes, rendering vast amounts of encrypted data vulnerable. This paper investigates lattice-based cryptography as a robust and promising candidate for post-quantum security. We provide a comprehensive analysis of its theoretical underpinnings, focusing on hard problems like the Shortest Vector Problem (SVP) and Learning With Errors (LWE), which are believed to be intractable even for quantum adversaries. Through a detailed literature review and methodological exposition, we examine the construction principles of prominent lattice-based Key Encapsulation Mechanisms (KEMs) and digital signature schemes, such as Kyber and Dilithium, highlighting their inherent security properties and performance characteristics. Our results demonstrate that lattice-based schemes offer competitive efficiency, compact key sizes, and strong security guarantees against both classical and quantum attacks, positioning them as essential building blocks for the post-RSA cryptographic landscape. The discussion elaborates on the practical implications, standardization efforts by NIST, and the challenges associated with the transition to quantum-resilient cryptographic infrastructure. We conclude that lattice-based cryptography is a cornerstone of quantum resilience, critical for securing future digital communications and data integrity.

•Dec 6, 2025•0 citations

Quantum-Resilient Cryptographic Framework for Secure and Scalable Cloud Storage Systems

Y. Kiran Kumar, B. Ammani, Vinitha M +2 more

The high growth rate of cloud storage companies has reshaped the digital management of data among individuals and companies. Nevertheless, the future of quantum computing spells a major danger to classical cryptographic algorithms like the RSA and the ECC which forms the backbone to the current cloud security infrastructures. In order to mitigate this new risk, this paper will present a new Post-Quantum Cryptography (PQC)-based security architecture, customized to cloud storage application. The model combines lattice-based key encapsulation models and hash-based authentication models to provide long-term data confidentiality, integrity, and non-repudiation. The basic uniqueness of the offered model is its hybrid cryptographic implementation, which will have quantum-resilient key exchange, and a hardened hash-based signature verification as a single workflow of cloud security. This assimilation improves resistance to quantum-based attacks and retains viable computational efficiency. The evaluation of performance shows that the framework can be used in large-scale and distributed cloud systems since it has a well-balanced trade-off between high quantum resilience and controllable processing overheads. The suggested PQC scheme will create moderate overhead and high future-proof security, in comparison to the traditional crypto-systems. The paper portrays the strategic value of shifting towards quantum-resistant encryption systems to guarantee long-term data security in the post-quantum future.

International Conference on Computing for Sustainable Global Development•Apr 8, 2026•0 citations

Quantum-resistant cryptographic constructions using discrete structures

Pallavi Mhaske, Debanjana Prasad, Namrata Somnath Bajare +3 more

Conventional cryptographic constructions have to meet the challenge of the quick development of quantum computing, and they require the creation of efficient constructions resistant to quantum attack.In this paper, the authors suggest a hybrid cryptographic model that combines lattice-based hardness assumptions, such as Learning with Errors (LWE) with graph theoretical and combinatorial structures to provide greater security, efficiency and scalability.This framework is a hybrid of lattice trapdoor functions, expander graphs, and discrete optimization methods, aiming to enhance structural robustness against classical and quantum attackers.The performance is compared with the conventional methods of RSA/ECC and lattice and graph-based cryptographic methods.The results reported in this work shows that, the proposed hybrid framework provides the security level of 256 bits and quantum attack resistance as 96.8%, whereas the lattice-based approach provides 82.4%.Moreover, the hybrid construction has the key generation time 21.1ms, encryption time 14.1ms and throughput of 183Mbps.These values represent a decrease of 14.92% for the key generation time, 10.19% for the encryption time and 27.96% for the memory usage when compared to the baseline which is based on lattices.These results indicate that a combination of complementary discrete mathematical models could be a potential way to design efficient, scalable post-quantum cryptographic systems.

Journal of Discrete Mathematical Sciences and Cryptography•Oct 31, 2026•0 citations
Quantum computing poses a fundamental threat to the classical cryptographic mechanisms that underpin contemporary cloud security, motivating an urgent transition toward post-quantum solutions. This study introduces Quantum-Lattice Synergy (QLS), a next-generation security blueprint that integrates the computational hardness of lattice-based cryptography with the information-theoretic guarantees of quantum cryptographic primitives. QLS is a mix of Learning with Errors (LWE)-based encryption, quantum key distribution (QKD), and quantum-generated randomness to offer robust and scalable with resilience to future protection of cloud infrastructures. The architecture consists of three modules which are closely interrelated, namely, QLS-KG to generate quantum-lattice hybrid keys, QLS-Enc for lattice-based encryption with quantum-derived keys, and QLS-Auth to achieve secure authentication with quantum hashing and lattice trapdoors. Through rigorous mathematical modelling, security proofs and complexity analysis, it has been demonstrated that QLS provides a dual-layered defence which provides, at the computational level, computational security based on hard lattice problems, and at the physical level, physical security based on quantum mechanics. It has been experimentally shown that QLS is more efficient in key generation, encryption, and decryption compared to the state-of-the-art post-quantum protocols, such as LWE-based encryption, NTRU Encrypt, and Kyber512, depending on the quantum-assisted keying and parameterizing lattices, and achieving the same level of classical symmetric-key security at 256 bits. This characterization of security is not intended to mean an AES-256 baseline or to exclude the ability of existent schemes to meet similar security levels in the right configurations, it simply indicates that QLS has a strength in its hybrid, defence-in-depth architecture. QLS is created in a way that it can be deployed in the context of existing cloud facilities, which tackles durability of confidentiality, future economics, scalability and reliability of trust during the post-quantum era.
With the fast-paced development of quantum computing, classical cryptographic techniques are under severe security threats, prompting the need for post-quantum cryptographic mechanisms for secure data exchange in next-generation network communications. Post-quantum cryptography seeks to protect sensitive data against quantum attacks to provide long-term data confidentiality. But all current cryptographic techniques, including RSA and ECC, are susceptible to quantum algorithms like Shor's algorithm, which can factor large integers efficiently and break discrete logarithm problems, making classical cryptography useless. There is thus a pressing need for quantum attack-resistant encryption mechanisms. To meet these challenges, we introduce the Lattice-Based Cryptography with Hybrid Key Exchange (L-CHKE) framework, which combines lattice-based encryption with a hybrid key exchange mechanism. Lattice-based cryptography provides quantum resistance because it is based on hard mathematical problems such as Learning with Errors (LWE), which provides greater security and efficiency. The designed L-CHKE algorithm strengthens secure key distribution and authentication for next-generation networks, especially for applications needing strong security like financial transactions, IoT, and military communications. Experimental results verify that L-CHKE noticeably boosts computational efficiency by 98.45%, decreases key exchange latency by 42.56%, and guarantees robustness by 97.64% against quantum attacks, indicating it is an appropriate solution for post-quantum secure communication.
While blockchain and cloud security infrastructures rely on existing public-key cryptographic schemes, their dramatic risk will be the advent of quantum computing. Classical algorithms previously deemed secure, such as RSA, ECDSA and Diffie-Hellman, can be broken by quantum attacks based on Shor's and Grover's algorithms that efficiently break asymmetric encryption and hash-based authentication mechanisms. To mitigate these vulnerabilities, this work introduces a Quantum-Resistant Cryptographic Framework (QRCF), tailored to guard blockchain-based cloud settings from potential quantum threat actors using post-quantum cryptography (PQC) primitives and hybrid crypto protocols. The suggested framework incorporates a combination of Lattice Based Cryptography (LBC) for digital signatures and key exchange, Hash-Based Signatures (HBS) for lightweight cloud authentication, and Multivariate Polynomial Cryptography (MPC) for decentralized identity management. Coin Quantum-Secure PoA. In federated cloud deployments, privacy-preserving computations are achieved through the combination of (ZKPs) and homomorphic encryption (HE). Through experimental simulations performed on a hybrid blockchain test-bed, we show that the QRCF framework provides an impressive 42% less signature verification time and a 55% better key-exchange robustness factor as compared to classical block chain models. It retains compatibility with the conventional blockchain API layer while being resistant to decryption by quantum computers. This provides a quantum-resilient basis for blockchain-based cloud security and will help us gradually move towards sustainable, long-term trust and compliance in next-generation distributed ecosystems.
The rapid advancement of quantum computing threatens the security foundations of classical public-key cryptographic systems such as RSA and Elliptic Curve Cryptography (ECC), which underpin cloud and edge infrastructures. With scalable quantum algorithms capable of breaking widely deployed cryptographic primitives, organizations must transition toward quantum-resilient security models. This paper proposes a comprehensive Quantum-Resilient Cryptographic Architecture (QRCA) designed specifically for cloud and edge computing environments. The framework integrates post-quantum cryptographic (PQC) algorithms, hybrid key exchange protocols, zero-trust principles, and hardware-assisted secure enclaves. We present a layered security model that balances computational overhead, latency constraints, and scalability requirements in distributed systems. Experimental simulations evaluate performance metrics including encryption latency, key exchange overhead, and throughput across cloud data centres and edge nodes. Results indicate that hybrid PQC deployments achieve strong quantum resilience with manageable performance trade-offs. The proposed architecture offers a practical migration pathway for organizations seeking future-proof cryptographic security in distributed computing ecosystems.
The advent of quantum computing poses a significant existential threat to current public-key cryptographic standards, particularly RSA and Elliptic Curve Cryptography (ECC), which underpin global digital security. Shor's algorithm, if implemented on a sufficiently powerful quantum computer, can efficiently break these foundational schemes, rendering vast amounts of encrypted data vulnerable. This paper investigates lattice-based cryptography as a robust and promising candidate for post-quantum security. We provide a comprehensive analysis of its theoretical underpinnings, focusing on hard problems like the Shortest Vector Problem (SVP) and Learning With Errors (LWE), which are believed to be intractable even for quantum adversaries. Through a detailed literature review and methodological exposition, we examine the construction principles of prominent lattice-based Key Encapsulation Mechanisms (KEMs) and digital signature schemes, such as Kyber and Dilithium, highlighting their inherent security properties and performance characteristics. Our results demonstrate that lattice-based schemes offer competitive efficiency, compact key sizes, and strong security guarantees against both classical and quantum attacks, positioning them as essential building blocks for the post-RSA cryptographic landscape. The discussion elaborates on the practical implications, standardization efforts by NIST, and the challenges associated with the transition to quantum-resilient cryptographic infrastructure. We conclude that lattice-based cryptography is a cornerstone of quantum resilience, critical for securing future digital communications and data integrity.
The high growth rate of cloud storage companies has reshaped the digital management of data among individuals and companies. Nevertheless, the future of quantum computing spells a major danger to classical cryptographic algorithms like the RSA and the ECC which forms the backbone to the current cloud security infrastructures. In order to mitigate this new risk, this paper will present a new Post-Quantum Cryptography (PQC)-based security architecture, customized to cloud storage application. The model combines lattice-based key encapsulation models and hash-based authentication models to provide long-term data confidentiality, integrity, and non-repudiation. The basic uniqueness of the offered model is its hybrid cryptographic implementation, which will have quantum-resilient key exchange, and a hardened hash-based signature verification as a single workflow of cloud security. This assimilation improves resistance to quantum-based attacks and retains viable computational efficiency. The evaluation of performance shows that the framework can be used in large-scale and distributed cloud systems since it has a well-balanced trade-off between high quantum resilience and controllable processing overheads. The suggested PQC scheme will create moderate overhead and high future-proof security, in comparison to the traditional crypto-systems. The paper portrays the strategic value of shifting towards quantum-resistant encryption systems to guarantee long-term data security in the post-quantum future.
Conventional cryptographic constructions have to meet the challenge of the quick development of quantum computing, and they require the creation of efficient constructions resistant to quantum attack.In this paper, the authors suggest a hybrid cryptographic model that combines lattice-based hardness assumptions, such as Learning with Errors (LWE) with graph theoretical and combinatorial structures to provide greater security, efficiency and scalability.This framework is a hybrid of lattice trapdoor functions, expander graphs, and discrete optimization methods, aiming to enhance structural robustness against classical and quantum attackers.The performance is compared with the conventional methods of RSA/ECC and lattice and graph-based cryptographic methods.The results reported in this work shows that, the proposed hybrid framework provides the security level of 256 bits and quantum attack resistance as 96.8%, whereas the lattice-based approach provides 82.4%.Moreover, the hybrid construction has the key generation time 21.1ms, encryption time 14.1ms and throughput of 183Mbps.These values represent a decrease of 14.92% for the key generation time, 10.19% for the encryption time and 27.96% for the memory usage when compared to the baseline which is based on lattices.These results indicate that a combination of complementary discrete mathematical models could be a potential way to design efficient, scalable post-quantum cryptographic systems.