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 Discrete Mathematical Sciences and Cryptography

Graph-theoretic approaches to post-quantum cryptographic protocols

S. Gayathri, Vundela Swathi, Mohammed Aldulaimi, Sarvinoz Kasimova, Qobil Hayitov, Erdonov Bekmurod

Published Oct 31, 2026• 0 citations
Publisher

Abstract

The fast development of quantum computing poses a threat to the security of the classical cryptographic system, and so there is a need to have strong post-quantum systems that are hard to break.The issue discussed in this paper is how to develop secure and efficient cryptographic protocols, taking advantage of graph-theoretic constructions that are not vulnerable to quantum attacks.The initial goal is to create a cryptographic scheme based on graphs and with hard problems like Graph Isomorphism, Hamiltonian Path and expander graph properties.The suggested methodology combines combinatorial graph structures with algebraic transformations, which are backed up by hybrid models that combine graph embeddings and lattice-based inspired security mechanisms.The synthetic and benchmark graph datasets are experimented on and the performance is measured based on the strength of security, complexity of computation and the scale.The suggested scheme has 97.1% accuracy in attack resistance, decreases the time of key generation by 21.4% and enhances the structural security measures by 18.6% over lattice-only schemes.Compares and contrasts to show improved resilience against quantum adversaries with efficiency.The innovation in the framework is that it integrates graph-theorically to design cryptography in a hybrid manner.This research goes a long way in enhancing the security of communication between IoT, cloud and distributed systems.

DOI
10.47974/jdmsc-3010

Related papers

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

A Systematic Review of Graph-Theoretic Approaches to Post-Quantum Cryptographic Protocols: Methods, Architectures, and Future Research Directions

Tony Evans, V. Popescu, S. Ahmed

The rapid advancement of quantum computing poses a significant threat to classical cryptographic systems, necessitating the development of robust post-quantum cryptographic (PQC) protocols. Among emerging approaches, graph-theoretic techniques have gained prominence due to their computational hardness, structural flexibility, and applicability in designing secure cryptographic primitives. This paper presents a systematic review of graph-theoretic approaches to post-quantum cryptographic protocols, focusing on methods, architectures, and future research directions. The study analyzes recent developments from 2018 to 2025, examining how graph-based constructs such as expander graphs, isogeny graphs, lattice graphs, and combinatorial structures contribute to secure key exchange, encryption, and authentication mechanisms. Additionally, the integration of chaotic systems and generative artificial intelligence is explored to enhance entropy generation and adaptive security mechanisms. The review identifies key trends, including hybrid graph-chaotic models, optimization of graph traversal algorithms for cryptographic efficiency, and AI-assisted cryptanalysis resistance. Contributions of this work include a structured synthesis of 30 studies, identification of research gaps in scalability and standardization, and a comprehensive evaluation of graph-theoretic PQC within secure software engineering frameworks. The findings emphasize the potential of graph-based cryptography as a resilient paradigm in the quantum era while highlighting the need for further interdisciplinary research.

International Journal of Electrical Electronics and Computer Systems•Oct 18, 2025•0 citations

Hybrid Post-Quantum Cryptographic Approaches for Secure Communication

Eaman Raza Rizvi,Shahzada Khurram

The accelerated advancements in quantum computing substantially threaten classical cryptographic systems, particularly those that rely on RSA, ECC, and other public key encryption methods. Particularly Shor's method shows how easily conventional cryptographic techniques might be broken; therefore quick development of quantum resistant substitutes is necessary. Rising as a potential answer with cryptographic algorithms meant to resist quantum attacks is post quantum cryptography (PQC). Nonetheless, performance trade-offs, compatibility problems, and the absence of standardized implementations make the shift to completely quantum-safe cryptographic systems very difficult. Hybrid PQC systems that combine conventional and quantum resistant cryptographic mechanisms have been suggested as a workable method for tackling these difficulties so guaranteeing security in the post quantum future. Emphasizing their security, performance, and practical implementations, this review article offers a thorough study of hybrid PQC methods. The resistance of many hybrid cryptographic models including lattice-based, code-based, and multivariate cryptographic techniques against quantum attacks is comprehensively investigated in this work methodologically, we review current PQC hybrid models, evaluate their computing efficiency, and examine security criteria grounded on recent research and standardizing initiatives like those under NIST. Our results show that hybrid PQC models create difficulties in terms of key management, computational overhead, and implementation complexity even if they improve security by reducing risks related with both conventional and quantum attacks. A comparative study shows among several hybrid systems the trade-offs in terms of encryption speed, key sizes, and resource use. Moreover showing the feasibility of PQC hybridizing in IoT, cloud computing, and block chain security are pragmatic uses of PQC hybridizing in which case appropriate protocols are needed for broad acceptance. At last, our work emphasizes the significant contribution hybrid PQC models provide in the transitional period producing a quantum secure environment. To enable basic integration into the present digital infrastructure, future research should focus on improving the efficiency of hybrid cryptosystems, optimizing key exchange mechanisms, and regulating standardization concerns. The findings of this study support the present discussion on post quantum security and provide data for academics and corporate leaders aiming for the next generation of cryptographic solutions. https://doi.org/10.5281/zenodo.17873992

Annual Methodological Archive Research Review•Jun 18, 2025•0 citations

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

Post-Quantum Cryptographic Algorithms for Secure Communication in Decentralized Blockchain and Cloud Infrastructure

The advent of quantum computing poses an existential threat to contemporary cryptographic standards, particularly those securing decentralized blockchain networks and cloud infrastructures.Classical public-key cryptosystems such as RSA, ECC, and DH, which rely on factorization and discrete logarithm problems, are rendered obsolete by Shor's algorithm, necessitating the transition toward post-quantum cryptographic (PQC) solutions.This study explores the integration of PQC algorithms, including lattice-based, hash-based, code-based, multivariate, and isogeny-based cryptographic mechanisms, within blockchain-ledger technologies and cloud architectures to ensure long-term security against quantum adversaries.A comparative analysis is conducted to evaluate computational efficiency, key size implications, communication overhead, and security resilience under quantum attack models.The research highlights the adaptation of PQC within blockchain consensus mechanisms, smart contract execution, and cryptographic primitives such as digital signatures, zero-knowledge proofs, and secure multi-party computation (MPC).Additionally, it examines the impact of PQC on cloud security, addressing challenges in quantum-safe key exchange protocols, homomorphic encryption for secure computations, and cross-platform interoperability within hybrid quantum-classical cloud ecosystems.Real-world implementations and benchmarking data provide insights into the feasibility of large-scale adoption, shedding light on standardization efforts by NIST and industry consortia.The study concludes with future directions, emphasizing the need for efficient PQC algorithm optimization, lightweight cryptographic frameworks for IoT-driven blockchain applications, and scalable post-quantum identity management systems.By establishing quantum-resistant security frameworks, this research underscores the imperative need for early adoption to mitigate cryptographic vulnerabilities in the impending post-quantum era.

International Journal of Computer Applications Technology and Research•Feb 13, 2025•7 citations

Quantum-Resilient Cryptographic Frameworks for Post-Quantum Cloud and Edge Computing

Aswathy P S

The rapid advancement of quantum computing introduces unprecedented security threats to modern cloud and edge computing infrastructures. Classical public-key cryptographic algorithms such as RSA, Diffie–Hellman, and Elliptic Curve Cryptography (ECC) are fundamentally vulnerable to quantum attacks enabled by Shor’s algorithm. As a result, the confidentiality, integrity, and authenticity of data stored and processed in distributed systems are at serious risk.Post-quantum cryptography (PQC) aims to develop cryptographic algorithms that are resistant to both classical and quantum adversaries. This paper presents a comprehensive quantum-resilient cryptographic framework designed specifically for post-quantum cloud and edge computing environments. The framework integrates post-quantum cryptographic primitives, hybrid cryptographic approaches, crypto-agile architectures, and secure key management mechanisms. The proposed framework addresses performance constraints, scalability requirements, and deployment challenges in heterogeneous environments. A detailed discussion of security threats, architectural components, performance considerations, and future research directions is provided. The proposed approach enables longterm security and supports a smooth transition toward quantum-safe distributed computing systems.

•Feb 12, 2026•0 citations
The fast development of quantum computing poses a threat to the security of the classical cryptographic system, and so there is a need to have strong post-quantum systems that are hard to break.The issue discussed in this paper is how to develop secure and efficient cryptographic protocols, taking advantage of graph-theoretic constructions that are not vulnerable to quantum attacks.The initial goal is to create a cryptographic scheme based on graphs and with hard problems like Graph Isomorphism, Hamiltonian Path and expander graph properties.The suggested methodology combines combinatorial graph structures with algebraic transformations, which are backed up by hybrid models that combine graph embeddings and lattice-based inspired security mechanisms.The synthetic and benchmark graph datasets are experimented on and the performance is measured based on the strength of security, complexity of computation and the scale.The suggested scheme has 97.1% accuracy in attack resistance, decreases the time of key generation by 21.4% and enhances the structural security measures by 18.6% over lattice-only schemes.Compares and contrasts to show improved resilience against quantum adversaries with efficiency.The innovation in the framework is that it integrates graph-theorically to design cryptography in a hybrid manner.This research goes a long way in enhancing the security of communication between IoT, cloud and distributed systems.
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.
The rapid advancement of quantum computing poses a significant threat to classical cryptographic systems, necessitating the development of robust post-quantum cryptographic (PQC) protocols. Among emerging approaches, graph-theoretic techniques have gained prominence due to their computational hardness, structural flexibility, and applicability in designing secure cryptographic primitives. This paper presents a systematic review of graph-theoretic approaches to post-quantum cryptographic protocols, focusing on methods, architectures, and future research directions. The study analyzes recent developments from 2018 to 2025, examining how graph-based constructs such as expander graphs, isogeny graphs, lattice graphs, and combinatorial structures contribute to secure key exchange, encryption, and authentication mechanisms. Additionally, the integration of chaotic systems and generative artificial intelligence is explored to enhance entropy generation and adaptive security mechanisms. The review identifies key trends, including hybrid graph-chaotic models, optimization of graph traversal algorithms for cryptographic efficiency, and AI-assisted cryptanalysis resistance. Contributions of this work include a structured synthesis of 30 studies, identification of research gaps in scalability and standardization, and a comprehensive evaluation of graph-theoretic PQC within secure software engineering frameworks. The findings emphasize the potential of graph-based cryptography as a resilient paradigm in the quantum era while highlighting the need for further interdisciplinary research.
The accelerated advancements in quantum computing substantially threaten classical cryptographic systems, particularly those that rely on RSA, ECC, and other public key encryption methods. Particularly Shor's method shows how easily conventional cryptographic techniques might be broken; therefore quick development of quantum resistant substitutes is necessary. Rising as a potential answer with cryptographic algorithms meant to resist quantum attacks is post quantum cryptography (PQC). Nonetheless, performance trade-offs, compatibility problems, and the absence of standardized implementations make the shift to completely quantum-safe cryptographic systems very difficult. Hybrid PQC systems that combine conventional and quantum resistant cryptographic mechanisms have been suggested as a workable method for tackling these difficulties so guaranteeing security in the post quantum future. Emphasizing their security, performance, and practical implementations, this review article offers a thorough study of hybrid PQC methods. The resistance of many hybrid cryptographic models including lattice-based, code-based, and multivariate cryptographic techniques against quantum attacks is comprehensively investigated in this work methodologically, we review current PQC hybrid models, evaluate their computing efficiency, and examine security criteria grounded on recent research and standardizing initiatives like those under NIST. Our results show that hybrid PQC models create difficulties in terms of key management, computational overhead, and implementation complexity even if they improve security by reducing risks related with both conventional and quantum attacks. A comparative study shows among several hybrid systems the trade-offs in terms of encryption speed, key sizes, and resource use. Moreover showing the feasibility of PQC hybridizing in IoT, cloud computing, and block chain security are pragmatic uses of PQC hybridizing in which case appropriate protocols are needed for broad acceptance. At last, our work emphasizes the significant contribution hybrid PQC models provide in the transitional period producing a quantum secure environment. To enable basic integration into the present digital infrastructure, future research should focus on improving the efficiency of hybrid cryptosystems, optimizing key exchange mechanisms, and regulating standardization concerns. The findings of this study support the present discussion on post quantum security and provide data for academics and corporate leaders aiming for the next generation of cryptographic solutions. https://doi.org/10.5281/zenodo.17873992
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.
The advent of quantum computing poses an existential threat to contemporary cryptographic standards, particularly those securing decentralized blockchain networks and cloud infrastructures.Classical public-key cryptosystems such as RSA, ECC, and DH, which rely on factorization and discrete logarithm problems, are rendered obsolete by Shor's algorithm, necessitating the transition toward post-quantum cryptographic (PQC) solutions.This study explores the integration of PQC algorithms, including lattice-based, hash-based, code-based, multivariate, and isogeny-based cryptographic mechanisms, within blockchain-ledger technologies and cloud architectures to ensure long-term security against quantum adversaries.A comparative analysis is conducted to evaluate computational efficiency, key size implications, communication overhead, and security resilience under quantum attack models.The research highlights the adaptation of PQC within blockchain consensus mechanisms, smart contract execution, and cryptographic primitives such as digital signatures, zero-knowledge proofs, and secure multi-party computation (MPC).Additionally, it examines the impact of PQC on cloud security, addressing challenges in quantum-safe key exchange protocols, homomorphic encryption for secure computations, and cross-platform interoperability within hybrid quantum-classical cloud ecosystems.Real-world implementations and benchmarking data provide insights into the feasibility of large-scale adoption, shedding light on standardization efforts by NIST and industry consortia.The study concludes with future directions, emphasizing the need for efficient PQC algorithm optimization, lightweight cryptographic frameworks for IoT-driven blockchain applications, and scalable post-quantum identity management systems.By establishing quantum-resistant security frameworks, this research underscores the imperative need for early adoption to mitigate cryptographic vulnerabilities in the impending post-quantum era.
The rapid advancement of quantum computing introduces unprecedented security threats to modern cloud and edge computing infrastructures. Classical public-key cryptographic algorithms such as RSA, Diffie–Hellman, and Elliptic Curve Cryptography (ECC) are fundamentally vulnerable to quantum attacks enabled by Shor’s algorithm. As a result, the confidentiality, integrity, and authenticity of data stored and processed in distributed systems are at serious risk.Post-quantum cryptography (PQC) aims to develop cryptographic algorithms that are resistant to both classical and quantum adversaries. This paper presents a comprehensive quantum-resilient cryptographic framework designed specifically for post-quantum cloud and edge computing environments. The framework integrates post-quantum cryptographic primitives, hybrid cryptographic approaches, crypto-agile architectures, and secure key management mechanisms. The proposed framework addresses performance constraints, scalability requirements, and deployment challenges in heterogeneous environments. A detailed discussion of security threats, architectural components, performance considerations, and future research directions is provided. The proposed approach enables longterm security and supports a smooth transition toward quantum-safe distributed computing systems.