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

arXiv:2609.13781

PQLN: Post-Quantum Security for the Bitcoin Lightning Network's Off-Chain Surfaces

Ahmet Kurt, Abdul-Salem Beibitkhan, Yacoub Hanna, Abdullah Aydeger

Published Sep 12, 2026• 0 citations
arXivHTMLPDF

Abstract

A cryptographically relevant quantum computer will break the elliptic-curve cryptography behind Bitcoin and its Lightning Network, the most widely used payment channel network. Even a post-quantum consensus upgrade of Bitcoin would not cover Lightning's off-chain surfaces, so its gossip, peer transport, invoices, payment onions, and offers need separate protection. An adversary can already record Lightning's encrypted traffic today and decrypt it once such a computer exists. Lightning can therefore move to post-quantum cryptography now, without waiting for Bitcoin, and stop such harvest-now-decrypt-later attacks along with node impersonation, invoice forgery, and payment deanonymization. In this paper, we propose PQLN, a hybrid post-quantum extension of Lightning that protects all of these surfaces with the lattice-based standards ML-DSA and ML-KEM. PQLN distributes post-quantum node identities through Lightning's gossip, hybridizes the transport handshake, adds post-quantum signatures to invoices, commits post-quantum keys in offers, and makes payment onions hybrid. Since post-quantum material is much larger than its elliptic-curve counterpart, we introduce techniques that fit it into Lightning's existing message formats and size limits. We analyze the security of PQLN against a quantum adversary and implement it in rust-lightning, a major Lightning implementation. Our evaluation with real Lightning nodes shows that PQLN nodes interoperate with unmodified nodes. The added cryptographic operations take at most 0.33 milliseconds, and the main cost is communication, since gossip data grows about tenfold with ML-DSA and about fourfold with the smaller Falcon. To our knowledge, PQLN is the first post-quantum design, implementation, and evaluation for Lightning.

DOI
10.48550/arxiv.2609.13781

Related papers

A STUDY OF POST-QUANTUM CRYPTOGRAPHIC ALGORITHMS FOR SECURE COMMUNICATION

Preeti Sharma

This study reviews post-quantum cryptographic algorithms for secure communication, focusing on standardized lattice-based schemes and their practical deployment implications. Classical public-key systems such as RSA and elliptic curve cryptography remain central to secure communication, but their long-term security is threatened by quantum algorithms capable of solving factorization and discrete logarithm problems. The study adopts a hybrid approach combining literature-based review with dataset-driven performance analysis. The empirical evaluation compares ML-KEM and ML-DSA with RSA-4096 and ECDSA-P256 using CPU benchmarking and network simulation metrics. Results indicate that ML-KEM provides substantial computational advantages over RSA-4096, making it suitable for latency-sensitive key establishment. ML-DSA also demonstrates competitive performance, especially in verification, but introduces larger signature sizes than ECDSA-P256. The analysis shows that the main deployment challenge is not computational feasibility but increased communication overhead caused by larger keys, ciphertexts, and signatures. These findings suggest that post-quantum migration requires more than direct algorithm replacement. Effective deployment should involve protocol optimization, crypto-agility, hybrid transition strategies, and context-specific parameter selection. Although the dataset focuses mainly on lattice-based algorithms, the study confirms the practical relevance of standardized post-quantum schemes for future secure communication infrastructure and identifies directions for broader evaluation across additional PQC families, including code-based, hash-based, multivariate approaches, real-world networks, and implementation-level security testing in practice contexts.

IJRDO-Journal of Applied Science•Jan 1, 2026•0 citations

Post-Quantum Cryptography: Preparing Critical Infrastructure for Shor’s Algorithm

Peter W. Shor

The advent of quantum computing presents a significant threat to the security of modern cryptographic systems, particularly those underpinning critical infrastructure such as power grids, financial networks, healthcare systems, telecommunications, and industrial control systems. Shor’s algorithm, when executed on a sufficiently powerful fault-tolerant quantum computer, has the potential to break widely used public-key cryptographic algorithms, including RSA and Elliptic Curve Cryptography (ECC), thereby compromising data confidentiality, authentication, and secure communication. This paper examines the role of Post-Quantum Cryptography (PQC) in preparing critical infrastructure for the emerging quantum threat. It explores the principles of quantum resistant cryptographic algorithms, including lattice-based, hash-based, and code-based approaches, and highlights standardized solutions such as ML-KEM, ML-DSA, and SLH-DSA. Furthermore, the study discusses the challenges associated with transitioning legacy systems to quantum-resistant cryptographic mechanisms, including interoperability, computational overhead, resource constraints, and long-term infrastructure compatibility. It also emphasizes the importance of cryptographic inventory management, crypto-agility, hybrid cryptographic deployments, and phased migration strategies to mitigate risks such as “harvest now, decrypt later” attacks.

International Journal of Research and Review Techniques•Jan 1, 2026•0 citations

Post-Quantum Cryptography (PQC) and Migration Strategies for Enterprise IT Infrastructure: Standards, Protocol Benchmarks, and Crypto-Agility

Yash Prashar, Tanishk Sharma, Vishal Shrivastava +2 more

Abstract—The advent of fault-tolerant Cryptanalytically Relevant Quantum Computers (CRQCs) presents an existential threat to modern information security. Shor's polynomial-time quantum algorithm renders widely deployed public-key cryptographic primitives—including RSA, Diffie-Hellman (DH), and Elliptic Curve Cryptography (ECDH/ECDSA)—completely vulnerable to private key derivation. Furthermore, 'Harvest Now, Decrypt Later' (HNDL) adversarial campaigns actively intercept and store encrypted enterprise telemetry today, anticipating future quantum decryption capabilities. In response, the National Institute of Standards and Technology (NIST) finalized its primary Post-Quantum Cryptography (PQC) standards in FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), and FIPS 205 (SLH-DSA). However, transitioning complex enterprise IT ecosystems to quantum-resistant primitives introduces severe architectural and computational disruptions: public key and signature sizes increase by several orders of magnitude, cryptographic handshake latencies escalate, network packets experience Maximum Transmission Unit (MTU) fragmentation, and legacy Hardware Security Modules (HSMs) lack microarchitectural support for lattice-based polynomial arithmetic. This paper provides an exhaustive, mathematically grounded technical survey and architectural roadmap for enterprise PQC migration. We formalize the Module Learning with Errors (M-LWE) and Module Short Integer Solution (M-SIS) hardness foundations, evaluate hybrid classical/post-quantum cryptographic transition models across standard transport protocols (TLS 1.3, IKEv2/IPsec, SSH), and formulate an enterprise Crypto-Agility Maturity Model. Furthermore, we construct an empirical enterprise testbed measuring throughput, connection establishment latency, memory footprints, and packet fragmentation across legacy and quantum-resistant suites. Our results show that while ML-KEM-768 achieves microsecond-level encapsulation, its 1,088-byte ciphertext expands TLS ClientHello payloads into multiple TCP segments under constrained networks. Finally, we establish open research directions in post-quantum identity federations, stateful hash signature tracking, and hardware-accelerated polynomial arithmetic. Index Terms—Post-Quantum Cryptography (PQC), FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), Crypto-Agility, TLS 1.3, Lattice-Based Cryptography, Harvest Now Decrypt Later, Hardware Security Modules (HSM), Enterprise Migration.

•Oct 9, 2026•0 citations

Quantum-Resistant AI and Blockchain Protocols for Long-Term Security

Vikram Choudhary

The emergence of cryptographically relevant quantum computers (CRQCs) would compromise today’s dominant public-key primitives (RSA, DiffieHellman, ECDSA), threatening long-lived confidentiality, authentication, and integrity guarantees across AI pipelines and blockchain networks. This manuscript proposes a unified, quantum-resilient architecture that blends NISTstandardized post-quantum cryptography (PQC)—MLKEM for key establishment and ML-DSA or SLH-DSA for digital signatures—with defense-in-depth controls for AI model protection, data privacy, and blockchain protocol evolution. We first motivate the need for migration by outlining quantum attacks (Shor for factoring and discrete logarithms; Grover for quadratic search speedups) and summarize PQC standardization milestones and transition guidance. We then review the literature on lattice-based and hash-based cryptography, homomorphic encryption for privacy-preserving AI, and secure aggregation/differential privacy as complementary privacy technologies. Building on this foundation, we present a methodology for designing and evaluating quantum-resistant AI and blockchain systems, including key-lifecycle hardening, protocol-level hybrids, and crypto-agility. A simulated deployment (1,000 clients; 16 validator nodes; TLS 1.3 with ML-KEM and hybrid handshakes; blockchain transactions signed with ML-DSA and SLH-DSA) measures handshake and signing overheads, throughput, and model-training privacy-utility trade-offs. Results indicate that: (i) PQC-only handshakes add modest latency yet remain acceptable for online APIs; (ii) hybrid ECDHE+ML-KEM offers near-term defense against “store-now-decrypt-later,” with predictable cost; (iii) ML-DSA is practical for blockchain validation at common block sizes, while SLH-DSA suits firmware/codesigning and archival integrity; and (iv) combining PQC with secure aggregation and differentially private training preserves model utility with bounded overhead.

Scientific Journal of Artificial Intelligence and Blockchain Technologies•Jul 2, 2026•0 citations

Quantum Shield: Design, Implementation, and Empirical Evaluation of a Hybrid Post-Quantum Secure Peer-to-Peer Communication System Using ML-KEM and ML-DSA

S Dharaneesh S, S Balraj, J Anbarasu +2 more

The emergence of fault-tolerant quantum computing poses an existential threat to classical public-key cryptographic systems, including RSA and Elliptic Curve Cryptography (ECC), through Shor's polynomial-time factorization algorithm. The Harvest Now, Decrypt Later (HNDL) attack paradigm further amplifies this threat by enabling adversaries to archive ciphertext today for future quantum-enabled decryption, rendering long-term data confidentiality immediately at risk. While the National Institute of Standards and Technology (NIST) finalized post-quantum cryptographic standards ML-KEM (FIPS 203) and ML-DSA (FIPS 204) in August 2024, their practical integration into complete application-level communication systems remains a largely unaddressed research gap. This paper presents QuantumShield, a hybrid post-quantum secure peer-to-peer communication platform that integrates ML-KEM-768 for quantum-safe key encapsulation, ML-DSA-65 for authenticated digital signatures, and AES-256-GCM for high-throughput symmetric encryption. Our primary research contribution is a rigorous empirical analysis of PQC integration overhead in a real-world communication pipeline, quantifying latency, key size, and security trade-offs against classical RSA-2048 and ECC-256 baselines under controlled experimental conditions. Experimental evaluation across 1,000 iterations demonstrates that ML-KEM-768 encapsulation completes in 2.8 ± 0.2 ms compared to 4.1 ± 0.3 ms for ECDH key agreement — a 32% latency reduction while providing NIST Level 3 post-quantum security. The complete secure transfer pipeline processes 1 MB files in under 22 ms on commodity hardware. The system further provides interactive cryptographic visualization, adversary threat modeling, tamper detection simulation, and a hybrid migration framework demonstrating practical transition from classical to post-quantum infrastructure. QuantumShield establishes that quantum-safe communication is not merely theoretical but deployable today with negligible performance compromise.

Indian Journal of Computer Science and Technology•May 13, 2026•0 citations

A Crypto-Agile Post-Quantum Architecture for Banking Systems

Josephat Kasile, Isaac Shaban, Dominick Joseph +10 more

Post-quantum cryptography is usually evaluated one algorithm at a time: can ML-KEM encrypt a session, can ML-DSA sign a transaction. A bank is not one application, though, but an ecosystem of customer channels, ATMs, point-of-sale terminals, USSD services, core banking systems, internal PKI and hardware security modules, and interbank messaging, each with different constraints and each currently secured by classical public-key cryptography that a cryptographically relevant quantum computer would break. This paper asks a narrower and more concrete question than whether post-quantum cryptography works: where, specifically, it belongs inside that ecosystem, and how it should be built in so the answer does not depend permanently on whichever algorithms are standardized today. It proposes a three-layer security model (communication, transaction, and long-term cryptographic infrastructure) built around a crypto-agile cryptographic-service abstraction rather than direct application-level dependence on any single algorithm, evaluates representative post-quantum mechanisms from different mathematical families (ML-KEM and HQC for key establishment; ML-DSA, SLH-DSA, and FN-DSA for signatures) against their documented security, performance, and size characteristics for different banking components, and develops a conceptual, component-differentiated migration path from classical through hybrid to crypto-agile post-quantum infrastructure. The design is literature-based and conceptual, so the paper does not build a complete banking system; it draws on finalized and draft standards, published benchmarks, and existing banking-security and crypto-agility research, and states explicitly what it does not claim. It is a companion to, and assumes without re-arguing, the case this research team's earlier paper made for why African financial institutions need to prepare for post-quantum migration now.

•Oct 21, 2026•0 citations
A cryptographically relevant quantum computer will break the elliptic-curve cryptography behind Bitcoin and its Lightning Network, the most widely used payment channel network. Even a post-quantum consensus upgrade of Bitcoin would not cover Lightning's off-chain surfaces, so its gossip, peer transport, invoices, payment onions, and offers need separate protection. An adversary can already record Lightning's encrypted traffic today and decrypt it once such a computer exists. Lightning can therefore move to post-quantum cryptography now, without waiting for Bitcoin, and stop such harvest-now-decrypt-later attacks along with node impersonation, invoice forgery, and payment deanonymization. In this paper, we propose PQLN, a hybrid post-quantum extension of Lightning that protects all of these surfaces with the lattice-based standards ML-DSA and ML-KEM. PQLN distributes post-quantum node identities through Lightning's gossip, hybridizes the transport handshake, adds post-quantum signatures to invoices, commits post-quantum keys in offers, and makes payment onions hybrid. Since post-quantum material is much larger than its elliptic-curve counterpart, we introduce techniques that fit it into Lightning's existing message formats and size limits. We analyze the security of PQLN against a quantum adversary and implement it in rust-lightning, a major Lightning implementation. Our evaluation with real Lightning nodes shows that PQLN nodes interoperate with unmodified nodes. The added cryptographic operations take at most 0.33 milliseconds, and the main cost is communication, since gossip data grows about tenfold with ML-DSA and about fourfold with the smaller Falcon. To our knowledge, PQLN is the first post-quantum design, implementation, and evaluation for Lightning.
This study reviews post-quantum cryptographic algorithms for secure communication, focusing on standardized lattice-based schemes and their practical deployment implications. Classical public-key systems such as RSA and elliptic curve cryptography remain central to secure communication, but their long-term security is threatened by quantum algorithms capable of solving factorization and discrete logarithm problems. The study adopts a hybrid approach combining literature-based review with dataset-driven performance analysis. The empirical evaluation compares ML-KEM and ML-DSA with RSA-4096 and ECDSA-P256 using CPU benchmarking and network simulation metrics. Results indicate that ML-KEM provides substantial computational advantages over RSA-4096, making it suitable for latency-sensitive key establishment. ML-DSA also demonstrates competitive performance, especially in verification, but introduces larger signature sizes than ECDSA-P256. The analysis shows that the main deployment challenge is not computational feasibility but increased communication overhead caused by larger keys, ciphertexts, and signatures. These findings suggest that post-quantum migration requires more than direct algorithm replacement. Effective deployment should involve protocol optimization, crypto-agility, hybrid transition strategies, and context-specific parameter selection. Although the dataset focuses mainly on lattice-based algorithms, the study confirms the practical relevance of standardized post-quantum schemes for future secure communication infrastructure and identifies directions for broader evaluation across additional PQC families, including code-based, hash-based, multivariate approaches, real-world networks, and implementation-level security testing in practice contexts.
The advent of quantum computing presents a significant threat to the security of modern cryptographic systems, particularly those underpinning critical infrastructure such as power grids, financial networks, healthcare systems, telecommunications, and industrial control systems. Shor’s algorithm, when executed on a sufficiently powerful fault-tolerant quantum computer, has the potential to break widely used public-key cryptographic algorithms, including RSA and Elliptic Curve Cryptography (ECC), thereby compromising data confidentiality, authentication, and secure communication. This paper examines the role of Post-Quantum Cryptography (PQC) in preparing critical infrastructure for the emerging quantum threat. It explores the principles of quantum resistant cryptographic algorithms, including lattice-based, hash-based, and code-based approaches, and highlights standardized solutions such as ML-KEM, ML-DSA, and SLH-DSA. Furthermore, the study discusses the challenges associated with transitioning legacy systems to quantum-resistant cryptographic mechanisms, including interoperability, computational overhead, resource constraints, and long-term infrastructure compatibility. It also emphasizes the importance of cryptographic inventory management, crypto-agility, hybrid cryptographic deployments, and phased migration strategies to mitigate risks such as “harvest now, decrypt later” attacks.
Abstract—The advent of fault-tolerant Cryptanalytically Relevant Quantum Computers (CRQCs) presents an existential threat to modern information security. Shor's polynomial-time quantum algorithm renders widely deployed public-key cryptographic primitives—including RSA, Diffie-Hellman (DH), and Elliptic Curve Cryptography (ECDH/ECDSA)—completely vulnerable to private key derivation. Furthermore, 'Harvest Now, Decrypt Later' (HNDL) adversarial campaigns actively intercept and store encrypted enterprise telemetry today, anticipating future quantum decryption capabilities. In response, the National Institute of Standards and Technology (NIST) finalized its primary Post-Quantum Cryptography (PQC) standards in FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), and FIPS 205 (SLH-DSA). However, transitioning complex enterprise IT ecosystems to quantum-resistant primitives introduces severe architectural and computational disruptions: public key and signature sizes increase by several orders of magnitude, cryptographic handshake latencies escalate, network packets experience Maximum Transmission Unit (MTU) fragmentation, and legacy Hardware Security Modules (HSMs) lack microarchitectural support for lattice-based polynomial arithmetic. This paper provides an exhaustive, mathematically grounded technical survey and architectural roadmap for enterprise PQC migration. We formalize the Module Learning with Errors (M-LWE) and Module Short Integer Solution (M-SIS) hardness foundations, evaluate hybrid classical/post-quantum cryptographic transition models across standard transport protocols (TLS 1.3, IKEv2/IPsec, SSH), and formulate an enterprise Crypto-Agility Maturity Model. Furthermore, we construct an empirical enterprise testbed measuring throughput, connection establishment latency, memory footprints, and packet fragmentation across legacy and quantum-resistant suites. Our results show that while ML-KEM-768 achieves microsecond-level encapsulation, its 1,088-byte ciphertext expands TLS ClientHello payloads into multiple TCP segments under constrained networks. Finally, we establish open research directions in post-quantum identity federations, stateful hash signature tracking, and hardware-accelerated polynomial arithmetic. Index Terms—Post-Quantum Cryptography (PQC), FIPS 203 (ML-KEM), FIPS 204 (ML-DSA), Crypto-Agility, TLS 1.3, Lattice-Based Cryptography, Harvest Now Decrypt Later, Hardware Security Modules (HSM), Enterprise Migration.
The emergence of cryptographically relevant quantum computers (CRQCs) would compromise today’s dominant public-key primitives (RSA, DiffieHellman, ECDSA), threatening long-lived confidentiality, authentication, and integrity guarantees across AI pipelines and blockchain networks. This manuscript proposes a unified, quantum-resilient architecture that blends NISTstandardized post-quantum cryptography (PQC)—MLKEM for key establishment and ML-DSA or SLH-DSA for digital signatures—with defense-in-depth controls for AI model protection, data privacy, and blockchain protocol evolution. We first motivate the need for migration by outlining quantum attacks (Shor for factoring and discrete logarithms; Grover for quadratic search speedups) and summarize PQC standardization milestones and transition guidance. We then review the literature on lattice-based and hash-based cryptography, homomorphic encryption for privacy-preserving AI, and secure aggregation/differential privacy as complementary privacy technologies. Building on this foundation, we present a methodology for designing and evaluating quantum-resistant AI and blockchain systems, including key-lifecycle hardening, protocol-level hybrids, and crypto-agility. A simulated deployment (1,000 clients; 16 validator nodes; TLS 1.3 with ML-KEM and hybrid handshakes; blockchain transactions signed with ML-DSA and SLH-DSA) measures handshake and signing overheads, throughput, and model-training privacy-utility trade-offs. Results indicate that: (i) PQC-only handshakes add modest latency yet remain acceptable for online APIs; (ii) hybrid ECDHE+ML-KEM offers near-term defense against “store-now-decrypt-later,” with predictable cost; (iii) ML-DSA is practical for blockchain validation at common block sizes, while SLH-DSA suits firmware/codesigning and archival integrity; and (iv) combining PQC with secure aggregation and differentially private training preserves model utility with bounded overhead.
The emergence of fault-tolerant quantum computing poses an existential threat to classical public-key cryptographic systems, including RSA and Elliptic Curve Cryptography (ECC), through Shor's polynomial-time factorization algorithm. The Harvest Now, Decrypt Later (HNDL) attack paradigm further amplifies this threat by enabling adversaries to archive ciphertext today for future quantum-enabled decryption, rendering long-term data confidentiality immediately at risk. While the National Institute of Standards and Technology (NIST) finalized post-quantum cryptographic standards ML-KEM (FIPS 203) and ML-DSA (FIPS 204) in August 2024, their practical integration into complete application-level communication systems remains a largely unaddressed research gap. This paper presents QuantumShield, a hybrid post-quantum secure peer-to-peer communication platform that integrates ML-KEM-768 for quantum-safe key encapsulation, ML-DSA-65 for authenticated digital signatures, and AES-256-GCM for high-throughput symmetric encryption. Our primary research contribution is a rigorous empirical analysis of PQC integration overhead in a real-world communication pipeline, quantifying latency, key size, and security trade-offs against classical RSA-2048 and ECC-256 baselines under controlled experimental conditions. Experimental evaluation across 1,000 iterations demonstrates that ML-KEM-768 encapsulation completes in 2.8 ± 0.2 ms compared to 4.1 ± 0.3 ms for ECDH key agreement — a 32% latency reduction while providing NIST Level 3 post-quantum security. The complete secure transfer pipeline processes 1 MB files in under 22 ms on commodity hardware. The system further provides interactive cryptographic visualization, adversary threat modeling, tamper detection simulation, and a hybrid migration framework demonstrating practical transition from classical to post-quantum infrastructure. QuantumShield establishes that quantum-safe communication is not merely theoretical but deployable today with negligible performance compromise.
Post-quantum cryptography is usually evaluated one algorithm at a time: can ML-KEM encrypt a session, can ML-DSA sign a transaction. A bank is not one application, though, but an ecosystem of customer channels, ATMs, point-of-sale terminals, USSD services, core banking systems, internal PKI and hardware security modules, and interbank messaging, each with different constraints and each currently secured by classical public-key cryptography that a cryptographically relevant quantum computer would break. This paper asks a narrower and more concrete question than whether post-quantum cryptography works: where, specifically, it belongs inside that ecosystem, and how it should be built in so the answer does not depend permanently on whichever algorithms are standardized today. It proposes a three-layer security model (communication, transaction, and long-term cryptographic infrastructure) built around a crypto-agile cryptographic-service abstraction rather than direct application-level dependence on any single algorithm, evaluates representative post-quantum mechanisms from different mathematical families (ML-KEM and HQC for key establishment; ML-DSA, SLH-DSA, and FN-DSA for signatures) against their documented security, performance, and size characteristics for different banking components, and develops a conceptual, component-differentiated migration path from classical through hybrid to crypto-agile post-quantum infrastructure. The design is literature-based and conceptual, so the paper does not build a complete banking system; it draws on finalized and draft standards, published benchmarks, and existing banking-security and crypto-agility research, and states explicitly what it does not claim. It is a companion to, and assumes without re-arguing, the case this research team's earlier paper made for why African financial institutions need to prepare for post-quantum migration now.