arXiv (All)
open access
How to break the Miranda signature scheme over matrix Gabidulin codes
The Miranda signature scheme relies on masking a matrix code which disposes of a masked underlying structure, and the knowledge of which allows for efficient error decoding. We consider a Gabidulin code which is expanded into a matrix code, that is only \Fq-linear. An additional masking is then appl
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
- Universal Hashing and Geometric Codes#921554
- Digital signature schemes based on code equivalence and syndrome decoding from restricted errors#324825
- Non-Expansive Matrix Based number Systems#820448
- Some MDS and ACD codes over commutative non-unital rings of orders 4 and 9 (Revision)#1033960
- Constructions of LCPs and LCD codes from twisted Reed-Solomon codes#1123333
Record · ID 1105484
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