{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RHXTONRIDXY6XDGUHGJPOE3QAI","short_pith_number":"pith:RHXTONRI","schema_version":"1.0","canonical_sha256":"89ef3736281df1eb8cd43992f71370021bbecb42f5d894ec9ddcb6b111f8855d","source":{"kind":"arxiv","id":"2109.07050","version":1},"attestation_state":"computed","paper":{"title":"The Elliptic Net Algorithm Revisited","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AG","math.NT"],"primary_cat":"cs.CR","authors_text":"Chang-An Zhao, Shiping Cai, Zheng-an Yao, Zhi Hu","submitted_at":"2021-09-15T02:07:01Z","abstract_excerpt":"Pairings have been widely used since their introduction to cryptography. They can be applied to identity-based encryption, tripartite Diffie-Hellman key agreement, blockchain and other cryptographic schemes. The Acceleration of pairing computations is crucial for these cryptographic schemes or protocols. In this paper, we will focus on the Elliptic Net algorithm which can compute pairings in polynomial time, but it requires more storage than Miller's algorithm. We use several methods to speed up the Elliptic Net algorithm. Firstly, we eliminate the inverse operation in the improved Elliptic Ne"},"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":"2109.07050","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-09-15T02:07:01Z","cross_cats_sorted":["math.AG","math.NT"],"title_canon_sha256":"fc6a33b133a55861b3e686b3eca1cb8266aec87b1ed8c5b4f50364b5a5cc99b6","abstract_canon_sha256":"3aa74162faa9c5294dcd617d7b84542d3f44e0f5e9dddb264a7fc2c7d40c3bbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:14:38.364735Z","signature_b64":"M1xoQ4mKTbM/mYvpsQTWOLqDvkl3ZHfnI8gYTUkky8/I9RGuI1FC+AOIkOJ+bvW5CagkwQN3ZX4xwcj8nnkDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89ef3736281df1eb8cd43992f71370021bbecb42f5d894ec9ddcb6b111f8855d","last_reissued_at":"2026-07-05T03:14:38.364378Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:14:38.364378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Elliptic Net Algorithm Revisited","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AG","math.NT"],"primary_cat":"cs.CR","authors_text":"Chang-An Zhao, Shiping Cai, Zheng-an Yao, Zhi Hu","submitted_at":"2021-09-15T02:07:01Z","abstract_excerpt":"Pairings have been widely used since their introduction to cryptography. They can be applied to identity-based encryption, tripartite Diffie-Hellman key agreement, blockchain and other cryptographic schemes. The Acceleration of pairing computations is crucial for these cryptographic schemes or protocols. In this paper, we will focus on the Elliptic Net algorithm which can compute pairings in polynomial time, but it requires more storage than Miller's algorithm. We use several methods to speed up the Elliptic Net algorithm. Firstly, we eliminate the inverse operation in the improved Elliptic Ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.07050","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.07050/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.07050","created_at":"2026-07-05T03:14:38.364435+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.07050v1","created_at":"2026-07-05T03:14:38.364435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.07050","created_at":"2026-07-05T03:14:38.364435+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHXTONRIDXY6","created_at":"2026-07-05T03:14:38.364435+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHXTONRIDXY6XDGU","created_at":"2026-07-05T03:14:38.364435+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHXTONRI","created_at":"2026-07-05T03:14:38.364435+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/RHXTONRIDXY6XDGUHGJPOE3QAI","json":"https://pith.science/pith/RHXTONRIDXY6XDGUHGJPOE3QAI.json","graph_json":"https://pith.science/api/pith-number/RHXTONRIDXY6XDGUHGJPOE3QAI/graph.json","events_json":"https://pith.science/api/pith-number/RHXTONRIDXY6XDGUHGJPOE3QAI/events.json","paper":"https://pith.science/paper/RHXTONRI"},"agent_actions":{"view_html":"https://pith.science/pith/RHXTONRIDXY6XDGUHGJPOE3QAI","download_json":"https://pith.science/pith/RHXTONRIDXY6XDGUHGJPOE3QAI.json","view_paper":"https://pith.science/paper/RHXTONRI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.07050&json=true","fetch_graph":"https://pith.science/api/pith-number/RHXTONRIDXY6XDGUHGJPOE3QAI/graph.json","fetch_events":"https://pith.science/api/pith-number/RHXTONRIDXY6XDGUHGJPOE3QAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHXTONRIDXY6XDGUHGJPOE3QAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHXTONRIDXY6XDGUHGJPOE3QAI/action/storage_attestation","attest_author":"https://pith.science/pith/RHXTONRIDXY6XDGUHGJPOE3QAI/action/author_attestation","sign_citation":"https://pith.science/pith/RHXTONRIDXY6XDGUHGJPOE3QAI/action/citation_signature","submit_replication":"https://pith.science/pith/RHXTONRIDXY6XDGUHGJPOE3QAI/action/replication_record"}},"created_at":"2026-07-05T03:14:38.364435+00:00","updated_at":"2026-07-05T03:14:38.364435+00:00"}