Securing Cryptography in the Age of Quantum Computing and AI: Threats, Implementations, and Strategic Response

• URL: http://arxiv.org/abs/2603.06969v1
• Date: Sat, 07 Mar 2026 01:07:35 GMT
• Title: Securing Cryptography in the Age of Quantum Computing and AI: Threats, Implementations, and Strategic Response
• Abstract summary: RSA and elliptic curve cryptography are at risk of compromise from quantum computers.<n> lattice-based algorithms resist known quantum attacks but require careful implementation to prevent side-channel leakage.<n>Hash-based signatures provide conservative security with signature sizes ranging from 17 to 50 KB.
• Score: 3.4562767039451674
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This review examines how quantum computing and artificial intelligence challenge current cryptographic systems. We analyze the literature to assess the resilience of algorithms against quantum attacks (Shor's and Grover's algorithms) and AI-enhanced cryptanalysis. RSA and elliptic curve cryptography are at risk of compromise from quantum computers. Symmetric algorithms like AES-128 retain security, but with a reduced effective key length under quantum attacks. Deep learning models demonstrate improved side-channel analysis, extracting keys from protected implementations. These convergent threats require a defense-in-depth approach that combines post-quantum algorithms, implementation hardening, and cryptographic agility. We find that lattice-based algorithms (ML-KEM, ML-DSA) resist known quantum attacks but require careful implementation to prevent side-channel leakage. Hash-based signatures (SLH-DSA) provide conservative security with signature sizes ranging from 17 to 50 KB. No single approach addresses both quantum and AI threats comprehensively. Organizations must treat cryptographic security as an ongoing process rather than a fixed deployment, maintaining the capability to update algorithms as threats evolve.

Related papers

• Quantifying quantum risk: a measure of crypto agility [0.0]
  We introduce the concept of rotation time as a measure of crypto agility.<n>We derive an approximation that links rotation time tolerance to security risk tolerance.<n>This demonstrates that using crypto agility in conjunction with hybrid encryption is an effective approach for designing quantum-resilient systems.
  arXiv  Detail & Related papers  (2026-06-15T10:12:06Z)
• Post-quantum Federated Learning: Secure And Scalable Threat Intelligence For Collaborative Cyber Defense [0.0]
  Collaborative threat intelligence via federated learning (FL) faces critical risks from quantum computing.<n>This study proposes a quantum-secure FL framework using post-quantum cryptography (PQC) to protect cross-organizational data sharing.
  arXiv  Detail & Related papers  (2026-03-08T16:57:05Z)
• Quantum-Resistant Cryptographic Models for Next-Gen Cybersecurity [1.3460582882338625]
  quantum-resistant cryptographic systems, otherwise known as post-quantum cryptography (PQC), are being formulated to protect cybersecurity systems of the future.<n>We study a hybrid cryptographic model that integrates the classical efficient cryptography scheme and a quantum-resilient cryptographic scheme to achieve a backward-compatible solution.
  arXiv  Detail & Related papers  (2025-12-22T03:47:06Z)
• Literature Review of the Effect of Quantum Computing on Cryptocurrencies using Blockchain Technology [0.0]
  This paper presents a literature review evaluating how quantum algorithms, specifically Shors and Grovers, could disrupt the foundational security mechanisms of cryptocurrencies.<n>This review identifies specific vulnerabilities in transaction and consensus processes in Bitcoin, Litecoin, Monero, and Zcash.<n>In anticipation, it investigates countermeasures including Post-Quantum Cryptography (PQC), Quantum Key Distribution (QKD), and protocol-level modifications such as memory-intensive proof-of-work algorithms and multi-signature schemes.
  arXiv  Detail & Related papers  (2025-08-24T10:53:41Z)
• Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems [55.49917140500002]
  Quantum computers will be able to break modern cryptographic systems using Shor's Algorithm.<n>We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks.<n>We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem.
  arXiv  Detail & Related papers  (2025-05-06T03:42:38Z)
• Cyber Threats in Financial Transactions -- Addressing the Dual Challenge of AI and Quantum Computing [0.0]
  Financial sector faces escalating cyber threats amplified by artificial intelligence (AI) and the advent of quantum computing.<n>Report analyzes these threats, relevant frameworks, and possible countermeasures like quantum cryptography.<n>Financial industry must adopt a proactive and adaptive approach to cybersecurity.
  arXiv  Detail & Related papers  (2025-03-19T20:16:27Z)
• On the practicality of quantum sieving algorithms for the shortest vector problem [42.70026220176376]
  lattice-based cryptography is one of the main candidates of post-quantum cryptography.<n> cryptographic security against quantum attackers is based on lattice problems like the shortest vector problem (SVP)<n>Asymptotic quantum speedups for solving SVP are known and rely on Grover's search.
  arXiv  Detail & Related papers  (2024-10-17T16:54:41Z)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs.<n>This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• Designing Hash and Encryption Engines using Quantum Computing [2.348041867134616]
  We explore quantum-based hash functions and encryption to fortify data security. The integration of quantum and classical methods demonstrates potential in securing data in the era of quantum computing.
  arXiv  Detail & Related papers  (2023-10-26T14:49:51Z)
• Revocable Cryptography from Learning with Errors [61.470151825577034]
  We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities. We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
  arXiv  Detail & Related papers  (2023-02-28T18:58:11Z)
• A Variational Quantum Attack for AES-like Symmetric Cryptography [69.80357450216633]
  We propose a variational quantum attack algorithm (VQAA) for classical AES-like symmetric cryptography. In the VQAA, the known ciphertext is encoded as the ground state of a Hamiltonian that is constructed through a regular graph.
  arXiv  Detail & Related papers  (2022-05-07T03:15:15Z)
• Backflash Light as a Security Vulnerability in Quantum Key Distribution Systems [77.34726150561087]
  We review the security vulnerabilities of quantum key distribution (QKD) systems. We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
  arXiv  Detail & Related papers  (2020-03-23T18:23:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.