{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OGD2FI6ZQNKE6JZ5XY4DSRAKPK","short_pith_number":"pith:OGD2FI6Z","schema_version":"1.0","canonical_sha256":"7187a2a3d983544f273dbe3839440a7a9eecf9a38c19a1b08a5dd517003c54bb","source":{"kind":"arxiv","id":"1907.02689","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Antoine Joux (IMJ-PRG, Cecile Pierrot (LORIA), OURAGAN)","submitted_at":"2019-07-05T06:27:39Z","abstract_excerpt":"Elliptic bases, introduced by Couveignes and Lercier in 2009, give an elegant way of representing finite field extensions. A natural question which seems to have been considered independently by several groups is to use this representation as a starting point for small characteristic finite field discrete logarithm algorithms. This idea has been recently proposed by two groups working on it, in order to achieve provable quasi-polynomial time for discrete logarithms in small characteristic finite fields. In this paper, we don't try to achieve a provable algorithm but, instead, investigate the p"},"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":"1907.02689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-07-05T06:27:39Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"5b55e000686cc5ac02ac23577868d67fbf7326c7047387270c924438cc92e724","abstract_canon_sha256":"6b99c5ee853827274317ce9b7011e6378ec12c9042c86611af8ac2bb6e8bda33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:23.488446Z","signature_b64":"thkWKmqAfwub3wol7AnTZsNqcELv0kMcBVz4dsblSG2s7EhzfziMefO057ribzUxXcthOghhzJFcfMEaSaWSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7187a2a3d983544f273dbe3839440a7a9eecf9a38c19a1b08a5dd517003c54bb","last_reissued_at":"2026-05-17T23:41:23.487776Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:23.487776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Antoine Joux (IMJ-PRG, Cecile Pierrot (LORIA), OURAGAN)","submitted_at":"2019-07-05T06:27:39Z","abstract_excerpt":"Elliptic bases, introduced by Couveignes and Lercier in 2009, give an elegant way of representing finite field extensions. A natural question which seems to have been considered independently by several groups is to use this representation as a starting point for small characteristic finite field discrete logarithm algorithms. This idea has been recently proposed by two groups working on it, in order to achieve provable quasi-polynomial time for discrete logarithms in small characteristic finite fields. In this paper, we don't try to achieve a provable algorithm but, instead, investigate the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02689","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":"1907.02689","created_at":"2026-05-17T23:41:23.487888+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.02689v1","created_at":"2026-05-17T23:41:23.487888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02689","created_at":"2026-05-17T23:41:23.487888+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGD2FI6ZQNKE","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGD2FI6ZQNKE6JZ5","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGD2FI6Z","created_at":"2026-05-18T12:33:24.271573+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/OGD2FI6ZQNKE6JZ5XY4DSRAKPK","json":"https://pith.science/pith/OGD2FI6ZQNKE6JZ5XY4DSRAKPK.json","graph_json":"https://pith.science/api/pith-number/OGD2FI6ZQNKE6JZ5XY4DSRAKPK/graph.json","events_json":"https://pith.science/api/pith-number/OGD2FI6ZQNKE6JZ5XY4DSRAKPK/events.json","paper":"https://pith.science/paper/OGD2FI6Z"},"agent_actions":{"view_html":"https://pith.science/pith/OGD2FI6ZQNKE6JZ5XY4DSRAKPK","download_json":"https://pith.science/pith/OGD2FI6ZQNKE6JZ5XY4DSRAKPK.json","view_paper":"https://pith.science/paper/OGD2FI6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.02689&json=true","fetch_graph":"https://pith.science/api/pith-number/OGD2FI6ZQNKE6JZ5XY4DSRAKPK/graph.json","fetch_events":"https://pith.science/api/pith-number/OGD2FI6ZQNKE6JZ5XY4DSRAKPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGD2FI6ZQNKE6JZ5XY4DSRAKPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGD2FI6ZQNKE6JZ5XY4DSRAKPK/action/storage_attestation","attest_author":"https://pith.science/pith/OGD2FI6ZQNKE6JZ5XY4DSRAKPK/action/author_attestation","sign_citation":"https://pith.science/pith/OGD2FI6ZQNKE6JZ5XY4DSRAKPK/action/citation_signature","submit_replication":"https://pith.science/pith/OGD2FI6ZQNKE6JZ5XY4DSRAKPK/action/replication_record"}},"created_at":"2026-05-17T23:41:23.487888+00:00","updated_at":"2026-05-17T23:41:23.487888+00:00"}