Efficient Hardware Implementation of Constant Time Sampling for HQC

• URL: http://arxiv.org/abs/2309.16493v3
• Date: Tue, 17 Jun 2025 07:52:41 GMT
• Title: Efficient Hardware Implementation of Constant Time Sampling for HQC
• Authors: Maximilian Schöffel, Johannes Feldmann, Norbert Wehn,
• Abstract summary: 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.
• Score: 2.5234156040689237
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: HQC is one of the code-based finalists in the last round of the NIST post quantum cryptography standardization process. In this process, security and implementation efficiency are key metrics for the selection of the candidates. A critical compute kernel with respect to efficient hardware implementations and security in HQC is the sampling method used to derive random numbers. Due to its security criticality, recently an updated sampling algorithm was presented to increase its robustness against side-channel attacks. In this paper, we pursue a cross layer approach to optimize this new sampling algorithm to enable an efficient hardware implementation without comprising the original algorithmic security and side-channel attack robustness. We compare our cross layer based implementation to a direct hardware implementation of the original algorithm and to optimized implementations of the previous sampler version. All implementations are evaluated using the Xilinx Artix 7 FPGA. Our results show that our approach reduces the latency by a factor of 24 compared to the original algorithm and by a factor of 28 compared to the previously used sampler with significantly less resources.

Related papers

• Lightweight Hybrid Block-Stream Cryptographic Algorithm for the Internet of Things [1.6114012813668932]
  algorithm is designed specifically for application in Internet of Things (IoT) technology devices.<n>Design concept of this algorithm is based on the integration of a pseudo-random permutation function and a pseudo-random generator function.<n>Security analyses conducted on the algorithm, along with the results of NIST statistical tests, confirm its robustness against most common and advanced cryptographic attacks.
  arXiv  Detail & Related papers  (2025-05-13T11:29:20Z)
• Faster WIND: Accelerating Iterative Best-of-$N$ Distillation for LLM Alignment [81.84950252537618]
  This paper reveals a unified game-theoretic connection between iterative BOND and self-play alignment. We establish a novel framework, WIN rate Dominance (WIND), with a series of efficient algorithms for regularized win rate dominance optimization.
  arXiv  Detail & Related papers  (2024-10-28T04:47:39Z)
• More Efficient Randomized Exploration for Reinforcement Learning via Approximate Sampling [41.21199687865359]
  We propose an algorithmic framework that incorporates different approximate sampling methods with the recently proposed Feel-Good Thompson Sampling (FGTS) approach. Our regret analysis yields the best known dependency of regret on dimensionality, surpassing existing randomized algorithms. Our algorithms achieve performance that is either better than or on par with other strong baselines from the deep RL literature.
  arXiv  Detail & Related papers  (2024-06-18T03:32:10Z)
• Exploring the Algorithm-Dependent Generalization of AUPRC Optimization with List Stability [107.65337427333064]
  optimization of the Area Under the Precision-Recall Curve (AUPRC) is a crucial problem for machine learning. In this work, we present the first trial in the single-dependent generalization of AUPRC optimization. Experiments on three image retrieval datasets on speak to the effectiveness and soundness of our framework.
  arXiv  Detail & Related papers  (2022-09-27T09:06:37Z)
• A Faster Quantum Algorithm for Semidefinite Programming via Robust IPM Framework [14.531920189937495]
  This paper studies a fundamental problem in convex optimization, which is to solve semidefinite programming (SDP) with high accuracy. We give a quantum second-order algorithm with high-accuracy in both the optimality and the feasibility of its output.
  arXiv  Detail & Related papers  (2022-07-22T15:51:02Z)
• Recommender System Expedited Quantum Control Optimization [0.0]
  Quantum control optimization algorithms are routinely used to generate optimal quantum gates or efficient quantum state transfers. There are two main challenges in designing efficient optimization algorithms, namely overcoming the sensitivity to local optima and improving the computational speed. Here, we propose and demonstrate the use of a machine learning method, specifically the recommender system (RS), to deal with the latter challenge.
  arXiv  Detail & Related papers  (2022-01-29T10:25:41Z)
• Robust recovery for stochastic block models [16.74630355427558]
  We develop an efficient algorithm for weak recovery in a robust version of the block model. Our results show that there is no price of robustness in the block model.
  arXiv  Detail & Related papers  (2021-11-16T15:43:00Z)
• Learning to Hash Robustly, with Guarantees [79.68057056103014]
  In this paper, we design an NNS algorithm for the Hamming space that has worst-case guarantees essentially matching that of theoretical algorithms. We evaluate the algorithm's ability to optimize for a given dataset both theoretically and practically. Our algorithm has a 1.8x and 2.1x better recall on the worst-performing queries to the MNIST and ImageNet datasets.
  arXiv  Detail & Related papers  (2021-08-11T20:21:30Z)
• Adaptive Sampling for Best Policy Identification in Markov Decision Processes [79.4957965474334]
  We investigate the problem of best-policy identification in discounted Markov Decision (MDPs) when the learner has access to a generative model. The advantages of state-of-the-art algorithms are discussed and illustrated.
  arXiv  Detail & Related papers  (2020-09-28T15:22:24Z)
• Bayesian Optimization with Machine Learning Algorithms Towards Anomaly Detection [66.05992706105224]
  In this paper, an effective anomaly detection framework is proposed utilizing Bayesian Optimization technique. The performance of the considered algorithms is evaluated using the ISCX 2012 dataset. Experimental results show the effectiveness of the proposed framework in term of accuracy rate, precision, low-false alarm rate, and recall.
  arXiv  Detail & Related papers  (2020-08-05T19:29:35Z)
• Active Model Estimation in Markov Decision Processes [108.46146218973189]
  We study the problem of efficient exploration in order to learn an accurate model of an environment, modeled as a Markov decision process (MDP) We show that our Markov-based algorithm outperforms both our original algorithm and the maximum entropy algorithm in the small sample regime.
  arXiv  Detail & Related papers  (2020-03-06T16:17:24Z)

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.