Quantum-ready enhancements to ECDSA

El Baraka, Mohammed; Ezzouak, Siham

doi:10.47974/JDMSC-2406

Open Access Research Article

Quantum-ready enhancements to ECDSA

^*Mohammed El BarakaCorresponding authormohammed.elbaraka5@usmba.ac.maDepartment of MathematicsFaculty of Sciences Dhar AlmahrazUniversity Sidi Mohamed Ben AbdellahFez, Morocco0009-0003-1298-0587View full profile → , Siham Ezzouaksiham.ezzouak@usmba.ac.maDepartment of MathematicsFaculty of Sciences Dhar AlmahrazUniversity Sidi Mohamed Ben AbdellahFez, Morocco0009-0000-6380-7096View full profile →

* Corresponding author · click or hover a name for details

pp. 1405–1420Vol. 29Issue 3March 2026DOI: 10.47974/JDMSC-2406 Crossmark XML

Received:: 01 Jan 2025
Published Online:: 07 Mar 2026
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-2406
Pages:: 1405–1420

Abstract

This paper proposes modifications to the Elliptic Curve Digital Signature Algorithm (ECDSA) aimed at resisting emerging quantum attacks while maintaining backward compatibility with existing blockchain protocols. We introduce a hybrid cryptographic scheme that combines classical ECDSA with post-quantum signatures, ensuring that adversaries must break both components to forge a valid signature. Furthermore, we propose a layered security model where each layer independently protects blockchain transactions against classical or quantum threats. Finally, we detail algorithmic adjustments, including larger key sizes and secure nonce generation, to mitigate near-term vulnerabilities. Our evaluation shows that these modifications provide enhanced security with moderate computational and storage overhead, paving a practical pathway for quantum readiness.

Keywords

ECDSA Blockchain Post-quantum cryptography Hybrid signatures Layered security

Subject Classifications

94A6011T7114G5081P68

References

[1] P. W. Shor, “Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer,” SIAM Journal on Computing, vol. 26, no. 5, pp. 1484-1509 (1997).
[2] D. J. Bernstein, J. Buchmann, and E. Dahmen (Eds.), Post-Quantum Cryptography. Springer-Verlag (2017).
[3] T. Yamakawa and S. Yamakawa, “Security Analysis of Quantum-Resistant Cryptographic Algorithms,” Cryptology ePrint Archive (2018).
[4] Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler and Damien Stehlé, “CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme,” NIST Post-Quantum Cryptography Standardization (2018).
[5] O. Regev, “On Lattices, Learning with Errors, Random Linear Codes, and Cryptography,” Journal of the ACM, vol. 56, no. 6 (2009).
[6] M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information. Cambridge University Press (2010).
[7] D. Johnson, A. Menezes, and S. Vanstone, “The Elliptic Curve Digital Signature Algorithm (ECDSA),” International Journal of Information Security, vol. 1, pp. 36-63 (2001).
[8] Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler and Damien Stehlé, “SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies,” in 2015 IEEE Symposium on Security and Privacy, pp. 104-121 (2015).
[9] D. Boneh, “Evaluation of Lattice-Based Signature Schemes,” Advances in Cryptology (1997).
[10] S. Galbraith, Mathematics of Public Key Cryptography. Cambridge University Press (2012).
[11] D. Hankerson, A. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography. Springer (2004).
[12] J. H. Silverman, The Arithmetic of Elliptic Curves. Springer (2009).
[13] L. C. Washington, Elliptic Curves: Number Theory and Cryptography. CRC Press (2008).
[14] H. Hasse, “Zur Theorie der abstrakten elliptischen Funktionenkörper I,” Journal für die reine und angewandte Mathematik (1936).
[15] J. H. Silverman, Advanced Topics in the Arithmetic of Elliptic Curves. Springer (1994).
[16] N. Koblitz, “Elliptic Curve Cryptosystems,” Mathematics of Computation, vol. 48, no. 177, pp. 203-209 (1987).
[17] V. S. Miller, “Use of Elliptic Curves in Cryptography,” in Advances in Cryptology: Proceedings of CRYPTO ‘85, pp. 417-426 (1985).
[18] L. K. Grover, “A Fast Quantum Mechanical Algorithm for Database Search,” in Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 212-219 (1996).
[19] M. Abouaroek and K. Ahmad, “Performance analysis of NTRU algorithm with non-post-quantum algorithms,’’ Journal of Discrete Mathematical Sciences and Cryptography, vol. 24, no. 5, pp. 1349-1363 (2021). doi:10.1080/09720529.2021.1932926.

Views: 107Downloads: 97Citations: 0