{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UDZC7X6TXBPNSSMP4EYJ453M4G","short_pith_number":"pith:UDZC7X6T","schema_version":"1.0","canonical_sha256":"a0f22fdfd3b85ed9498fe1309e776ce1b9de0c8dfc2c5c5b398e993f391c9982","source":{"kind":"arxiv","id":"1209.6348","version":1},"attestation_state":"computed","paper":{"title":"Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.ET"],"primary_cat":"quant-ph","authors_text":"Brittanney Amento, Martin Roetteler, Rainer Steinwandt","submitted_at":"2012-09-27T19:54:28Z","abstract_excerpt":"Elliptic curves over finite fields GF(2^n) play a prominent role in modern cryptography. Published quantum algorithms dealing with such curves build on a short Weierstrass form in combination with affine or projective coordinates. In this paper we show that changing the curve representation allows a substantial reduction in the number of T-gates needed to implement the curve arithmetic. As a tool, we present a quantum circuit for computing multiplicative inverses in GF(2^n) in depth O(n log n) using a polynomial basis representation, which may be of independent interest."},"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":"1209.6348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-09-27T19:54:28Z","cross_cats_sorted":["cs.DS","cs.ET"],"title_canon_sha256":"21c11e536b12e740668c2147ed06eb3a55736740efc76ee52575033fc5dd50b0","abstract_canon_sha256":"2a8a7e820ec0d8218b14ff7fa24c24004dcfffdc347276143134232b88681465"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:36.295462Z","signature_b64":"NHRhiVC6vHOUahVus4Y6mNl44c+gnWQ2sHb9FSP83qGTEakIU4mxFmbl+AVV59qJ29Nbv2DKUgfx9xfxWuZ3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0f22fdfd3b85ed9498fe1309e776ce1b9de0c8dfc2c5c5b398e993f391c9982","last_reissued_at":"2026-05-18T03:05:36.294983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:36.294983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.ET"],"primary_cat":"quant-ph","authors_text":"Brittanney Amento, Martin Roetteler, Rainer Steinwandt","submitted_at":"2012-09-27T19:54:28Z","abstract_excerpt":"Elliptic curves over finite fields GF(2^n) play a prominent role in modern cryptography. Published quantum algorithms dealing with such curves build on a short Weierstrass form in combination with affine or projective coordinates. In this paper we show that changing the curve representation allows a substantial reduction in the number of T-gates needed to implement the curve arithmetic. As a tool, we present a quantum circuit for computing multiplicative inverses in GF(2^n) in depth O(n log n) using a polynomial basis representation, which may be of independent interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.6348","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":"1209.6348","created_at":"2026-05-18T03:05:36.295054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.6348v1","created_at":"2026-05-18T03:05:36.295054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.6348","created_at":"2026-05-18T03:05:36.295054+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDZC7X6TXBPN","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDZC7X6TXBPNSSMP","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDZC7X6T","created_at":"2026-05-18T12:27:23.164592+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/UDZC7X6TXBPNSSMP4EYJ453M4G","json":"https://pith.science/pith/UDZC7X6TXBPNSSMP4EYJ453M4G.json","graph_json":"https://pith.science/api/pith-number/UDZC7X6TXBPNSSMP4EYJ453M4G/graph.json","events_json":"https://pith.science/api/pith-number/UDZC7X6TXBPNSSMP4EYJ453M4G/events.json","paper":"https://pith.science/paper/UDZC7X6T"},"agent_actions":{"view_html":"https://pith.science/pith/UDZC7X6TXBPNSSMP4EYJ453M4G","download_json":"https://pith.science/pith/UDZC7X6TXBPNSSMP4EYJ453M4G.json","view_paper":"https://pith.science/paper/UDZC7X6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.6348&json=true","fetch_graph":"https://pith.science/api/pith-number/UDZC7X6TXBPNSSMP4EYJ453M4G/graph.json","fetch_events":"https://pith.science/api/pith-number/UDZC7X6TXBPNSSMP4EYJ453M4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDZC7X6TXBPNSSMP4EYJ453M4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDZC7X6TXBPNSSMP4EYJ453M4G/action/storage_attestation","attest_author":"https://pith.science/pith/UDZC7X6TXBPNSSMP4EYJ453M4G/action/author_attestation","sign_citation":"https://pith.science/pith/UDZC7X6TXBPNSSMP4EYJ453M4G/action/citation_signature","submit_replication":"https://pith.science/pith/UDZC7X6TXBPNSSMP4EYJ453M4G/action/replication_record"}},"created_at":"2026-05-18T03:05:36.295054+00:00","updated_at":"2026-05-18T03:05:36.295054+00:00"}