{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IXI3FBQ66HESKY42FNBGLNVNAP","short_pith_number":"pith:IXI3FBQ6","schema_version":"1.0","canonical_sha256":"45d1b2861ef1c925639a2b4265b6ad03ff62d292bd0cf5ea8e499ffba8954b2f","source":{"kind":"arxiv","id":"1312.1674","version":2},"attestation_state":"computed","paper":{"title":"On the relation generation method of Joux for computing discrete logarithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.NT"],"primary_cat":"cs.CC","authors_text":"Anand Kumar Narayanan, Ming-Deh Huang","submitted_at":"2013-12-05T20:31:28Z","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"},"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":"1312.1674","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-12-05T20:31:28Z","cross_cats_sorted":["cs.CR","math.NT"],"title_canon_sha256":"95d2a04672103c32f8bccf9a638eaae0f2327b32daa1f8d5769c4e1902b3e72a","abstract_canon_sha256":"eee5b962ca2d6b6b21a201b2afcb167c74979585da663fc3b51b90a2118b6e79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:57.477223Z","signature_b64":"Is9kSb/aGEt0l3B20x7HPJoZcK9xPurWn7pMlnirDx7HcXuV1f2ZFXkhXqpMtbpUg6WEn95tom77XzZ6YejqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45d1b2861ef1c925639a2b4265b6ad03ff62d292bd0cf5ea8e499ffba8954b2f","last_reissued_at":"2026-05-18T03:03:57.476357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:57.476357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the relation generation method of Joux for computing discrete logarithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.NT"],"primary_cat":"cs.CC","authors_text":"Anand Kumar Narayanan, Ming-Deh Huang","submitted_at":"2013-12-05T20:31:28Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1674","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":"1312.1674","created_at":"2026-05-18T03:03:57.476508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1674v2","created_at":"2026-05-18T03:03:57.476508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1674","created_at":"2026-05-18T03:03:57.476508+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXI3FBQ66HES","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXI3FBQ66HESKY42","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXI3FBQ6","created_at":"2026-05-18T12:27:49.015174+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/IXI3FBQ66HESKY42FNBGLNVNAP","json":"https://pith.science/pith/IXI3FBQ66HESKY42FNBGLNVNAP.json","graph_json":"https://pith.science/api/pith-number/IXI3FBQ66HESKY42FNBGLNVNAP/graph.json","events_json":"https://pith.science/api/pith-number/IXI3FBQ66HESKY42FNBGLNVNAP/events.json","paper":"https://pith.science/paper/IXI3FBQ6"},"agent_actions":{"view_html":"https://pith.science/pith/IXI3FBQ66HESKY42FNBGLNVNAP","download_json":"https://pith.science/pith/IXI3FBQ66HESKY42FNBGLNVNAP.json","view_paper":"https://pith.science/paper/IXI3FBQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1674&json=true","fetch_graph":"https://pith.science/api/pith-number/IXI3FBQ66HESKY42FNBGLNVNAP/graph.json","fetch_events":"https://pith.science/api/pith-number/IXI3FBQ66HESKY42FNBGLNVNAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXI3FBQ66HESKY42FNBGLNVNAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXI3FBQ66HESKY42FNBGLNVNAP/action/storage_attestation","attest_author":"https://pith.science/pith/IXI3FBQ66HESKY42FNBGLNVNAP/action/author_attestation","sign_citation":"https://pith.science/pith/IXI3FBQ66HESKY42FNBGLNVNAP/action/citation_signature","submit_replication":"https://pith.science/pith/IXI3FBQ66HESKY42FNBGLNVNAP/action/replication_record"}},"created_at":"2026-05-18T03:03:57.476508+00:00","updated_at":"2026-05-18T03:03:57.476508+00:00"}