arXiv (All)
open access
The Matrix Subcode Equivalence problem and its application to signature with MPC-in-the-Head
Nowadays, equivalence problems are widely used in cryptography, most notably to establish cryptosystems such as digital signatures, with MEDS, LESS, PERK as the most recent ones. However, in the context of matrix codes, only the code equivalence problem has been studied, while the subcode equivalenc
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
- The Matrix Subcode Equivalence problem and its application to signature with MPC-in-the-Head#1251427
- Shortest self-orthogonal and LCD embeddings of linear codes over Fq+uFq#784973
- Shortest self-orthogonal and LCD embeddings of linear codes over Fq+uFq#783383
- Key exchange protocol based on circulant matrix action over congruence-simple semiring#984045
- CHAMP: Cayley HAshing with Matrix Products#1200093
Record · ID 1248272
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