OptHQC: Optimize HQC for High-Performance Post-Quantum Cryptography

• URL: http://arxiv.org/abs/2512.12904v1
• Date: Mon, 15 Dec 2025 01:07:57 GMT
• Title: OptHQC: Optimize HQC for High-Performance Post-Quantum Cryptography
• Abstract summary: We propose OptHQC, an optimized implementation of the HQC scheme to deliver high-performance cryptographic operations.<n>Our approach provides a comprehensive analysis of each computational blocks in HQC and introduces optimizations across all three stages: key generation, encryption, and computation.<n>Overall, OptHQC achieves an average 55% speedup over the reference HQC implementation on CPU.
• Score: 5.281697362177691
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As post-quantum cryptography (PQC) becomes increasingly critical for securing future communication systems, the performance overhead introduced by quantum-resistant algorithms presents a major computing challenge. HQC (Hamming Quasi-Cyclic) is a newly standardized code-based PQC scheme designed to replace classical key exchange methods. In this paper, we propose OptHQC, an optimized implementation of the HQC scheme to deliver high-performance cryptographic operations. Our approach provides a comprehensive analysis of each computational blocks in HQC and introduces optimizations across all three stages: key generation, encryption, and decryption. We first exploit data-level sparsity in vector multiplication to accelerate polynomial operations during vector generation. We then leverage instruction-level acceleration (e.g., AVX2) in hash computation to further improve performance. Last, we transform multiplication into lookup table indexing and optimize memory access patterns in syndrome computation and error vector recovery, which are the most computationally intensive operations in HQC. Overall, OptHQC achieves an average 55% speedup over the reference HQC implementation on CPU.

Related papers

• Accelerated Decoding of Centroid Positional Encoding for Instance Segmentation [49.97373153077311]
  We investigate the decoding overhead associated with a centroid encoding for Instance, in which each pixel regresses a positional embedding of its instance centroid.<n>Our solution significantly reduces decoding overhead and improves Endto-End latency, outperforming both CPU-based approaches and naive GPU implementations.
  arXiv  Detail & Related papers  (2026-09-15T09:05:17Z)
• Implementation and Optimization of HQC Decoding on NPU-Integrated Devices [0.6157382820537719]
  This paper studies HQC decoding on Qualcomm Hexagon processors in NPU-integrated devices.<n>We focus on the Hexagon Vector eXtensions (HVX) backend rather than a tensor-inference engine.<n>Results show that Hexagon/HVX-assisted decoding substantially reduces latency and energy consumption, improving energy efficiency by up to $18.13times$ while significantly offloading host CPU work.
  arXiv  Detail & Related papers  (2026-06-01T09:31:49Z)
• Accelerating the Tesseract Decoder for Quantum Error Correction [1.0037458982330154]
  Tesseract is a novel Most-Likely-Error (MLE) decoder for Quantum Error Correction (QEC)<n>This paper presents a systematic approach to optimizing the Tesseract decoder through low-level performance enhancements.
  arXiv  Detail & Related papers  (2026-02-03T01:46:51Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• Complexity of Post-Quantum Cryptography in Embedded Systems and Its Optimization Strategies [2.821324092673655]
  The National Institute of Standards and Technology (NIST) has initiated a standardization process for post-quantum cryptography (PQC) algorithms.<n>This paper first provides a comprehensive analysis of the hardware complexity of post-quantum cryptography (PQC) in embedded systems.<n>To address these challenges, this paper discusses optimization strategies such as pipelining, parallelization, and high-level synthesis.
  arXiv  Detail & Related papers  (2025-04-18T08:02:13Z)
• gECC: A GPU-based high-throughput framework for Elliptic Curve Cryptography [15.39096542261856]
  Elliptic Curve Cryptography (ECC) is an encryption method that provides security comparable to traditional techniques like Rivest-Shamir-Adleman (RSA)<n> ECC is still hindered by the significant performance overhead associated with elliptic curve (EC) operations.<n>This paper presents gECC, a versatile framework for ECC optimized for GPU architectures.
  arXiv  Detail & Related papers  (2024-12-22T01:50:50Z)
• Implementing Semiclassical Szegedy Walks in Classical-Quantum Circuits for Homomorphic Encryption [0.0]
  Quantum homomorphic encryption (QHE) is an emerging technology that facilitates secure computation on quantum data without revealing the underlying information.<n>We reinterpret QHE schemes through classical-quantum circuits, enhancing efficiency and addressing previous limitations related to key computations.<n>Our approach eliminates the need for exponential key preparation by calculating keys in real-time during simulation, leading to a linear complexity in classically controlled gates.
  arXiv  Detail & Related papers  (2024-12-02T20:50:48Z)
• Extreme Compression of Large Language Models via Additive Quantization [59.3122859349777]
  Our algorithm, called AQLM, generalizes the classic Additive Quantization (AQ) approach for information retrieval. We provide fast GPU and CPU implementations of AQLM for token generation, which enable us to match or outperform optimized FP16 implementations for speed.
  arXiv  Detail & Related papers  (2024-01-11T18:54:44Z)
• Efficient Hardware Implementation of Constant Time Sampling for HQC [2.5234156040689237]
  HQC is one of the code-based finalists in the last round of the NIST post quantum cryptography standardization process.<n>A critical compute kernel with respect to efficient hardware implementations and security in HQC is the sampling method used to derive random numbers.<n>Due to its security criticality, recently an updated sampling algorithm was presented to increase its robustness against side-channel attacks.
  arXiv  Detail & Related papers  (2023-09-28T14:57:48Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• Gradient Coding with Dynamic Clustering for Straggler Mitigation [57.9123881133818]
  GC-DC regulates the number of straggling workers in each cluster based on the straggler behavior in the previous iteration. We numerically show that GC-DC provides significant improvements in the average completion time (of each iteration) with no increase in the communication load compared to the original GC scheme.
  arXiv  Detail & Related papers  (2020-11-03T18:52:15Z)
• Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
  qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
  arXiv  Detail & Related papers  (2020-10-08T12:49:07Z)
• Faster Secure Data Mining via Distributed Homomorphic Encryption [108.77460689459247]
  Homomorphic Encryption (HE) is receiving more and more attention recently for its capability to do computations over the encrypted field. We propose a novel general distributed HE-based data mining framework towards one step of solving the scaling problem. We verify the efficiency and effectiveness of our new framework by testing over various data mining algorithms and benchmark data-sets.
  arXiv  Detail & Related papers  (2020-06-17T18:14:30Z)

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.