{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KI2BC2AUHJTM6ZGJGOC6ZZ43ZQ","short_pith_number":"pith:KI2BC2AU","canonical_record":{"source":{"id":"1504.05431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-04-21T13:37:04Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"667114fe223e0fd5af18e2e42e0b850888b83d746e9881b81de3a57ffb8e0260","abstract_canon_sha256":"b56509d241b5215e8914a83c9ccf225abfc919e0dba2853fe1306d975d0d0a51"},"schema_version":"1.0"},"canonical_sha256":"52341168143a66cf64c93385ece79bcc22ff9bd8f35224fb6687e924a1e4cc33","source":{"kind":"arxiv","id":"1504.05431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05431","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05431v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05431","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"KI2BC2AUHJTM","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KI2BC2AUHJTM6ZGJ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KI2BC2AU","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KI2BC2AUHJTM6ZGJGOC6ZZ43ZQ","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-04-21T13:37:04Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"667114fe223e0fd5af18e2e42e0b850888b83d746e9881b81de3a57ffb8e0260","abstract_canon_sha256":"b56509d241b5215e8914a83c9ccf225abfc919e0dba2853fe1306d975d0d0a51"},"schema_version":"1.0"},"canonical_sha256":"52341168143a66cf64c93385ece79bcc22ff9bd8f35224fb6687e924a1e4cc33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:14.304438Z","signature_b64":"XHAbjD47FnDvlx56qos8f6OyQJF7OYlX8CNt1685k6mauzA+1SoXcNltEANbVRTnWYqS/rFf8X0hGvydvjLUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52341168143a66cf64c93385ece79bcc22ff9bd8f35224fb6687e924a1e4cc33","last_reissued_at":"2026-05-18T02:18:14.303772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:14.303772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05431","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pFepPdAO1xs25o3sOu2Ai9dreftjkCYt4J6msad5zTaMsFkdjWemsYpQmJooyKe6g6NpprMqTDjSwE4fs923Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:17:31.770750Z"},"content_sha256":"9913bfe78e5288e08cdd769affdd4d6a6a2780d3c48f8bca17d4b931c242fc5b","schema_version":"1.0","event_id":"sha256:9913bfe78e5288e08cdd769affdd4d6a6a2780d3c48f8bca17d4b931c242fc5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KI2BC2AUHJTM6ZGJGOC6ZZ43ZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Adrien Hauteville, Jean-Pierre Tillich","submitted_at":"2015-04-21T13:37:04Z","abstract_excerpt":"We consider the decoding problem or the problem of finding low weight codewords for rank metric codes. We show how additional information about the codeword we want to find under the form of certain linear combinations of the entries of the codeword leads to algorithms with a better complexity. This is then used together with a folding technique for attacking a McEliece scheme based on LRPC codes. It leads to a feasible attack on one of the parameters suggested in \\cite{GMRZ13}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05431","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ue65P7nWG69n/v/Hogu+EMdP8QmmOTCnRVt68irFZEUBQzuPwjn2Z1yGUgK6SdDnlkFaOhTn3KHoBxT0RsT6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:17:31.771459Z"},"content_sha256":"d0b4d60ecd7656f37c8f15e83b096bc643760dad05c54310950bcba1828ef347","schema_version":"1.0","event_id":"sha256:d0b4d60ecd7656f37c8f15e83b096bc643760dad05c54310950bcba1828ef347"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KI2BC2AUHJTM6ZGJGOC6ZZ43ZQ/bundle.json","state_url":"https://pith.science/pith/KI2BC2AUHJTM6ZGJGOC6ZZ43ZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KI2BC2AUHJTM6ZGJGOC6ZZ43ZQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T01:17:31Z","links":{"resolver":"https://pith.science/pith/KI2BC2AUHJTM6ZGJGOC6ZZ43ZQ","bundle":"https://pith.science/pith/KI2BC2AUHJTM6ZGJGOC6ZZ43ZQ/bundle.json","state":"https://pith.science/pith/KI2BC2AUHJTM6ZGJGOC6ZZ43ZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KI2BC2AUHJTM6ZGJGOC6ZZ43ZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KI2BC2AUHJTM6ZGJGOC6ZZ43ZQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b56509d241b5215e8914a83c9ccf225abfc919e0dba2853fe1306d975d0d0a51","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-04-21T13:37:04Z","title_canon_sha256":"667114fe223e0fd5af18e2e42e0b850888b83d746e9881b81de3a57ffb8e0260"},"schema_version":"1.0","source":{"id":"1504.05431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05431","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05431v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05431","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"KI2BC2AUHJTM","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KI2BC2AUHJTM6ZGJ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KI2BC2AU","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:d0b4d60ecd7656f37c8f15e83b096bc643760dad05c54310950bcba1828ef347","target":"graph","created_at":"2026-05-18T02:18:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider the decoding problem or the problem of finding low weight codewords for rank metric codes. We show how additional information about the codeword we want to find under the form of certain linear combinations of the entries of the codeword leads to algorithms with a better complexity. This is then used together with a folding technique for attacking a McEliece scheme based on LRPC codes. It leads to a feasible attack on one of the parameters suggested in \\cite{GMRZ13}.","authors_text":"Adrien Hauteville, Jean-Pierre Tillich","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-04-21T13:37:04Z","title":"New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05431","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9913bfe78e5288e08cdd769affdd4d6a6a2780d3c48f8bca17d4b931c242fc5b","target":"record","created_at":"2026-05-18T02:18:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b56509d241b5215e8914a83c9ccf225abfc919e0dba2853fe1306d975d0d0a51","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-04-21T13:37:04Z","title_canon_sha256":"667114fe223e0fd5af18e2e42e0b850888b83d746e9881b81de3a57ffb8e0260"},"schema_version":"1.0","source":{"id":"1504.05431","kind":"arxiv","version":1}},"canonical_sha256":"52341168143a66cf64c93385ece79bcc22ff9bd8f35224fb6687e924a1e4cc33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52341168143a66cf64c93385ece79bcc22ff9bd8f35224fb6687e924a1e4cc33","first_computed_at":"2026-05-18T02:18:14.303772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:14.303772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XHAbjD47FnDvlx56qos8f6OyQJF7OYlX8CNt1685k6mauzA+1SoXcNltEANbVRTnWYqS/rFf8X0hGvydvjLUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:14.304438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9913bfe78e5288e08cdd769affdd4d6a6a2780d3c48f8bca17d4b931c242fc5b","sha256:d0b4d60ecd7656f37c8f15e83b096bc643760dad05c54310950bcba1828ef347"],"state_sha256":"fb5da6e5cbb2ecf95f39f67797ee32cadbe865a96bfd7f31261a3da53570e725"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aiBXit8oi+Q51d7dXBV/Bsqbbwbfp21C5cZwo4ns4k7oIt3RNd+KCg0TfpS5ew2OPZTTexGZ7pYcQvcjvzmKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:17:31.775347Z","bundle_sha256":"f4557276feac1ee4ff8d08735673174b737efbefe8482edd8d6f11af87b0ebe3"}}