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

International Conference on Electronics and Sustainable Communication Systems (ICESC)

Performance and Comparative Analysis of Lattice based PQC and Elliptic Curve Cryptography

Belcy D Mathews, Lagishetty Pavan Kumar, Muddasani Santhosh Varma, Paruvella Shobhith Sharma

Published Aug 1, 2026• 0 citations
Publisher
DOI
10.1109/icesc70182.2026.11687240

Related papers

Elliptic Curve Cryptography Reimagined: Post-Quantum Resilience Through Isogeny Graphs

PAULO SÉRGIO DE ANDRADE

The impending arrival of large-scale quantum computers poses a significant threat to modern public-key cryptography, which is largely based on the hardness of integer factorization and the discrete logarithm problem. Elliptic Curve Cryptography (ECC), a cornerstone of current digital security, is particularly vulnerable to attacks by quantum algorithms, notably Shor's algorithm. This has catalyzed the development of Post-Quantum Cryptography (PQC), a new generation of cryptographic systems designed to be secure against both classical and quantum adversaries. Among the various PQC families, isogeny-based cryptography has emerged as a compelling, albeit complex, candidate. This paper explores the reimagination of elliptic curve principles for a post-quantum world through the lens of isogeny graphs. We provide a comprehensive overview of the transition from classical ECC to isogeny-based schemes, detailing the mathematical foundations of elliptic curve isogenies and the construction of supersingular isogeny graphs. The core of our analysis focuses on how the problem of finding a secret isogeny path between two curves in this graph forms the basis for quantum-resistant cryptographic protocols. We review the evolution of seminal protocols such as Supersingular Isogeny Diffie-Hellman (SIDH) and its variants, discussing their initial promise. Crucially, the paper also addresses the recent groundbreaking cryptanalytic attacks on SIDH, which have reshaped the landscape of isogeny-based cryptography. We analyze the implications of these attacks and the ongoing research to develop new, more secure isogeny-based schemes like SQISign. By comparing the performance metrics (key size, performance, security) of isogeny-based systems with other leading PQC candidates, such as those based on lattices and codes, this paper offers a balanced perspective on their potential role in future cryptographic standards.

•Nov 19, 2025•0 citations

Lattice-Based Cryptography: A Survey

Xiaoyun Wang, Guangwu Xu, Yang Yu

Chinese Annals of Mathematics Series B•Nov 1, 2023•45 citations

An Analysis of Lattice-Based Cryptography with Existing Protocols

Atul Chaturvedi, Anand Ballabh Joshi, Sonam Yadav

Algorithms for intelligent systems•Jan 1, 2025•0 citations

Comparative Analysis of Elliptic Curve and Lattice Based Cryptography

Amanda Davenport, Sachin S. Shetty

In this paper, we provide a mathematical background and analysis of Lattice Based Cryptography for the less mathematically mature reader. Discussing the benefits and constraints of Lattice Based Crypto, we compare and contrast with Elliptic Curve Cryptography to provide an understanding of what the limitations of Lattice Based Cryptography are, and what needs to be achieved for the quantum resistant protocols to be deploy-able to any and all devices.

Annual Modeling and Simulation Conference (ANNSIM)•Jul 19, 2021•2 citations

Mathematical Cryptography and Quantum Resistance: Designing Secure Elliptic Curve Systems for the Post-Quantum Era

Murtaza Hussain Shar, Imran Ahmad Khan, Muhammad Naeem

The rapid advancement of quantum computing has posed a significant threat to traditional public-key cryptographic systems, particularly those based on elliptic curve cryptography (ECC). Although ECC has long been valued for its strong classical security and computational efficiency, quantum algorithms capable of solving the elliptic curve discrete logarithm problem would render these systems vulnerable in the near future. This study investigated how secure elliptic-curve-based cryptographic systems could be redesigned for the post-quantum era by integrating post-quantum cryptographic (PQC) primitives into hybrid security architectures. A design-oriented and analytical research approach was employed to compare classical ECC, standalone PQC, and hybrid ECC–PQC models using quantitative measures of security strength, computational cost, and communication overhead. The results demonstrated that while ECC provided excellent performance, it lacked quantum resistance, whereas PQC offered strong quantum-safe security at the cost of higher computational and bandwidth requirements. The hybrid ECC–PQC approach achieved the most balanced outcome, combining high classical efficiency with robust quantum resistance and strong long-term security. Numerical performance evaluation showed that hybrid systems increased execution time and handshake size moderately compared to PQC alone, yet delivered significantly improved security guarantees. These findings confirmed that hybrid cryptographic architectures represent a practical and reliable pathway for migrating existing elliptic-curve infrastructures toward quantum-resilient security. The study contributed a mathematically grounded and deployment-oriented framework that supports secure, gradual transition strategies for protecting digital communications in a quantum-enabled future.

Global Research Journal of Natural Science and Technology•Mar 31, 2025•0 citations

Recent Advances in Lattice-Based Cryptography

Pingyuan Zhang, Han Jiang, Jie Cai +3 more

Journal of Computer Research and Development•Oct 1, 2017•0 citations
The impending arrival of large-scale quantum computers poses a significant threat to modern public-key cryptography, which is largely based on the hardness of integer factorization and the discrete logarithm problem. Elliptic Curve Cryptography (ECC), a cornerstone of current digital security, is particularly vulnerable to attacks by quantum algorithms, notably Shor's algorithm. This has catalyzed the development of Post-Quantum Cryptography (PQC), a new generation of cryptographic systems designed to be secure against both classical and quantum adversaries. Among the various PQC families, isogeny-based cryptography has emerged as a compelling, albeit complex, candidate. This paper explores the reimagination of elliptic curve principles for a post-quantum world through the lens of isogeny graphs. We provide a comprehensive overview of the transition from classical ECC to isogeny-based schemes, detailing the mathematical foundations of elliptic curve isogenies and the construction of supersingular isogeny graphs. The core of our analysis focuses on how the problem of finding a secret isogeny path between two curves in this graph forms the basis for quantum-resistant cryptographic protocols. We review the evolution of seminal protocols such as Supersingular Isogeny Diffie-Hellman (SIDH) and its variants, discussing their initial promise. Crucially, the paper also addresses the recent groundbreaking cryptanalytic attacks on SIDH, which have reshaped the landscape of isogeny-based cryptography. We analyze the implications of these attacks and the ongoing research to develop new, more secure isogeny-based schemes like SQISign. By comparing the performance metrics (key size, performance, security) of isogeny-based systems with other leading PQC candidates, such as those based on lattices and codes, this paper offers a balanced perspective on their potential role in future cryptographic standards.
The rapid advancement of quantum computing has posed a significant threat to traditional public-key cryptographic systems, particularly those based on elliptic curve cryptography (ECC). Although ECC has long been valued for its strong classical security and computational efficiency, quantum algorithms capable of solving the elliptic curve discrete logarithm problem would render these systems vulnerable in the near future. This study investigated how secure elliptic-curve-based cryptographic systems could be redesigned for the post-quantum era by integrating post-quantum cryptographic (PQC) primitives into hybrid security architectures. A design-oriented and analytical research approach was employed to compare classical ECC, standalone PQC, and hybrid ECC–PQC models using quantitative measures of security strength, computational cost, and communication overhead. The results demonstrated that while ECC provided excellent performance, it lacked quantum resistance, whereas PQC offered strong quantum-safe security at the cost of higher computational and bandwidth requirements. The hybrid ECC–PQC approach achieved the most balanced outcome, combining high classical efficiency with robust quantum resistance and strong long-term security. Numerical performance evaluation showed that hybrid systems increased execution time and handshake size moderately compared to PQC alone, yet delivered significantly improved security guarantees. These findings confirmed that hybrid cryptographic architectures represent a practical and reliable pathway for migrating existing elliptic-curve infrastructures toward quantum-resilient security. The study contributed a mathematically grounded and deployment-oriented framework that supports secure, gradual transition strategies for protecting digital communications in a quantum-enabled future.