{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JEJPKBIRPHUBYTUCH3EMIORWAK","short_pith_number":"pith:JEJPKBIR","schema_version":"1.0","canonical_sha256":"4912f5051179e81c4e823ec8c43a360282cd6d2a10bdb0cd22aed72a06bf0f3c","source":{"kind":"arxiv","id":"1604.03072","version":3},"attestation_state":"computed","paper":{"title":"Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.NT"],"primary_cat":"cs.DS","authors_text":"Anand Kumar Narayanan","submitted_at":"2016-04-11T19:11:02Z","abstract_excerpt":"We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two fields of cardinality $q^n$, our algorithm takes $$n^{1+o(1)} \\log^{1+o(1)}q + \\max_{\\ell} \\left(\\ell^{n_\\ell + 1+o(1)} \\log^{2+o(1)} q + O(\\ell \\log^5q)\\right)$$ time, where $\\ell$ runs through primes dividing $n$ but not $q(q-1)$ and $n_\\ell$ denotes the highest power of $\\ell$ dividing $n$. Prior to this work, the best known run time dependence on $n$ was quadratic. Our run time dependence on $n$ is at worst quadratic but is subquadratic if $n$ has no "},"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":"1604.03072","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-11T19:11:02Z","cross_cats_sorted":["cs.CC","math.NT"],"title_canon_sha256":"a6a96caa4bd32cf5c8c47325b3e41a681f73479de033e7d0316664b4643488df","abstract_canon_sha256":"b52fd47ac9eb6dd169efa42cc8299ab9e3505a6c2ef201d4e79db9b34094b890"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:16.367895Z","signature_b64":"YDljZcXAN7eJZ6Rr3q76ACRSUcqe4zGURhNFV78I/MYu6GFHHQnyg9U8t/mvZXoZGHIUbnBGWMhQ86ZJgTsPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4912f5051179e81c4e823ec8c43a360282cd6d2a10bdb0cd22aed72a06bf0f3c","last_reissued_at":"2026-05-18T00:08:16.367356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:16.367356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.NT"],"primary_cat":"cs.DS","authors_text":"Anand Kumar Narayanan","submitted_at":"2016-04-11T19:11:02Z","abstract_excerpt":"We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two fields of cardinality $q^n$, our algorithm takes $$n^{1+o(1)} \\log^{1+o(1)}q + \\max_{\\ell} \\left(\\ell^{n_\\ell + 1+o(1)} \\log^{2+o(1)} q + O(\\ell \\log^5q)\\right)$$ time, where $\\ell$ runs through primes dividing $n$ but not $q(q-1)$ and $n_\\ell$ denotes the highest power of $\\ell$ dividing $n$. Prior to this work, the best known run time dependence on $n$ was quadratic. Our run time dependence on $n$ is at worst quadratic but is subquadratic if $n$ has no "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03072","kind":"arxiv","version":3},"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":"1604.03072","created_at":"2026-05-18T00:08:16.367448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.03072v3","created_at":"2026-05-18T00:08:16.367448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03072","created_at":"2026-05-18T00:08:16.367448+00:00"},{"alias_kind":"pith_short_12","alias_value":"JEJPKBIRPHUB","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JEJPKBIRPHUBYTUC","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JEJPKBIR","created_at":"2026-05-18T12:30:25.849896+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/JEJPKBIRPHUBYTUCH3EMIORWAK","json":"https://pith.science/pith/JEJPKBIRPHUBYTUCH3EMIORWAK.json","graph_json":"https://pith.science/api/pith-number/JEJPKBIRPHUBYTUCH3EMIORWAK/graph.json","events_json":"https://pith.science/api/pith-number/JEJPKBIRPHUBYTUCH3EMIORWAK/events.json","paper":"https://pith.science/paper/JEJPKBIR"},"agent_actions":{"view_html":"https://pith.science/pith/JEJPKBIRPHUBYTUCH3EMIORWAK","download_json":"https://pith.science/pith/JEJPKBIRPHUBYTUCH3EMIORWAK.json","view_paper":"https://pith.science/paper/JEJPKBIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.03072&json=true","fetch_graph":"https://pith.science/api/pith-number/JEJPKBIRPHUBYTUCH3EMIORWAK/graph.json","fetch_events":"https://pith.science/api/pith-number/JEJPKBIRPHUBYTUCH3EMIORWAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JEJPKBIRPHUBYTUCH3EMIORWAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JEJPKBIRPHUBYTUCH3EMIORWAK/action/storage_attestation","attest_author":"https://pith.science/pith/JEJPKBIRPHUBYTUCH3EMIORWAK/action/author_attestation","sign_citation":"https://pith.science/pith/JEJPKBIRPHUBYTUCH3EMIORWAK/action/citation_signature","submit_replication":"https://pith.science/pith/JEJPKBIRPHUBYTUCH3EMIORWAK/action/replication_record"}},"created_at":"2026-05-18T00:08:16.367448+00:00","updated_at":"2026-05-18T00:08:16.367448+00:00"}