{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VMQJRYHP5FDNGWD3NBERLVO6JL","short_pith_number":"pith:VMQJRYHP","schema_version":"1.0","canonical_sha256":"ab2098e0efe946d3587b684915d5de4add3f6af4468d3437b43da722498e4f35","source":{"kind":"arxiv","id":"1409.4526","version":2},"attestation_state":"computed","paper":{"title":"The Q-curve construction for endomorphism-accelerated elliptic curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Benjamin Smith (INRIA Saclay - Ile de France, LIX)","submitted_at":"2014-09-16T07:25:49Z","abstract_excerpt":"We give a detailed account of the use of $\\mathbb{Q}$-curve reductions to construct elliptic curves over $\\mathbb{F}\\_{p^2}$ with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the same way as Gallant--Lambert--Vanstone (GLV) and Galbraith--Lin--Scott (GLS) endomorphisms. Like GLS (which is a degenerate case of our construction), we offer the advantage over GLV of selecting from a much wider range of curves, and thus finding secure group orders when \\(p\\) is fixed for efficient implementation. Unlike GLS, we also offer the possibilit"},"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":"1409.4526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-09-16T07:25:49Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"5c765c9ff3ec48319161a0d1a00f431692e91586f8296f31ba47be75580e21df","abstract_canon_sha256":"5fec36a89b811007d858f914ee13915b8b1dc200b36921bccaea04cc6a0b5513"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:36.541780Z","signature_b64":"3hbZ9PUiiqpoEZd+V87VngtsisSP69jZRNddLFzjdV86DuQEi1WEljS8c2vkIRijXnUkEJMOCAr/iTg88SGcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab2098e0efe946d3587b684915d5de4add3f6af4468d3437b43da722498e4f35","last_reissued_at":"2026-05-18T02:20:36.541222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:36.541222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Q-curve construction for endomorphism-accelerated elliptic curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Benjamin Smith (INRIA Saclay - Ile de France, LIX)","submitted_at":"2014-09-16T07:25:49Z","abstract_excerpt":"We give a detailed account of the use of $\\mathbb{Q}$-curve reductions to construct elliptic curves over $\\mathbb{F}\\_{p^2}$ with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the same way as Gallant--Lambert--Vanstone (GLV) and Galbraith--Lin--Scott (GLS) endomorphisms. Like GLS (which is a degenerate case of our construction), we offer the advantage over GLV of selecting from a much wider range of curves, and thus finding secure group orders when \\(p\\) is fixed for efficient implementation. Unlike GLS, we also offer the possibilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4526","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":"1409.4526","created_at":"2026-05-18T02:20:36.541324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.4526v2","created_at":"2026-05-18T02:20:36.541324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4526","created_at":"2026-05-18T02:20:36.541324+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMQJRYHP5FDN","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMQJRYHP5FDNGWD3","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMQJRYHP","created_at":"2026-05-18T12:28:54.890064+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/VMQJRYHP5FDNGWD3NBERLVO6JL","json":"https://pith.science/pith/VMQJRYHP5FDNGWD3NBERLVO6JL.json","graph_json":"https://pith.science/api/pith-number/VMQJRYHP5FDNGWD3NBERLVO6JL/graph.json","events_json":"https://pith.science/api/pith-number/VMQJRYHP5FDNGWD3NBERLVO6JL/events.json","paper":"https://pith.science/paper/VMQJRYHP"},"agent_actions":{"view_html":"https://pith.science/pith/VMQJRYHP5FDNGWD3NBERLVO6JL","download_json":"https://pith.science/pith/VMQJRYHP5FDNGWD3NBERLVO6JL.json","view_paper":"https://pith.science/paper/VMQJRYHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.4526&json=true","fetch_graph":"https://pith.science/api/pith-number/VMQJRYHP5FDNGWD3NBERLVO6JL/graph.json","fetch_events":"https://pith.science/api/pith-number/VMQJRYHP5FDNGWD3NBERLVO6JL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMQJRYHP5FDNGWD3NBERLVO6JL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMQJRYHP5FDNGWD3NBERLVO6JL/action/storage_attestation","attest_author":"https://pith.science/pith/VMQJRYHP5FDNGWD3NBERLVO6JL/action/author_attestation","sign_citation":"https://pith.science/pith/VMQJRYHP5FDNGWD3NBERLVO6JL/action/citation_signature","submit_replication":"https://pith.science/pith/VMQJRYHP5FDNGWD3NBERLVO6JL/action/replication_record"}},"created_at":"2026-05-18T02:20:36.541324+00:00","updated_at":"2026-05-18T02:20:36.541324+00:00"}