Quantum-Safe Code Auditing: LLM-Assisted Static Analysis and Quantum-Aware Risk Scoring for Post-Quantum Cryptography Migration

• URL: http://arxiv.org/abs/2604.00560v1
• Date: Wed, 01 Apr 2026 07:10:17 GMT
• Title: Quantum-Safe Code Auditing: LLM-Assisted Static Analysis and Quantum-Aware Risk Scoring for Post-Quantum Cryptography Migration
• Abstract summary: Quantum-Safe Code is a quantum-aware static analysis framework.<n>It uses 15 classes of quantum-vulnerable primitives and a Variational Bouncysolver (VQE) model.<n>On a sample of 602 labelled instances, we achieve 71.98% precision, 100% recall, and an F1 score of 83.71%.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The impending arrival of cryptographically relevant quantum computers (CRQCs) threatens the security foundations of modern software: Shor's algorithm breaks RSA, ECDSA, ECDH, and Diffie-Hellman, while Grover's algorithm reduces the effective security of symmetric and hash-based schemes. Despite NIST standardising post-quantum cryptography (PQC) in 2024 (FIPS 203 ML-KEM, FIPS 204 ML-DSA, FIPS 205 SLH-DSA), most codebases lack automated tooling to inventory classical cryptographic usage and prioritise migration based on quantum risk. We present Quantum-Safe Code Auditor, a quantum-aware static analysis framework that combines (i) regex-based detection of 15 classes of quantum-vulnerable primitives, (ii) LLM-assisted contextual enrichment to classify usage and severity, and (iii) risk scoring via a Variational Quantum Eigensolver (VQE) model implemented in Qiskit 2.x, incorporating qubit-cost estimates to prioritise findings. We evaluate the system across five open-source libraries -- python-rsa, python-ecdsa, python-jose, node-jsonwebtoken, and Bouncy Castle Java -- covering 5,775 findings. On a stratified sample of 602 labelled instances, we achieve 71.98% precision, 100% recall, and an F1 score of 83.71%. All code, data, and reproduction scripts are released as open-source.

Related papers

• Broken Quantum: A Systematic Formal Verification Study of Security Vulnerabilities Across the Open-Source Quantum Computing Simulator Ecosystem [0.0]
  Broken Quantum is the first comprehensive security audit of the open-source quantum computing simulator ecosystem.<n>We analyze 45 open-source quantum simulation frameworks from 22 organizations spanning 12 countries.
  arXiv  Detail & Related papers  (2026-04-08T06:07:37Z)
• 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)
• Securing Cryptography in the Age of Quantum Computing and AI: Threats, Implementations, and Strategic Response [3.4562767039451674]
  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.
  arXiv  Detail & Related papers  (2026-03-07T01:07:35Z)
• Noise-Resistant Feature-Aware Attack Detection Using Quantum Machine Learning [43.509065918669314]
  Continuous-variable quantum key distribution (CV-QKD) is a quantum communication technology that offers an unconditional security guarantee.<n>We propose a quantum machine learning (QML)-based attack detection framework (QML-ADF) that safeguards the security of high-rate CV-QKD systems.
  arXiv  Detail & Related papers  (2026-01-11T03:40:45Z)
• Performance and Storage Analysis of CRYSTALS Kyber as a Post Quantum Replacement for RSA and ECC [45.88028371034407]
  CRYSTALS-Kyber is a post-quantum cryptographic solution standardized by NIST in 2022.<n>This study evaluates Kyber's practical viability through performance testing across various implementation schemes.
  arXiv  Detail & Related papers  (2025-08-03T09:53:45Z)
• NIST Post-Quantum Cryptography Standard Algorithms Based on Quantum Random Number Generators [0.0]
  This study proposes quantum random number generator (QRNG)-based post-quantum cryptography (PQC) algorithms.<n>These algorithms leverage quantum computing to generate random numbers, which serve as the foundation for key pair generation, key encapsulation, and digital signature generation.<n> Experimental results assess the time computation of the six QRNGs, as well as the performance of QRNG-based ML-KEM, QRNG-based ML-DSA, and QRNG-based SLH-DSA.
  arXiv  Detail & Related papers  (2025-07-24T00:27:23Z)
• 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)
• Evaluating the Potential of Quantum Machine Learning in Cybersecurity: A Case-Study on PCA-based Intrusion Detection Systems [42.184783937646806]
  We investigate the potential impact of quantum computing and machine learning (QML) on cybersecurity applications of traditional ML.<n>First, we explore the potential advantages of quantum computing in machine learning problems specifically related to cybersecurity.<n>Then, we describe a methodology to quantify the future impact of fault-tolerant QML algorithms on real-world problems.
  arXiv  Detail & Related papers  (2025-02-16T15:49:25Z)
• 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)
• FIPS Compliant Quantum Secure Communication using Quantum Permutation Pad [0.602276990341246]
  This paper proposes to take a nested mode to enable TLS 1.3 protocol with quantum-safe data, which can be made available today and is compliant. We discussed the performance impacts of the handshaking phase of the nested TLS 1.3 with PQC and the symmetric encryption phase.
  arXiv  Detail & Related papers  (2022-12-30T21:56:35Z)
• 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.