ABSTRACT The rapid advancement of quantum computing presents a significant threat to classical cryptographic systems, particularly RSA, whose security is based on the hardness of integer factorization. Shor’s algorithm demonstrates that large RSA keys can be efficiently broken in a quantum environment, raising concerns about the long-term reliability of traditional digital signatures. To address this, post-quantum cryptography (PQC) has emerged as a promising solution, with lattice-based schemes such as CRYSTALS-Dilithium3 gaining attention for their quantum resistance and efficiency. This study presents a comparative security and performance analysis of RSA and CRYSTALS-Dilithium3 digital signatures in the post-quantum era. The evaluation considers signature size, signing and verification speed, tamper detection capability, and resilience against classical and quantum attack models. Results highlight that RSA offers compact signature sizes but fails to provide integrity protection once subjected to simulated quantum attacks, while Dilithium3 ensures robust tamper detection, forward security, and cross-format verification across multiple document types. Despite larger signature sizes, Dilithium3 demonstrates superior verification speed and scalability, making it a viable candidate for post-quantum digital infrastructures. The findings emphasize the need for transitioning from classical to quantum-resistant cryptographic systems to ensure secure digital communication in the emerging quantum age. Keywords: Post-Quantum Cryptography, RSA, CRYSTALS-Dilithium3, Digital Signatures, Quantum Attacks, Tamper Detection, Performance Analysis
ABSTRACT The rapid advancement of quantum computing presents a significant threat to classical cryptographic systems, particularly RSA, whose security is based on the hardness of integer factorization. Shor’s algorithm demonstrates that large RSA keys can be efficiently broken in a quantum environment, raising concerns about the long-term reliability of traditional digital signatures. To address this, post-quantum cryptography (PQC) has emerged as a promising solution, with lattice-based schemes such as CRYSTALS-Dilithium3 gaining attention for their quantum resistance and efficiency. This study presents a comparative security and performance analysis of RSA and CRYSTALS-Dilithium3 digital signatures in the post-quantum era. The evaluation considers signature size, signing and verification speed, tamper detection capability, and resilience against classical and quantum attack models. Results highlight that RSA offers compact signature sizes but fails to provide integrity protection once subjected to simulated quantum attacks, while Dilithium3 ensures robust tamper detection, forward security, and cross-format verification across multiple document types. Despite larger signature sizes, Dilithium3 demonstrates superior verification speed and scalability, making it a viable candidate for post-quantum digital infrastructures. The findings emphasize the need for transitioning from classical to quantum-resistant cryptographic systems to ensure secure digital communication in the emerging quantum age. Keywords: Post-Quantum Cryptography, RSA, CRYSTALS-Dilithium3, Digital Signatures, Quantum Attacks, Tamper Detection, Performance Analysis
The rapid advancement of quantum computing poses a fundamental threat to classical cryptographic mechanisms that underpin modern digital security. Shor’s algorithm can efficiently solve integer factorization and discrete logarithm problems, thereby breaking widely used public-key cryptosystems such as RSA, ECC, and Diffie–Hellman. Grover’s algorithm also reduces the effective security of symmetric encryption and hash functions by half. This paper provides a systematic analysis of the impact of quantum attacks on current cryptographic infrastructures, including TLS, digital signatures, and blockchain. We then review the state of post-quantum cryptography (PQC) as standardized by NIST, focusing on three leading candidates: CRYSTALS-Kyber for key encapsulation, and CRYSTALS-Dilithium and FALCON for digital signatures. Through simulation using the Open Quantum Safe (liboqs) library on a standard x86_64 platform, we measure key generation time, encryption/signing speed, decryption/verification latency, and key/signature sizes. Our results show that Kyber-768 achieves key generation in <0.1 ms and produces public keys of about 1.2 KB, while Dilithium-3 generates signatures of ~2.7 KB with verification times under 0.3 ms. Compared to RSA-2048 and ECDSA-P256, PQC algorithms offer competitive performance at the cost of larger key and signature sizes. Based on these findings, we propose a hybrid transition roadmap that combines classical and PQC algorithms in parallel, minimizing risk while maintaining backward compatibility. The paper concludes that organizations should begin immediate preparations for the post-quantum era, especially for data requiring long-term confidentiality.
The rapid advancements in quantum computing pose a significant threat to traditional cryptographic protocols, endangering the security of financial transactions and sensitive business data. Existing encryption mechanisms, such as RSA, ECC, and Diffie-Hellman, rely on mathematical problems that quantum algorithms, particularly Shor's algorithm, can efficiently solve. As financial institutions and enterprises increasingly adopt artificial intelligence (AI) for data-driven decision-making and cybersecurity, the need for quantum-resistant cryptographic protocols becomes paramount. This study explores the evolution of post-quantum cryptography (PQC) and its implications for securing financial transactions and business data in the AI era. Post-quantum cryptographic algorithms are designed to withstand quantum attacks while maintaining efficiency and scalability for real-world applications. Lattice-based cryptography, code-based encryption, hash-based signatures, and multivariate polynomial cryptosystems are among the leading PQC approaches. Lattice-based schemes, such as CRYSTALS-Kyber and CRYSTALS-Dilithium, offer robust security guarantees and are actively being standardized by the National Institute of Standards and Technology (NIST). Additionally, hash-based signatures, such as XMSS and SPHINCS+, provide strong resistance against quantum threats while ensuring long-term data integrity. The integration of AI into financial systems necessitates quantum-resistant security mechanisms to protect sensitive business data from cyber threats. AI-driven fraud detection, transaction authentication, and anomaly detection systems must incorporate PQC to prevent unauthorized access and mitigate quantum-enabled attacks. Secure communication protocols, including TLS and blockchain-based financial networks, require quantum-safe encryption to maintain data confidentiality and integrity. Despite the promising advancements in PQC, challenges such as computational overhead, key size expansion, and backward compatibility with classical systems remain. Transitioning to quantum-resistant cryptography requires a phased approach, incorporating hybrid encryption models that combine classical and post-quantum algorithms. This study underscores the urgency of adopting PQC to safeguard financial transactions and business data in the AI-driven digital economy.
The rapid advancements in quantum computing pose a significant threat to traditional cryptographic protocols, endangering the security of financial transactions and sensitive business data. Existing encryption mechanisms, such as RSA, ECC, and Diffie-Hellman, rely on mathematical problems that quantum algorithms, particularly Shor's algorithm, can efficiently solve. As financial institutions and enterprises increasingly adopt artificial intelligence (AI) for data-driven decision-making and cybersecurity, the need for quantum-resistant cryptographic protocols becomes paramount. This study explores the evolution of post-quantum cryptography (PQC) and its implications for securing financial transactions and business data in the AI era. Post-quantum cryptographic algorithms are designed to withstand quantum attacks while maintaining efficiency and scalability for real-world applications. Lattice-based cryptography, code-based encryption, hash-based signatures, and multivariate polynomial cryptosystems are among the leading PQC approaches. Lattice-based schemes, such as CRYSTALS-Kyber and CRYSTALS-Dilithium, offer robust security guarantees and are actively being standardized by the National Institute of Standards and Technology (NIST). Additionally, hash-based signatures, such as XMSS and SPHINCS+, provide strong resistance against quantum threats while ensuring long-term data integrity. The integration of AI into financial systems necessitates quantum-resistant security mechanisms to protect sensitive business data from cyber threats. AI-driven fraud detection, transaction authentication, and anomaly detection systems must incorporate PQC to prevent unauthorized access and mitigate quantum-enabled attacks. Secure communication protocols, including TLS and blockchain-based financial networks, require quantum-safe encryption to maintain data confidentiality and integrity. Despite the promising advancements in PQC, challenges such as computational overhead, key size expansion, and backward compatibility with classical systems remain. Transitioning to quantum-resistant cryptography requires a phased approach, incorporating hybrid encryption models that combine classical and post-quantum algorithms. This study underscores the urgency of adopting PQC to safeguard financial transactions and business data in the AI-driven digital economy.
The emergence of quantum computing introduces unprecedented risks to classical cryptographic schemes, particularly digital signatures that safeguard authentication, confidentiality, and data integrity across digital ecosystems. To address these concerns, this paper investigates the adoption of Post-Quantum Cryptography (PQC) within Public Key Infrastructure (PKI) frameworks, emphasizing its role in strengthening electronic signature (eSign) systems against quantum threats. Traditional PKI implementations rely on algorithms such as RSA and ECC in combination with Hardware Security Modules (HSMs) for secure key management; however, these methods are vulnerable to quantum algorithms like Shor's. We examine how quantum-resistant alternatives-including lattice-based, hash-based, and multivariate polynomial-based schemes standardized by NIST-can be integrated into PKI without compromising interoperability and compliance. A comparative evaluation highlights trade-offs in performance, storage, and computational complexity while demonstrating the feasibility of embedding PQC into existing eSign infrastructures. Our findings underscore the urgency of transitioning towards quantum-safe digital signatures to ensure resilience, regulatory alignment, and long-term trust in national-scale digital services.
The rapid advancement of quantum computing presents a fundamental challenge to modern cryptographic security, particularly in the domain of hash functions that ensure data integrity, authentication, and blockchain security. Traditional crypto graphic hash functions such as SHA-256, SHA-3, and BLAKE2 rely on computational hardness assumptions that become obsolete in the presence of large-scale quantum computers. Shor’s algorithm can efficiently break RSA and ECC-based cryptosys tems, while Grover’s algorithm reduces the security of traditional hash functions by square root complexity, significantly weakening their preimage and collision resistance. This quantum threat necessitates the development of post-quantum secure hashing techniques that remain resilient against both classical and quantum adversaries. This paper proposes Quantum Hashing, a novel cryptographic framework that integrates quantum entanglement, lattice-based cryptography, and hybrid quantum classical hashing to construct post-quantum secure hash functions. We introduce a formal model for Quantum Collision Resistance (QCR) and provide entropy-based ran domness enhancement to ensure unpredictable hash outputs. Unlike classical hashing approaches, our framework leverages the hardness of lattice problems (e.g., Shortest Vector Problem, Learning with Errors) to withstand quantum attacks while incorpo rating Quantum Key Distribution (QKD) mechanisms to enhance entropy and key management. Furthermore, we evaluate the security of Quantum Hashing under various attack models, comparing its resistance against Grover’s search and collision attacks. We benchmark its performance against NIST Post-Quantum Cryptography (PQC) final ists, including CRYSTALS-DILITHIUM, SPHINCS+, and Falcon, demonstrating that our approach offers superior resilience while maintaining computational feasibility. Additionally, we present an implementation of Quantum Hashing using Qiskit, show casing its practical applicability in quantum circuits and quantum-secure blockchain architectures. Our findings highlight that Quantum Hashing provides a scalable, entropy-efficient, and post-quantum resilient cryptographic primitive suitable for next-generation cryptographic applications. This work paves the way for secure post-quantum digital signatures, blockchain consensus mechanisms, and zero-knowledge proof systems that require tamper-resistant hashing in a quantum computing era.
Quantum computing represents one of the most disruptive technological advancements of the 21st century, with profound implications for modern cryptographic systems. Traditional digital signature algorithms—such as RSA, DSA, and Elliptic Curve Cryptography (ECC)—derive their security from mathematical problems like integer factorization and discrete logarithms, which are computationally infeasible for classical computers. However, the advent of quantum algorithms, particularly Shor’s and Grover’s algorithms, poses a direct threat to these cryptographic assumptions by drastically reducing the time required to solve such problems. This development renders existing Digital Signature infrastructures potentially obsolete once large-scale quantum computers become operational. To counter this threat, researchers have proposed a range of post-quantum cryptographic (PQC) algorithms, including lattice-based, hash-based, and multivariate polynomial-based signature schemes, which are designed to resist quantum attacks. This paper critically examines the extent of quantum vulnerability in current Digital Signature systems and evaluates the comparative performance, efficiency, and security trade-offs of post-quantum alternatives. The study aims to provide a structured understanding of the ongoing transition toward quantum-resistant digital authentication and to propose a roadmap for secure implementation in future cryptographic environments.