{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IXI3FBQ66HESKY42FNBGLNVNAP","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":"eee5b962ca2d6b6b21a201b2afcb167c74979585da663fc3b51b90a2118b6e79","cross_cats_sorted":["cs.CR","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-05T20:31:28Z","title_canon_sha256":"95d2a04672103c32f8bccf9a638eaae0f2327b32daa1f8d5769c4e1902b3e72a"},"schema_version":"1.0","source":{"id":"1312.1674","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1674","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1674v2","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1674","created_at":"2026-05-18T03:03:57Z"},{"alias_kind":"pith_short_12","alias_value":"IXI3FBQ66HES","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IXI3FBQ66HESKY42","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IXI3FBQ6","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:8e87a9e319dfb895b3c21ab5a8e3f47f5bf991c6fe6d7e2441f90d814daaffc1","target":"graph","created_at":"2026-05-18T03:03:57Z","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":"In \\cite{joux}, Joux devised an algorithm to compute discrete logarithms between elements in a certain subset of the multiplicative group of an extension of the finite field $\\mathbb{F}_{p^n}$ in time polynomial in $p$ and $n$. Shortly after, Barbulescu, Gaudry, Joux and Thome \\cite{bgjt} proposed a descent algorithm that in $(p n)^{\\mathcal{O}(\\log n)}$ time projects an arbitrary element in $\\mathbb{F}_{p^n}^\\times$ as a product of powers of elements in the aforementioned subset. Together, these two algorithms yield a quasi-polynomial time algorithm for computing discrete logarithms in finite","authors_text":"Anand Kumar Narayanan, Ming-Deh Huang","cross_cats":["cs.CR","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-05T20:31:28Z","title":"On the relation generation method of Joux for computing discrete logarithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1674","kind":"arxiv","version":2},"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:ad084aa3b705b9e211c99da21bc8c57dbe444803826ecf880b09cc80141f145a","target":"record","created_at":"2026-05-18T03:03:57Z","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":"eee5b962ca2d6b6b21a201b2afcb167c74979585da663fc3b51b90a2118b6e79","cross_cats_sorted":["cs.CR","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-05T20:31:28Z","title_canon_sha256":"95d2a04672103c32f8bccf9a638eaae0f2327b32daa1f8d5769c4e1902b3e72a"},"schema_version":"1.0","source":{"id":"1312.1674","kind":"arxiv","version":2}},"canonical_sha256":"45d1b2861ef1c925639a2b4265b6ad03ff62d292bd0cf5ea8e499ffba8954b2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45d1b2861ef1c925639a2b4265b6ad03ff62d292bd0cf5ea8e499ffba8954b2f","first_computed_at":"2026-05-18T03:03:57.476357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:57.476357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Is9kSb/aGEt0l3B20x7HPJoZcK9xPurWn7pMlnirDx7HcXuV1f2ZFXkhXqpMtbpUg6WEn95tom77XzZ6YejqBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:57.477223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1674","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad084aa3b705b9e211c99da21bc8c57dbe444803826ecf880b09cc80141f145a","sha256:8e87a9e319dfb895b3c21ab5a8e3f47f5bf991c6fe6d7e2441f90d814daaffc1"],"state_sha256":"472a643c0ba910a4f0cdea4cc2f316fd2e5f47670fe751cf8981c039e82742e2"}