arXiv (All)
open access
Optimizing Polynomial Multiplication and Fixed-Weight Sampling for HQC on ARM Cortex-M4
In this paper, we present an optimized implementation of Hamming Quasi-Cyclic (HQC) on the ARM Cortex-M4. We optimize (i) the polynomial multiplication and (ii) the support expansion in fixed-weight sampling, and (iii) propose an optional caching strategy that reuses the public transforms and hash r
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Prioritized Random Access with Discriminative Power Ramping Step Size#499251
- DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation#405682
- From Bits to Mixed-Radix Keys: Horner Decomposition, Uniform Sampling, and the Information-Theoretic QKD Interface of the MR-OTP#287069
- ORCHID: Orchestrated Reduction Consensus for Hash-based Integrity in Distributed Ledgers#178792
- Space-Efficient Lock-Free Linear-Probing Hash Table#282770
Record · ID 1142769
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive