{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PLK6SGSEDOLYBDJRRNDBMF6ZU5","short_pith_number":"pith:PLK6SGSE","schema_version":"1.0","canonical_sha256":"7ad5e91a441b97808d318b461617d9a754bdf9628843a9718b62f7b913cc6dd0","source":{"kind":"arxiv","id":"1703.07544","version":3},"attestation_state":"computed","paper":{"title":"A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.AG","math.IT"],"primary_cat":"cs.CR","authors_text":"Ayan Mahalanobis, Vivek Mallick","submitted_at":"2017-03-22T07:03:29Z","abstract_excerpt":"In this paper, we describe a new Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The algorithm depends on a property of the group of rational points of an elliptic curve and is thus not a generic algorithm. The algorithm that we describe has some similarities with the most powerful index-calculus algorithm for the discrete logarithm problem over a finite field."},"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":"1703.07544","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-03-22T07:03:29Z","cross_cats_sorted":["cs.IT","math.AG","math.IT"],"title_canon_sha256":"af2ba7639cb99fb0abe77690c3f75a11fbc0ca56d6c23014515cd9df3cd55490","abstract_canon_sha256":"934a54cd3f2f770c27d4bbc95d4e7d45b82c3bf014eb0d94629a1f1ed6eb6c1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:31.393052Z","signature_b64":"ljAwI8ynzBA94Np2vkAzvxoZv4yRxh7htYQH1YbtMe9EqAxTcmrhW20fVUtPzC4TrVdvePRH9tbW4evesR/xBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ad5e91a441b97808d318b461617d9a754bdf9628843a9718b62f7b913cc6dd0","last_reissued_at":"2026-05-18T00:24:31.392556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:31.392556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.AG","math.IT"],"primary_cat":"cs.CR","authors_text":"Ayan Mahalanobis, Vivek Mallick","submitted_at":"2017-03-22T07:03:29Z","abstract_excerpt":"In this paper, we describe a new Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The algorithm depends on a property of the group of rational points of an elliptic curve and is thus not a generic algorithm. The algorithm that we describe has some similarities with the most powerful index-calculus algorithm for the discrete logarithm problem over a finite field."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07544","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":"1703.07544","created_at":"2026-05-18T00:24:31.392639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07544v3","created_at":"2026-05-18T00:24:31.392639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07544","created_at":"2026-05-18T00:24:31.392639+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLK6SGSEDOLY","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLK6SGSEDOLYBDJR","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLK6SGSE","created_at":"2026-05-18T12:31:37.085036+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/PLK6SGSEDOLYBDJRRNDBMF6ZU5","json":"https://pith.science/pith/PLK6SGSEDOLYBDJRRNDBMF6ZU5.json","graph_json":"https://pith.science/api/pith-number/PLK6SGSEDOLYBDJRRNDBMF6ZU5/graph.json","events_json":"https://pith.science/api/pith-number/PLK6SGSEDOLYBDJRRNDBMF6ZU5/events.json","paper":"https://pith.science/paper/PLK6SGSE"},"agent_actions":{"view_html":"https://pith.science/pith/PLK6SGSEDOLYBDJRRNDBMF6ZU5","download_json":"https://pith.science/pith/PLK6SGSEDOLYBDJRRNDBMF6ZU5.json","view_paper":"https://pith.science/paper/PLK6SGSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07544&json=true","fetch_graph":"https://pith.science/api/pith-number/PLK6SGSEDOLYBDJRRNDBMF6ZU5/graph.json","fetch_events":"https://pith.science/api/pith-number/PLK6SGSEDOLYBDJRRNDBMF6ZU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLK6SGSEDOLYBDJRRNDBMF6ZU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLK6SGSEDOLYBDJRRNDBMF6ZU5/action/storage_attestation","attest_author":"https://pith.science/pith/PLK6SGSEDOLYBDJRRNDBMF6ZU5/action/author_attestation","sign_citation":"https://pith.science/pith/PLK6SGSEDOLYBDJRRNDBMF6ZU5/action/citation_signature","submit_replication":"https://pith.science/pith/PLK6SGSEDOLYBDJRRNDBMF6ZU5/action/replication_record"}},"created_at":"2026-05-18T00:24:31.392639+00:00","updated_at":"2026-05-18T00:24:31.392639+00:00"}