arXiv (All)
open access
Zeta-Transform Evaluation for Higher-Order Vanishing Key Recovery
Hemmert's key-recovery algorithm for Classic McEliece is based on higher-order vanishing. It computes a basis of $\ker(\widetildeφ_A^{(p)})$, where $A=H'''$ is the shortened parity-check matrix used in the attack. For Classic McEliece parameters, this kernel computation is the dominant cost of the a
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
- Symmetry Results for Cyclotomic Multiple Hurwitz Zeta Values via Contour Integrals#999733
- Certain families of series involving Hurwitz and Lerch zeta functions#1083295
- Moment and Prime-Trace Criteria for the Riemann Hypothesis, with Two Spectral Exclusions#693153
- Lower Bounds for Linear Hashing via Arithmetic Kakeya#818970
- Lower Bounds for Linear Hashing via Arithmetic Kakeya#808978
Record · ID 1062034
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