ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2603.20156v1· 20 results

cs.CRcs.ARcs.PFRecentJun 1, 2026

Implementation and Optimization of HQC Decoding on NPU-Integrated Devices

Vu Minh Chau, Nguyen Ngoc Kiet, Pham Quang Minh, Mai Xuan Ngoc +2 more

This paper optimizes the decoding of Hamming Quasi-Cyclic (HQC) codes for post-quantum cryptography on NPU-integrated mobile devices by redesigning the core kernels to leverage the Hexagon Vector eXte…

View →
cs.CRcs.ARcs.PFRecentJun 1, 2026

Implementation and Optimization of HQC Decoding on NPU-Integrated Devices

Vu Minh Chau, Nguyen Ngoc Kiet, Pham Quang Minh, Mai Xuan Ngoc +2 more

This paper optimizes the decoding of Hamming Quasi-Cyclic (HQC) codes for post-quantum cryptography on NPU-integrated mobile devices by redesigning the kernels to leverage the Hexagon Vector eXtension…

View →
cs.CRcs.ITRecentApr 14, 2026

Distinguishers for Skew and Linearized Reed-Solomon Codes

Felicitas Hörmann, Anna-Lena Horlemann

The paper proves that generalized skew and linearized Reed-Solomon (GSRS and GLRS) codes, while promising for cryptosystems, are structurally weak and can be efficiently distinguished from random code…

View →
cs.CRRecentMay 5, 2026

Quantum-Resistant Networks: A Review of Primitives, Protocols and Best Practices

Elisa Bertino, Ramana Kompella, Ashish Kundu, Cristina Nita-Rotaru +2 more

This paper provides a comprehensive, system-level taxonomy for designing quantum-resistant network architectures, moving beyond simple protocol substitutions to address key distribution and management…

View →
quant-phcs.CRRecentMay 11, 2026

On Scalable Pseudorandom Unitaries and the Unitary Synthesis Problem

Zvika Brakerski, Henry Yuen

The paper establishes a strong connection between scalable pseudorandom unitaries (PRUs) and the unitary synthesis problem, proving that any such PRU construction must require a classical oracle of si…

View →
quant-phcs.CRRecentMar 19, 2026

Post-Quantum Cryptography from Quantum Stabilizer Decoding

Jonathan Z. Lu, Alexander Poremba, Yihui Quek, Akshar Ramkumar

The paper proposes that decoding random quantum stabilizer codes is a robust, novel post-quantum cryptographic assumption, demonstrating that its average-case hardness implies core primitives like PKE…

View →
quant-phcs.CRRecentMay 6, 2026

Fundamental Limitations of Post-Quantum Cryptographic Architectures

Jiho Jung, Donghwa Ji, Mingyu Lee, Kabgyun Jeong

The paper argues that current lattice-based post-quantum cryptography, which relies on injecting noise, is not unconditionally secure because advanced quantum error correction and learning techniques…

View →
cs.CRcs.ITRecentApr 10, 2026

Cross-Paradigm Models of Restricted Syndrome Decoding with Application to CROSS

Étienne Burle, Aleksei Udovenko

The paper analyzes the security of the post-quantum signature scheme CROSS by showing that the underlying Restricted Syndrome Decoding problem can be reduced to both code-based and lattice-based probl…

View →
cs.CRRecentMay 19, 2026

A Survey on Security with Quantum Computing

Manik Kumar Sangala, Robin Naira, Akhirul Islam, Sudip Biswas +1 more

This survey provides a comprehensive review of the security challenges, threats, and mitigation strategies associated with the rapid advancement of quantum computing.

View →
cs.CRcs.DCRecentApr 27, 2026

Network Impact of Post-Quantum Certificate Chain sizes on Time to First Byte in TLS Deployments

Matthew Chou, Phuong Cao

This paper quantifies the latency impact of increasing certificate chain sizes required by Post-Quantum Cryptography (PQC) on TLS Time to First Byte (TTFB), finding that Merkle Tree Certificates (MTC)…

View →
cs.CRcs.ITRecentApr 20, 2026

Subcodes of Lambda-Gabidulin Codes for Compact-Ciphertext Cryptography

Freddy Lendé Metouké, Hervé Talé Kalachi, Hermann Tchatchiem Kamche, Ousmane Ndiaye +1 more

The paper analyzes subcodes of lambda-Gabidulin codes to construct highly efficient McEliece-like and Niederreiter-like cryptosystems, demonstrating that random subcodes of classical Gabidulin codes y…

View →
cs.CRcs.ITRecentMar 24, 2026

Canonical Byte-String Encoding for Finite-Ring Cryptosystems

Kyrylo Riabov, Serhii Kryvyi

The paper introduces the base-m length codec, a canonical and robust encoding scheme that maps byte strings to lists of residues modulo m, essential for finite-ring cryptosystems.

View →
cs.CRcs.ITquant-phRecentApr 24, 2026

Module Lattice Security (Part II): Module Lattice Reduction via Optimal Sign Selection

Ming-Xing Luo

This paper extends quantum lattice reduction techniques (CDPR) from ideal to module lattices over cyclotomic rings, achieving a constant module reduction factor and providing a rigorous, bounded-preci…

View →
cs.CRcs.NIRecentApr 9, 2026

Post-Quantum Cryptography-Based Bidirectional Authentication Key Exchange Protocol and Industry Applications: A Case Study of Instant Messaging

Abel C. H. Chen, James W. H. Tung, Austin B. Y. Lin, Chin-Ling Chen +2 more

The paper proposes a novel post-quantum cryptography-based bidirectional authentication key exchange protocol, enhancing ML-KEM by utilizing dual-usage certificates to securely establish shared secret…

View →
cs.CRRecentMay 16, 2026

Simple Power Analysis on Post-Quantum Code Based Cryptosystems

Konstantinos Spalas

This paper demonstrates that Simple Power Analysis (SPA) can successfully extract secret session key bits from post-quantum cryptosystems, specifically during the key decapsulation phase, using only a…

View →
quant-phcs.CRRecentMar 28, 2026

Quantum Bit Error Rate Analysis in BB84 Quantum Key Distribution: Measurement, Statistical Estimation, and Eavesdropping Detection

Jaydeep Rath, Prajwal Panth, P. S. N. Bhaskar

This paper systematically analyzes the Quantum Bit Error Rate (QBER) in the BB84 Quantum Key Distribution protocol, demonstrating its use for quantifying channel noise and detecting eavesdropping, par…

View →
quant-phcs.AIRecentJun 1, 2026

Evolutionary Discovery of Bivariate Bicycle Codes with LLM-Guided Search

Juan Cruz-Benito, Andrew W. Cross, David Kremer, Ismael Faro

The paper introduces an LLM-guided evolutionary workflow that successfully discovers and certifies a large number of novel bivariate quantum error-correcting codes, demonstrating the utility of LLMs i…

View →
quant-phcs.CRRecentApr 17, 2026

Quantum-Resistant Quantum Teleportation

Xin Jin, Nitish Kumar Chandra, Mohadeseh Azari, Jinglei Cheng +3 more

The paper proposes a quantum-resistant quantum teleportation (QRQT) framework using post-quantum cryptography to secure the classical channel, establishing maximum secure communication distances and a…

View →
cs.ITcs.CRquant-phRecentJun 1, 2026

Multidimensional Reconciliation in Continuous-Variable QKD: Review, Coding Schemes, and Open Source Simulation

Lucien Martial, Alexis Rosio, Eleni Diamanti, Adrien Cassagne +1 more

This paper reviews multidimensional reconciliation techniques for Continuous-Variable Quantum Key Distribution (CV-QKD), demonstrating how transforming the physical channel into a virtual binary chann…

View →
cs.CRcs.SEquant-phRecentApr 1, 2026

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

Animesh Shaw

The paper introduces Quantum-Safe Code Auditor, a novel static analysis framework that uses LLMs and quantum-aware risk scoring to automatically detect and prioritize quantum-vulnerable cryptographic…

View →