{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ST7WZBZUPVNAD5Z4WLIZ72MWUH","short_pith_number":"pith:ST7WZBZU","schema_version":"1.0","canonical_sha256":"94ff6c87347d5a01f73cb2d19fe996a1ef048962ffa5e5a5e09f7d644dba0b8f","source":{"kind":"arxiv","id":"1305.3769","version":2},"attestation_state":"computed","paper":{"title":"A reduction from LWE problem to dihedral coset problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Fada Li, Tan Li, Wansu Bao, Xiangqun Fu, Yuchao Zhang","submitted_at":"2013-05-16T11:56:42Z","abstract_excerpt":"Learning with Errors (LWE) problems are the foundations for numerous applications in lattice-based cryptography and are provably as hard as approximate lattice problems in the worst case. Here we present a reduction from LWE problem to dihedral coset problem(DCP). We present a quantum algorithm to generate the input of the two point problem which hides the solution of LWE. We then give a new reduction from two point problem to dihedral coset problem on D_{{{({n^{13}})}^{n\\log n}}}. Our reduction implicate that any algorithm solves DCP in subexponential time would lead a quantum algorithm for L"},"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":"1305.3769","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-05-16T11:56:42Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a401735b37a5b5076d63c16cfebf18a379f5f5b54cdf486479f1cca0219a7dda","abstract_canon_sha256":"0432b8cff184803f324f7e72d3ef6fa9319732735af5fd80ab97a5b3f7f3b194"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:53.498932Z","signature_b64":"cxlLczVstHsTPuv3XQoKWuWCLtgPobPqvASd1EGrKf/FQ2S/H1ifYkFcLXF5zdShNZh+jfunlR1VLdJFntiJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94ff6c87347d5a01f73cb2d19fe996a1ef048962ffa5e5a5e09f7d644dba0b8f","last_reissued_at":"2026-05-18T03:21:53.498399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:53.498399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A reduction from LWE problem to dihedral coset problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Fada Li, Tan Li, Wansu Bao, Xiangqun Fu, Yuchao Zhang","submitted_at":"2013-05-16T11:56:42Z","abstract_excerpt":"Learning with Errors (LWE) problems are the foundations for numerous applications in lattice-based cryptography and are provably as hard as approximate lattice problems in the worst case. Here we present a reduction from LWE problem to dihedral coset problem(DCP). We present a quantum algorithm to generate the input of the two point problem which hides the solution of LWE. We then give a new reduction from two point problem to dihedral coset problem on D_{{{({n^{13}})}^{n\\log n}}}. Our reduction implicate that any algorithm solves DCP in subexponential time would lead a quantum algorithm for L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3769","kind":"arxiv","version":2},"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":"1305.3769","created_at":"2026-05-18T03:21:53.498474+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.3769v2","created_at":"2026-05-18T03:21:53.498474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3769","created_at":"2026-05-18T03:21:53.498474+00:00"},{"alias_kind":"pith_short_12","alias_value":"ST7WZBZUPVNA","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"ST7WZBZUPVNAD5Z4","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"ST7WZBZU","created_at":"2026-05-18T12:27:59.945178+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/ST7WZBZUPVNAD5Z4WLIZ72MWUH","json":"https://pith.science/pith/ST7WZBZUPVNAD5Z4WLIZ72MWUH.json","graph_json":"https://pith.science/api/pith-number/ST7WZBZUPVNAD5Z4WLIZ72MWUH/graph.json","events_json":"https://pith.science/api/pith-number/ST7WZBZUPVNAD5Z4WLIZ72MWUH/events.json","paper":"https://pith.science/paper/ST7WZBZU"},"agent_actions":{"view_html":"https://pith.science/pith/ST7WZBZUPVNAD5Z4WLIZ72MWUH","download_json":"https://pith.science/pith/ST7WZBZUPVNAD5Z4WLIZ72MWUH.json","view_paper":"https://pith.science/paper/ST7WZBZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.3769&json=true","fetch_graph":"https://pith.science/api/pith-number/ST7WZBZUPVNAD5Z4WLIZ72MWUH/graph.json","fetch_events":"https://pith.science/api/pith-number/ST7WZBZUPVNAD5Z4WLIZ72MWUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ST7WZBZUPVNAD5Z4WLIZ72MWUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ST7WZBZUPVNAD5Z4WLIZ72MWUH/action/storage_attestation","attest_author":"https://pith.science/pith/ST7WZBZUPVNAD5Z4WLIZ72MWUH/action/author_attestation","sign_citation":"https://pith.science/pith/ST7WZBZUPVNAD5Z4WLIZ72MWUH/action/citation_signature","submit_replication":"https://pith.science/pith/ST7WZBZUPVNAD5Z4WLIZ72MWUH/action/replication_record"}},"created_at":"2026-05-18T03:21:53.498474+00:00","updated_at":"2026-05-18T03:21:53.498474+00:00"}