{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OC7GST2BJB6FYWOKKGTXQ4NSHS","short_pith_number":"pith:OC7GST2B","schema_version":"1.0","canonical_sha256":"70be694f41487c5c59ca51a77871b23cb926331a623671b2da0efcae52b9b524","source":{"kind":"arxiv","id":"1805.11489","version":1},"attestation_state":"computed","paper":{"title":"Recovering short secret keys of RLCE in polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Alain Couvreur, Jean-Pierre Tillich, Matthieu Lequesne","submitted_at":"2018-05-29T14:12:25Z","abstract_excerpt":"We present a key recovery attack against Y. Wang's Random Linear Code Encryption (RLCE) scheme recently submitted to the NIST call for post-quantum cryptography. This attack recovers the secret key for all the short key parameters proposed by the author."},"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":"1805.11489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-05-29T14:12:25Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7d75b72b46e79464fcef1b2efeb6daca186615ad8660fa79cf72eba52c4f61e3","abstract_canon_sha256":"ba62fd2f24d257dfed07c7705f03faf56e54e44dcb6f3cccffba0e1b1b90b943"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:42.337042Z","signature_b64":"6O/B4AVo2SBgftHStF7+sV7v2y1XM4JOX5e8CfvsHO1+Cnf8pB+HL9Z2HeidJG198Pdz8aHFr5jIL1jZ1z0TBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70be694f41487c5c59ca51a77871b23cb926331a623671b2da0efcae52b9b524","last_reissued_at":"2026-05-18T00:14:42.336270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:42.336270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recovering short secret keys of RLCE in polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Alain Couvreur, Jean-Pierre Tillich, Matthieu Lequesne","submitted_at":"2018-05-29T14:12:25Z","abstract_excerpt":"We present a key recovery attack against Y. Wang's Random Linear Code Encryption (RLCE) scheme recently submitted to the NIST call for post-quantum cryptography. This attack recovers the secret key for all the short key parameters proposed by the author."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11489","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":""},"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":"1805.11489","created_at":"2026-05-18T00:14:42.336415+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11489v1","created_at":"2026-05-18T00:14:42.336415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11489","created_at":"2026-05-18T00:14:42.336415+00:00"},{"alias_kind":"pith_short_12","alias_value":"OC7GST2BJB6F","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OC7GST2BJB6FYWOK","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OC7GST2B","created_at":"2026-05-18T12:32:43.782077+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/OC7GST2BJB6FYWOKKGTXQ4NSHS","json":"https://pith.science/pith/OC7GST2BJB6FYWOKKGTXQ4NSHS.json","graph_json":"https://pith.science/api/pith-number/OC7GST2BJB6FYWOKKGTXQ4NSHS/graph.json","events_json":"https://pith.science/api/pith-number/OC7GST2BJB6FYWOKKGTXQ4NSHS/events.json","paper":"https://pith.science/paper/OC7GST2B"},"agent_actions":{"view_html":"https://pith.science/pith/OC7GST2BJB6FYWOKKGTXQ4NSHS","download_json":"https://pith.science/pith/OC7GST2BJB6FYWOKKGTXQ4NSHS.json","view_paper":"https://pith.science/paper/OC7GST2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11489&json=true","fetch_graph":"https://pith.science/api/pith-number/OC7GST2BJB6FYWOKKGTXQ4NSHS/graph.json","fetch_events":"https://pith.science/api/pith-number/OC7GST2BJB6FYWOKKGTXQ4NSHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OC7GST2BJB6FYWOKKGTXQ4NSHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OC7GST2BJB6FYWOKKGTXQ4NSHS/action/storage_attestation","attest_author":"https://pith.science/pith/OC7GST2BJB6FYWOKKGTXQ4NSHS/action/author_attestation","sign_citation":"https://pith.science/pith/OC7GST2BJB6FYWOKKGTXQ4NSHS/action/citation_signature","submit_replication":"https://pith.science/pith/OC7GST2BJB6FYWOKKGTXQ4NSHS/action/replication_record"}},"created_at":"2026-05-18T00:14:42.336415+00:00","updated_at":"2026-05-18T00:14:42.336415+00:00"}