{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:36HWBJUXTDV6SAW36HN43RWFQ3","short_pith_number":"pith:36HWBJUX","schema_version":"1.0","canonical_sha256":"df8f60a69798ebe902dbf1dbcdc6c586c5f423c23ea68409b97c7767513236c3","source":{"kind":"arxiv","id":"2608.03328","version":1},"attestation_state":"computed","paper":{"title":"Breaking ACDGV MinRank Gabidulin encryption schemes over matrix codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Thai Hung Le","submitted_at":"2026-08-04T08:38:48Z","abstract_excerpt":"Enhanced Gabidulin Matrix Codes (EGMC), introduced by Aragon, Couvreur, Dyseryn, Gaborit, and Vincotte at Asiacrypt 2024, were designed to hide the algebraic structure of Gabidulin matrix codes while enabling very compact McEliece- and Niederreiter-type encryption schemes, with ciphertexts as small as $65$ bytes at the claimed 128-bit security level. Their security relies on the assumption that a masked EGMC code is hard to distinguish from a random matrix code. We show that this enhanced construction leaves enough structure for an equivalent code of the secret key to be recovered. Unlike prev"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2608.03328","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-08-04T08:38:48Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6af46bbb2137b194a10fe82868da7d7555da767159528e72acc81e56b168cc88","abstract_canon_sha256":"eeb09a61c431f5da121a9a1b3043b5958dd488039dec2ed9091b774c3017c29d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-05T00:46:54.840548Z","signature_b64":"KFVZ9L3Iryi5cMrqrdUsMTTJUkxNQRAOePQwYm0zCRpDNvuapTkKAKuivumzZ+Dv9jii0iBZZV5zcCIeMc5hAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df8f60a69798ebe902dbf1dbcdc6c586c5f423c23ea68409b97c7767513236c3","last_reissued_at":"2026-08-05T00:46:54.837866Z","signature_status":"signed_v1","first_computed_at":"2026-08-05T00:46:54.837866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking ACDGV MinRank Gabidulin encryption schemes over matrix codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Thai Hung Le","submitted_at":"2026-08-04T08:38:48Z","abstract_excerpt":"Enhanced Gabidulin Matrix Codes (EGMC), introduced by Aragon, Couvreur, Dyseryn, Gaborit, and Vincotte at Asiacrypt 2024, were designed to hide the algebraic structure of Gabidulin matrix codes while enabling very compact McEliece- and Niederreiter-type encryption schemes, with ciphertexts as small as $65$ bytes at the claimed 128-bit security level. Their security relies on the assumption that a masked EGMC code is hard to distinguish from a random matrix code. We show that this enhanced construction leaves enough structure for an equivalent code of the secret key to be recovered. Unlike prev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.03328","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.03328/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.03328","created_at":"2026-08-05T00:46:54.838897+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.03328v1","created_at":"2026-08-05T00:46:54.838897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.03328","created_at":"2026-08-05T00:46:54.838897+00:00"},{"alias_kind":"pith_short_12","alias_value":"36HWBJUXTDV6","created_at":"2026-08-05T00:46:54.838897+00:00"},{"alias_kind":"pith_short_16","alias_value":"36HWBJUXTDV6SAW3","created_at":"2026-08-05T00:46:54.838897+00:00"},{"alias_kind":"pith_short_8","alias_value":"36HWBJUX","created_at":"2026-08-05T00:46:54.838897+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/36HWBJUXTDV6SAW36HN43RWFQ3","json":"https://pith.science/pith/36HWBJUXTDV6SAW36HN43RWFQ3.json","graph_json":"https://pith.science/api/pith-number/36HWBJUXTDV6SAW36HN43RWFQ3/graph.json","events_json":"https://pith.science/api/pith-number/36HWBJUXTDV6SAW36HN43RWFQ3/events.json","paper":"https://pith.science/paper/36HWBJUX"},"agent_actions":{"view_html":"https://pith.science/pith/36HWBJUXTDV6SAW36HN43RWFQ3","download_json":"https://pith.science/pith/36HWBJUXTDV6SAW36HN43RWFQ3.json","view_paper":"https://pith.science/paper/36HWBJUX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.03328&json=true","fetch_graph":"https://pith.science/api/pith-number/36HWBJUXTDV6SAW36HN43RWFQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/36HWBJUXTDV6SAW36HN43RWFQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36HWBJUXTDV6SAW36HN43RWFQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36HWBJUXTDV6SAW36HN43RWFQ3/action/storage_attestation","attest_author":"https://pith.science/pith/36HWBJUXTDV6SAW36HN43RWFQ3/action/author_attestation","sign_citation":"https://pith.science/pith/36HWBJUXTDV6SAW36HN43RWFQ3/action/citation_signature","submit_replication":"https://pith.science/pith/36HWBJUXTDV6SAW36HN43RWFQ3/action/replication_record"}},"created_at":"2026-08-05T00:46:54.838897+00:00","updated_at":"2026-08-05T00:46:54.838897+00:00"}