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

Advanced Quantum Technologies

Efficient Key Compression in Isogeny‐Based Post‐Quantum Cryptography: A PSO‐WCA Hybrid Optimization Approach

Janani Sankaran, A. Chandrasekar

Published Apr 1, 2026• 0 citations
Publisher

Abstract

ABSTRACT Isogeny‐based cryptography is an advanced post‐quantum cryptography mechanism. Key compression becomes an important area for Isogeny‐based cryptography systems to perform efficiently. However, an important issue emerges that is connected to the use of large keys in such cryptographic systems. The use of large keys has led to several practical problems, such as key management, storage, and transmission being time‐consuming and resource‐intensive. To tackle all such problems, an innovative and hybrid approach that uses particle swarm optimization and water cycle algorithm optimization for key compression is proposed in this research work to efficiently balance and maintain key size reduction and post‐quantum security. The most important role of particle swarm optimization is to determine the optimization of key compression. On the other hand, the water cycle algorithm primarily concentrates on diversification to maintain security levels. Moreover, this proposed approach also tries to efficiently balance and maintain a reduced key size, which ensures that security levels are focused on side channel and timing attacks. Based on several simulation results, the proposed algorithm successfully calculates the average key size reduction of 45.2%, which is achieved with the fast execution of computation times averaging 175.6 ms for key compression.

DOI
10.1002/qute.202400360

Related papers

Isogeny-based cryptosystems for post-quantum security

R. Kapgate, Dheeravath Raju, Chetansinh Vaghela +3 more

The fast progress of quantum computing is a serious threat to classical cryptographic schemes like RSA and elliptic curve cryptography, and it is time to come up with safe postquantum schemes.One of the new solutions is isogeny-based cryptography which has attracted attention because of its good-security basis and comparatively small key sizes.Nevertheless, currently used post-quantum cryptographic (PQC) designs, such as lattice-based and codebased ones, are typically characterized by the high key sizes, high computational costs, or scaling issues, with the necessity to have a well-balanced and efficient cryptographic design.This paper presents a powerful isogeny-based cryptosystem, which can allow safe communication in the post-quantum context.The mathematical complexity of isogenies over supersingular elliptic curves forms the foundation of the proposed framework and it has a structured architecture comprising of parameterization, key generation, encryption/decryption and communication layers.The design of the optimization of algorithms to generate keys, exchange keys securely and encrypt messages using shared secret derivation mechanisms is part of the methodology.Security analysis is also carried out to assess the resistance to quantum attacks and against known cryptanalytic vulnerabilities.The metrics used to conduct performance evaluation are computed cost, key size, and latency, and the results are compared to typical PQC schemes, like lattice-based (Kyber) and code-based (McEliece) systems.The results show that the model proposed has much smaller key sizes (330 bytes public key) with moderate computational efficiency although a little bit more latency than lattice-based methods.

Journal of Discrete Mathematical Sciences and Cryptography•Oct 31, 2026•0 citations

Post-Quantum Cryptography: A Review of Algorithms, Challenges, and Future Research Directions

Parth Sane, Samrat Pravin Patel

The advance of quantum computing poses significant risks to traditional cryptographic systems, including RSA and ECC, due to algorithms such as Shor’s, prompting an urgent need for robust post-quantum cryptography (PQC) solutions. This paper presents a systematic review of PQC algorithms, encompassing lattice-based, code-based, multivariate polynomial, hash-based, and supersingular isogeny-based cryptography. By evaluating recent publications and NIST standardization efforts, we assess these approaches in terms of quantum resistance, computational efficiency, scalability, and implementation challenges. Lattice-based schemes, notably CRYSTALS-Kyber, excel in quantum-secure encryption and performance, whereas code-based systems like McEliece are hindered by large key sizes. Hash-based signatures, such as SPHINCS+, and isogeny-based protocols, including SIDH, provide promising alternatives but require further optimization to reduce computational overhead. Our analysis highlights the potential of hybrid PQC methods and lightweight hardware implementations for securing emerging domains like IoT, blockchain, and financial systems. The review serves as a foundational resource for researchers and practitioners, advocating the adoption of quantum-resistant cryptography to preserve data confidentiality, integrity, and authenticity in the quantum era.

International Conference on Signal Processing and Information Security (ICSPIS)•Nov 18, 2025•1 citation

Cryptographic algorithm optimization for defense data security using quantum inspired algorithms

Bagus Hendra Saputra, Jonson Manurung, Jeremia Paskah Sinaga

The rapid advancement of quantum computing poses a critical threat to classical public-key cryptographic systems widely used in defense communication infrastructures, while the practical deployment of post-quantum cryptography (PQC) remains constrained by excessive key sizes, computational overhead, and energy consumption in bandwidth- and latency-sensitive military environments. This study aims to develop and evaluate a quantum-inspired multi-objective optimization framework to enhance the operational feasibility of standardized PQC schemes without compromising cryptographic security. The proposed method applies a Quantum Genetic Algorithm (QGA) to optimize configuration parameters of CRYSTALS-Kyber and CRYSTALS-Dilithium by simultaneously balancing security strength, computational performance, resource efficiency, and deployability. Experiments were conducted using official NIST test vectors and defense-oriented communication scenarios, with performance evaluated across encryption and signature latency, throughput, key and signature sizes, memory footprint, and energy consumption, while security was validated against classical and quantum attack models. The results demonstrate that the optimized configurations achieve key and signature size reductions of up to 10.3%, throughput improvements of up to 15.5%, and energy consumption reductions of up to 12.5% compared to baseline NIST implementations, while fully maintaining NIST security levels and robust resistance to quantum adversaries. These improvements significantly enhance the suitability of PQC for tactical radios, satellite communications, and resource-constrained defense platforms. The findings indicate that quantum-inspired multi-objective optimization is a critical enabler for transitioning post-quantum cryptography from theoretical security constructs to deployable, mission-ready solutions in real-world defense systems.

Journal of Defense Technology and Engineering•Jan 26, 2026•0 citations

A comparative study of isogeny-based and elliptic curve cryptographic protocols for post-quantum secure applications

Prerana Khairnar, Prashant Suryavanshi, Arti Suryavanshi +3 more

The fast development of quantum computing presents a major challenge to classical public-key cryptographic systems and especially the Elliptic Curve Cryptography (ECC) which is based on the hardness of the elliptic curve discrete logarithm problem.This paper provides a comparative study of isogeny-based cryptographic protocols with ECC-based schemes of postquantum secure applications.A SIKE-like protocol is adopted and used to test isogeny-based mechanisms under real-world conditions, in addition to typical ECC protocols.The comparison is based on the size of key, complexity of computation, use of memory and communication latency.Experimental results show that, whereas ECC is more efficient and has lower latency in a classical setting, isogeny-based schemes have a higher resistance to quantum attacks, but with a higher computational cost.The findings show a performance-quantum security trade-off, thus requiring to design optimized hybrid cryptographic frameworks in the future to support a secure communication system.

Journal of Discrete Mathematical Sciences and Cryptography•Oct 31, 2026•0 citations

Key Compression for Isogeny-Based Cryptosystems

Reza Azarderakhsh, David Jao, Kassem Kalach +2 more

We present a method for key compression in quantumresistant isogeny-based cryptosystems, which allows a reduction in and transmission costs of per-party public information by a factor of two, with no e ect on security. We achieve this reduction by associating a canonical choice of elliptic curve to each j-invariant, and representing elements on the curve as linear combinations with respect to a canonical choice of basis. This method of compressing public information can be applied to numerous isogeny-based protocols, such as key exchange, zero-knowledge identi cation, and public-key encryption. We performed personal computer and ARM implementations of the key exchange with compression and decompression in C and provided timing results, showing the computational cost of key compression and decompression at various security levels. Our results show that isogeny-based cryptosystems achieve by far the smallest possible key sizes among all existing families of post-quantum cryptosystems at practical security levels; e.g. 3073-bit public keys at the quantum 128-bit security level, comparable to (non-quantum) RSA key sizes.

•May 24, 2016•96 citations

Quantum Cryptography Protocols Ensuring Secure Communication in the Era of Quantum Computing

J. Kamalakumari, Ajmeera Kiran, G. S. V. Radha +3 more

Quantum cryptography has emerged as a revolutionary technology for ensuring secure communication in the era of quantum computing. While existing research primarily focuses on theoretical frameworks and small-scale experimental setups, significant challenges remain in practical implementation, scalability, and security vulnerabilities. This study aims to bridge the gap between theory and real-world deployment by developing robust quantum cryptographic protocols that address key challenges such as noise management, side-channel attacks, and Trojan horse attacks. Additionally, we propose an optimized quantum key distribution (QKD) mechanism that ensures secure communication over long distances under realistic conditions. Our research integrates post-quantum cryptography with quantum cryptographic techniques to provide a hybrid security model that is resilient against both classical and quantum computing threats. By leveraging commercially available quantum hardware and advanced randomness extraction methods, this study contributes to the development of scalable, secure, and efficient quantum communication networks. The findings of this research will play a crucial role in advancing secure digital communication systems and fortifying data security in the post-quantum era.

•Mar 25, 2025•0 citations
ABSTRACT Isogeny‐based cryptography is an advanced post‐quantum cryptography mechanism. Key compression becomes an important area for Isogeny‐based cryptography systems to perform efficiently. However, an important issue emerges that is connected to the use of large keys in such cryptographic systems. The use of large keys has led to several practical problems, such as key management, storage, and transmission being time‐consuming and resource‐intensive. To tackle all such problems, an innovative and hybrid approach that uses particle swarm optimization and water cycle algorithm optimization for key compression is proposed in this research work to efficiently balance and maintain key size reduction and post‐quantum security. The most important role of particle swarm optimization is to determine the optimization of key compression. On the other hand, the water cycle algorithm primarily concentrates on diversification to maintain security levels. Moreover, this proposed approach also tries to efficiently balance and maintain a reduced key size, which ensures that security levels are focused on side channel and timing attacks. Based on several simulation results, the proposed algorithm successfully calculates the average key size reduction of 45.2%, which is achieved with the fast execution of computation times averaging 175.6 ms for key compression.
The fast progress of quantum computing is a serious threat to classical cryptographic schemes like RSA and elliptic curve cryptography, and it is time to come up with safe postquantum schemes.One of the new solutions is isogeny-based cryptography which has attracted attention because of its good-security basis and comparatively small key sizes.Nevertheless, currently used post-quantum cryptographic (PQC) designs, such as lattice-based and codebased ones, are typically characterized by the high key sizes, high computational costs, or scaling issues, with the necessity to have a well-balanced and efficient cryptographic design.This paper presents a powerful isogeny-based cryptosystem, which can allow safe communication in the post-quantum context.The mathematical complexity of isogenies over supersingular elliptic curves forms the foundation of the proposed framework and it has a structured architecture comprising of parameterization, key generation, encryption/decryption and communication layers.The design of the optimization of algorithms to generate keys, exchange keys securely and encrypt messages using shared secret derivation mechanisms is part of the methodology.Security analysis is also carried out to assess the resistance to quantum attacks and against known cryptanalytic vulnerabilities.The metrics used to conduct performance evaluation are computed cost, key size, and latency, and the results are compared to typical PQC schemes, like lattice-based (Kyber) and code-based (McEliece) systems.The results show that the model proposed has much smaller key sizes (330 bytes public key) with moderate computational efficiency although a little bit more latency than lattice-based methods.
The advance of quantum computing poses significant risks to traditional cryptographic systems, including RSA and ECC, due to algorithms such as Shor’s, prompting an urgent need for robust post-quantum cryptography (PQC) solutions. This paper presents a systematic review of PQC algorithms, encompassing lattice-based, code-based, multivariate polynomial, hash-based, and supersingular isogeny-based cryptography. By evaluating recent publications and NIST standardization efforts, we assess these approaches in terms of quantum resistance, computational efficiency, scalability, and implementation challenges. Lattice-based schemes, notably CRYSTALS-Kyber, excel in quantum-secure encryption and performance, whereas code-based systems like McEliece are hindered by large key sizes. Hash-based signatures, such as SPHINCS+, and isogeny-based protocols, including SIDH, provide promising alternatives but require further optimization to reduce computational overhead. Our analysis highlights the potential of hybrid PQC methods and lightweight hardware implementations for securing emerging domains like IoT, blockchain, and financial systems. The review serves as a foundational resource for researchers and practitioners, advocating the adoption of quantum-resistant cryptography to preserve data confidentiality, integrity, and authenticity in the quantum era.
The rapid advancement of quantum computing poses a critical threat to classical public-key cryptographic systems widely used in defense communication infrastructures, while the practical deployment of post-quantum cryptography (PQC) remains constrained by excessive key sizes, computational overhead, and energy consumption in bandwidth- and latency-sensitive military environments. This study aims to develop and evaluate a quantum-inspired multi-objective optimization framework to enhance the operational feasibility of standardized PQC schemes without compromising cryptographic security. The proposed method applies a Quantum Genetic Algorithm (QGA) to optimize configuration parameters of CRYSTALS-Kyber and CRYSTALS-Dilithium by simultaneously balancing security strength, computational performance, resource efficiency, and deployability. Experiments were conducted using official NIST test vectors and defense-oriented communication scenarios, with performance evaluated across encryption and signature latency, throughput, key and signature sizes, memory footprint, and energy consumption, while security was validated against classical and quantum attack models. The results demonstrate that the optimized configurations achieve key and signature size reductions of up to 10.3%, throughput improvements of up to 15.5%, and energy consumption reductions of up to 12.5% compared to baseline NIST implementations, while fully maintaining NIST security levels and robust resistance to quantum adversaries. These improvements significantly enhance the suitability of PQC for tactical radios, satellite communications, and resource-constrained defense platforms. The findings indicate that quantum-inspired multi-objective optimization is a critical enabler for transitioning post-quantum cryptography from theoretical security constructs to deployable, mission-ready solutions in real-world defense systems.
The fast development of quantum computing presents a major challenge to classical public-key cryptographic systems and especially the Elliptic Curve Cryptography (ECC) which is based on the hardness of the elliptic curve discrete logarithm problem.This paper provides a comparative study of isogeny-based cryptographic protocols with ECC-based schemes of postquantum secure applications.A SIKE-like protocol is adopted and used to test isogeny-based mechanisms under real-world conditions, in addition to typical ECC protocols.The comparison is based on the size of key, complexity of computation, use of memory and communication latency.Experimental results show that, whereas ECC is more efficient and has lower latency in a classical setting, isogeny-based schemes have a higher resistance to quantum attacks, but with a higher computational cost.The findings show a performance-quantum security trade-off, thus requiring to design optimized hybrid cryptographic frameworks in the future to support a secure communication system.
We present a method for key compression in quantumresistant isogeny-based cryptosystems, which allows a reduction in and transmission costs of per-party public information by a factor of two, with no e ect on security. We achieve this reduction by associating a canonical choice of elliptic curve to each j-invariant, and representing elements on the curve as linear combinations with respect to a canonical choice of basis. This method of compressing public information can be applied to numerous isogeny-based protocols, such as key exchange, zero-knowledge identi cation, and public-key encryption. We performed personal computer and ARM implementations of the key exchange with compression and decompression in C and provided timing results, showing the computational cost of key compression and decompression at various security levels. Our results show that isogeny-based cryptosystems achieve by far the smallest possible key sizes among all existing families of post-quantum cryptosystems at practical security levels; e.g. 3073-bit public keys at the quantum 128-bit security level, comparable to (non-quantum) RSA key sizes.
Quantum cryptography has emerged as a revolutionary technology for ensuring secure communication in the era of quantum computing. While existing research primarily focuses on theoretical frameworks and small-scale experimental setups, significant challenges remain in practical implementation, scalability, and security vulnerabilities. This study aims to bridge the gap between theory and real-world deployment by developing robust quantum cryptographic protocols that address key challenges such as noise management, side-channel attacks, and Trojan horse attacks. Additionally, we propose an optimized quantum key distribution (QKD) mechanism that ensures secure communication over long distances under realistic conditions. Our research integrates post-quantum cryptography with quantum cryptographic techniques to provide a hybrid security model that is resilient against both classical and quantum computing threats. By leveraging commercially available quantum hardware and advanced randomness extraction methods, this study contributes to the development of scalable, secure, and efficient quantum communication networks. The findings of this research will play a crucial role in advancing secure digital communication systems and fortifying data security in the post-quantum era.