{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FGGR4Z5OO2W3FLP5LUDK4SPPST","short_pith_number":"pith:FGGR4Z5O","schema_version":"1.0","canonical_sha256":"298d1e67ae76adb2adfd5d06ae49ef94dfb7b3167eb5169a9e97788691b268e0","source":{"kind":"arxiv","id":"1306.4244","version":2},"attestation_state":"computed","paper":{"title":"A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Antoine Joux (PRISM), Emmanuel Thom\\'e (INRIA Nancy - Grand Est / LORIA), Pierrick Gaudry (INRIA Nancy - Grand Est / LORIA), Razvan Barbulescu (INRIA Nancy - Grand Est / LORIA)","submitted_at":"2013-06-18T15:28:56Z","abstract_excerpt":"In the present work, we present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main result gives a quasi-polynomial heuristic complexity for the discrete logarithm problem in finite field of small characteristic. By quasi-polynomial, we mean a complexity of type $n^{O(\\log n)}$ where $n$ is the bit-size of the cardinality of the finite field. Such a complexity is smaller than any $L(\\varepsilon)$ for $\\epsilon>0$. It remains super-polynomial in the size of the input, but offers a major asymptotic imp"},"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":"1306.4244","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-06-18T15:28:56Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"e4b2ae81a20861053e9dd97313817cc4696b8dbe2dcd9794b0e5931788ef2511","abstract_canon_sha256":"d45e20bda0b2e082d8d0984489456b5ac0087030a0cf63ea16669285c06e6b25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:13.213678Z","signature_b64":"pQV05Ej6M9XyABrOB3YarCy6/JB4axmdTF7spVScDsInBoVMBBEwIkm5NiXoPzWDfRwdSZAMlM3YUpNURzpqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"298d1e67ae76adb2adfd5d06ae49ef94dfb7b3167eb5169a9e97788691b268e0","last_reissued_at":"2026-05-18T03:06:13.212829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:13.212829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Antoine Joux (PRISM), Emmanuel Thom\\'e (INRIA Nancy - Grand Est / LORIA), Pierrick Gaudry (INRIA Nancy - Grand Est / LORIA), Razvan Barbulescu (INRIA Nancy - Grand Est / LORIA)","submitted_at":"2013-06-18T15:28:56Z","abstract_excerpt":"In the present work, we present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main result gives a quasi-polynomial heuristic complexity for the discrete logarithm problem in finite field of small characteristic. By quasi-polynomial, we mean a complexity of type $n^{O(\\log n)}$ where $n$ is the bit-size of the cardinality of the finite field. Such a complexity is smaller than any $L(\\varepsilon)$ for $\\epsilon>0$. It remains super-polynomial in the size of the input, but offers a major asymptotic imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4244","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":"1306.4244","created_at":"2026-05-18T03:06:13.212983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4244v2","created_at":"2026-05-18T03:06:13.212983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4244","created_at":"2026-05-18T03:06:13.212983+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGGR4Z5OO2W3","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGGR4Z5OO2W3FLP5","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGGR4Z5O","created_at":"2026-05-18T12:27:45.050594+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/FGGR4Z5OO2W3FLP5LUDK4SPPST","json":"https://pith.science/pith/FGGR4Z5OO2W3FLP5LUDK4SPPST.json","graph_json":"https://pith.science/api/pith-number/FGGR4Z5OO2W3FLP5LUDK4SPPST/graph.json","events_json":"https://pith.science/api/pith-number/FGGR4Z5OO2W3FLP5LUDK4SPPST/events.json","paper":"https://pith.science/paper/FGGR4Z5O"},"agent_actions":{"view_html":"https://pith.science/pith/FGGR4Z5OO2W3FLP5LUDK4SPPST","download_json":"https://pith.science/pith/FGGR4Z5OO2W3FLP5LUDK4SPPST.json","view_paper":"https://pith.science/paper/FGGR4Z5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4244&json=true","fetch_graph":"https://pith.science/api/pith-number/FGGR4Z5OO2W3FLP5LUDK4SPPST/graph.json","fetch_events":"https://pith.science/api/pith-number/FGGR4Z5OO2W3FLP5LUDK4SPPST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGGR4Z5OO2W3FLP5LUDK4SPPST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGGR4Z5OO2W3FLP5LUDK4SPPST/action/storage_attestation","attest_author":"https://pith.science/pith/FGGR4Z5OO2W3FLP5LUDK4SPPST/action/author_attestation","sign_citation":"https://pith.science/pith/FGGR4Z5OO2W3FLP5LUDK4SPPST/action/citation_signature","submit_replication":"https://pith.science/pith/FGGR4Z5OO2W3FLP5LUDK4SPPST/action/replication_record"}},"created_at":"2026-05-18T03:06:13.212983+00:00","updated_at":"2026-05-18T03:06:13.212983+00:00"}