{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:53VDFWMQMDNJ6KFSMVE6Q3JGGN","short_pith_number":"pith:53VDFWMQ","schema_version":"1.0","canonical_sha256":"eeea32d99060da9f28b26549e86d26334bca8c8bf9f8e67de0d6fdb95944394f","source":{"kind":"arxiv","id":"1808.00714","version":1},"attestation_state":"computed","paper":{"title":"Improved Quantum Information Set Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Elena Kirshanova","submitted_at":"2018-08-02T09:04:26Z","abstract_excerpt":"In this paper we present quantum information set decoding (ISD) algorithms for binary linear codes. First, we give an alternative view on the quantum walk based algorithms proposed by Kachigar and Tillich (PQCrypto'17). It is more general and allows to consider any ISD algorithm that has certain properties. The algorithms of May-Meuer-Thomae and Becker-Jeux-May-Meuer satisfy these properties. Second, we translate May-Ozerov Near Neighbour technique (Eurocrypt'15) to an `update-and-query' language more suitable for the quantum walk framework. First, this re-interpretation makes possible to anal"},"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":"1808.00714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-02T09:04:26Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"eafb3be7cdd935138dddd9aa16b8ce250ec415b89372d2c5fbb7c142123494b0","abstract_canon_sha256":"9be4455bd4005babd6871258a99d89c9907a884ec00fbca3d15969a978b3c216"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:03.592177Z","signature_b64":"V4w2StfqW0B8d7fRtxlFT3LnNr++xEZI/NSmJdQR2DvzmmJ84I0F4/qKl5uG/dBpS5pe82III9+VTeTKf+9eAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeea32d99060da9f28b26549e86d26334bca8c8bf9f8e67de0d6fdb95944394f","last_reissued_at":"2026-05-18T00:09:03.591639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:03.591639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Quantum Information Set Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Elena Kirshanova","submitted_at":"2018-08-02T09:04:26Z","abstract_excerpt":"In this paper we present quantum information set decoding (ISD) algorithms for binary linear codes. First, we give an alternative view on the quantum walk based algorithms proposed by Kachigar and Tillich (PQCrypto'17). It is more general and allows to consider any ISD algorithm that has certain properties. The algorithms of May-Meuer-Thomae and Becker-Jeux-May-Meuer satisfy these properties. Second, we translate May-Ozerov Near Neighbour technique (Eurocrypt'15) to an `update-and-query' language more suitable for the quantum walk framework. First, this re-interpretation makes possible to anal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.00714","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":"1808.00714","created_at":"2026-05-18T00:09:03.591716+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.00714v1","created_at":"2026-05-18T00:09:03.591716+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.00714","created_at":"2026-05-18T00:09:03.591716+00:00"},{"alias_kind":"pith_short_12","alias_value":"53VDFWMQMDNJ","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"53VDFWMQMDNJ6KFS","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"53VDFWMQ","created_at":"2026-05-18T12:32:05.422762+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/53VDFWMQMDNJ6KFSMVE6Q3JGGN","json":"https://pith.science/pith/53VDFWMQMDNJ6KFSMVE6Q3JGGN.json","graph_json":"https://pith.science/api/pith-number/53VDFWMQMDNJ6KFSMVE6Q3JGGN/graph.json","events_json":"https://pith.science/api/pith-number/53VDFWMQMDNJ6KFSMVE6Q3JGGN/events.json","paper":"https://pith.science/paper/53VDFWMQ"},"agent_actions":{"view_html":"https://pith.science/pith/53VDFWMQMDNJ6KFSMVE6Q3JGGN","download_json":"https://pith.science/pith/53VDFWMQMDNJ6KFSMVE6Q3JGGN.json","view_paper":"https://pith.science/paper/53VDFWMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.00714&json=true","fetch_graph":"https://pith.science/api/pith-number/53VDFWMQMDNJ6KFSMVE6Q3JGGN/graph.json","fetch_events":"https://pith.science/api/pith-number/53VDFWMQMDNJ6KFSMVE6Q3JGGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53VDFWMQMDNJ6KFSMVE6Q3JGGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53VDFWMQMDNJ6KFSMVE6Q3JGGN/action/storage_attestation","attest_author":"https://pith.science/pith/53VDFWMQMDNJ6KFSMVE6Q3JGGN/action/author_attestation","sign_citation":"https://pith.science/pith/53VDFWMQMDNJ6KFSMVE6Q3JGGN/action/citation_signature","submit_replication":"https://pith.science/pith/53VDFWMQMDNJ6KFSMVE6Q3JGGN/action/replication_record"}},"created_at":"2026-05-18T00:09:03.591716+00:00","updated_at":"2026-05-18T00:09:03.591716+00:00"}