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

Asia-Pacific Journal of Information Technology and Multimedia

Feasibility of Post-Quantum Cryptography in Digital Signature Systems: From Theory to Proof of Concept

Nurul Syafiqah Norihsan

Published Jun 30, 2026• 0 citations
Publisher
DOI
10.17576/apjitm-2026-1501-05

Related papers

Post-Quantum Digital Signatures in Transport Documents

V. S. Moskvin

Asymmetric cryptography plays a critical role in the security, authenticity and sustainability of widely used electronic documents on a level comparable to the security and authenticity of a traditional paper documents in transport and logistics. However, security of the majority of the asymmetric cryptographic techniques currently in use, including those used to confirm the validity of electronic documents, will be compromised due to the forthcoming development of quantum computers. The concept of a quantum computer is no longer just a theory. The race for supremacy in quantum technology is on among countries since it is the most drastic technology in the world. On a large enough quantum computer, an attacker can easily generate fake digital signatures by applying Shor’s algorithm. Digital communications and electronic transactions could be devoid of the guarantee of authenticity and non-repudiation if this vulnerability is not addressed. Post-quantum cryptography strives to provide useful techniques that are resistant to attacks utilizing quantum computers in order to address the threat to existing asymmetric cryptography. In this research, we examine the current post-quantum digital signature algorithms used to confirm the validity of an electronic document in addition to comprehending the utilization of digital signing. Overall, we conclude that in order to define the next generation of electronic documents and to address the quantum threat, it is crucial to standardize a quantum-resistant digital signature scheme.

Intelligent Technologies and Electronic Devices in Vehicle and Road Transport Complex (TIRVED)•Nov 10, 2022•2 citations

Research and Development of Post-Quantum Digital Signature

Qirui Luo

International Conference on Data Science, Advanced Algorithms and Intelligent Computing (DAI)•Jan 1, 2025•0 citations

Post-Quantum Hybrid Digital Signatures: Bridging Classical and Quantum-Resistant Cryptography

Jitendra Kumar, Balaji Rajendran, Aashish Banati +2 more

IEEE International Conference on Public Key Infrastructure and its Applications (PKIA)•Sep 3, 2025•0 citations

Progress in Lattice-Based Digital Signature

Pooja Bhatt, Rachna Navalakhe

Mostly, existing public-key cryptosystems are constructed on the mathematical complexity of large integer factorization and solving discrete logarithms, which will be irresistible to attacks of future quantum computers. Due to the rapidly growing vulnerabilities in cryptographic systems recently, post-quantum cryptography (PQC) has turned out to be a need for the crypto community and has become a necessary research domain for the welfare of society. Lattice-based cryptography is measured as the most capable PQC because of its intense security proofs based on worst-case hardness, balanced performance in security, and efficient computation. This chapter provides a mathematical foundation of lattice-based cryptography, existing digital signatures, different attacks on lattice-based signatures with toy examples, challenges in lattice-based digital signatures, and future research directions. For scholars and academicians functioning in this emerging field of post PQC, the main unresolved issues evaluated in this study will provide an easily navigable reference and a unified, comprehensive source of data on lattice-based cryptography.

CRC Press eBooks•Jun 2, 2026•0 citations

Post-Quantum Cryptography: State of the Art

Johannes A Buchmann, Denis Butin, Florian Göpfert +1 more

Lecture notes in computer science•Jan 1, 2016•57 citations

Verkle-Based PORST—Post-Quantum Digital Signature Scheme

Maksim Iavich, Sergei Simonovi, Răzvan Bocu

Modern-day cryptographic schemes are threatened by the rapid development of quantum computers, which are capable of solving discrete-logarithm-based problems in a reasonable amount of time. The paper proposes a novel approach to a PORS post-quantum secure signature. The main idea of the proposal is integrating a PORS signature scheme with a Verkle tree, which greatly reduces the signature size compared to a PORST that uses a Merkle tree, while reducing authentication overhead through constant-size vector commitment proofs at each tree level. The work is highly relevant as it proposes a post-quantum digital signature which has compact proofs and at the same time solves the problems of the original HORS signature scheme (subset-resilience problem). The work contributes to the ongoing standardization efforts in post-quantum cryptography by providing a theoretically scalable and efficient signature scheme that balances security, size, and verification speed.

IEEE Access•Jan 1, 2026•0 citations
Asymmetric cryptography plays a critical role in the security, authenticity and sustainability of widely used electronic documents on a level comparable to the security and authenticity of a traditional paper documents in transport and logistics. However, security of the majority of the asymmetric cryptographic techniques currently in use, including those used to confirm the validity of electronic documents, will be compromised due to the forthcoming development of quantum computers. The concept of a quantum computer is no longer just a theory. The race for supremacy in quantum technology is on among countries since it is the most drastic technology in the world. On a large enough quantum computer, an attacker can easily generate fake digital signatures by applying Shor’s algorithm. Digital communications and electronic transactions could be devoid of the guarantee of authenticity and non-repudiation if this vulnerability is not addressed. Post-quantum cryptography strives to provide useful techniques that are resistant to attacks utilizing quantum computers in order to address the threat to existing asymmetric cryptography. In this research, we examine the current post-quantum digital signature algorithms used to confirm the validity of an electronic document in addition to comprehending the utilization of digital signing. Overall, we conclude that in order to define the next generation of electronic documents and to address the quantum threat, it is crucial to standardize a quantum-resistant digital signature scheme.
Mostly, existing public-key cryptosystems are constructed on the mathematical complexity of large integer factorization and solving discrete logarithms, which will be irresistible to attacks of future quantum computers. Due to the rapidly growing vulnerabilities in cryptographic systems recently, post-quantum cryptography (PQC) has turned out to be a need for the crypto community and has become a necessary research domain for the welfare of society. Lattice-based cryptography is measured as the most capable PQC because of its intense security proofs based on worst-case hardness, balanced performance in security, and efficient computation. This chapter provides a mathematical foundation of lattice-based cryptography, existing digital signatures, different attacks on lattice-based signatures with toy examples, challenges in lattice-based digital signatures, and future research directions. For scholars and academicians functioning in this emerging field of post PQC, the main unresolved issues evaluated in this study will provide an easily navigable reference and a unified, comprehensive source of data on lattice-based cryptography.
Modern-day cryptographic schemes are threatened by the rapid development of quantum computers, which are capable of solving discrete-logarithm-based problems in a reasonable amount of time. The paper proposes a novel approach to a PORS post-quantum secure signature. The main idea of the proposal is integrating a PORS signature scheme with a Verkle tree, which greatly reduces the signature size compared to a PORST that uses a Merkle tree, while reducing authentication overhead through constant-size vector commitment proofs at each tree level. The work is highly relevant as it proposes a post-quantum digital signature which has compact proofs and at the same time solves the problems of the original HORS signature scheme (subset-resilience problem). The work contributes to the ongoing standardization efforts in post-quantum cryptography by providing a theoretically scalable and efficient signature scheme that balances security, size, and verification speed.