{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Z54I7G67JCS3BYFOK3B34ZZMEU","short_pith_number":"pith:Z54I7G67","schema_version":"1.0","canonical_sha256":"cf788f9bdf48a5b0e0ae56c3be672c2533619af27c05eca4b3e5e0014a0e8600","source":{"kind":"arxiv","id":"2409.08784","version":2},"attestation_state":"computed","paper":{"title":"Double Index Calculus Algorithm: Faster Solving Discrete Logarithm Problem in Finite Prime Field","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Wen Huang","submitted_at":"2024-09-13T12:41:32Z","abstract_excerpt":"Solving the discrete logarithm problem in a finite prime field is an extremely important computing problem in modern cryptography. The hardness of solving the discrete logarithm problem in a finite prime field is the security foundation of numerous cryptography schemes. In this paper, we propose the double index calculus algorithm to solve the discrete logarithm problem in a finite prime field. Our algorithm is faster than the index calculus algorithm, which is the state-of-the-art algorithm for solving the discrete logarithm problem in a finite prime field. Empirical experiment results indica"},"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":"2409.08784","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2024-09-13T12:41:32Z","cross_cats_sorted":[],"title_canon_sha256":"08fd9cd5fd7f547d6e7a1c1763a47564130c598f386b10ee8e79b124c453e072","abstract_canon_sha256":"9708774858e29c90990785c86490136233b2c956ac196e09d73bb279af60fb57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:32.522865Z","signature_b64":"0ho7bFa8D2ltGpcXLXe88ENCLuJhPp1HhXYHI989RBL7aRWsHE+PGYNrwJJ/2/kB4EKqJaUo2BvR/qhiN7CCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf788f9bdf48a5b0e0ae56c3be672c2533619af27c05eca4b3e5e0014a0e8600","last_reissued_at":"2026-05-27T01:05:32.522254Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:32.522254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Double Index Calculus Algorithm: Faster Solving Discrete Logarithm Problem in Finite Prime Field","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Wen Huang","submitted_at":"2024-09-13T12:41:32Z","abstract_excerpt":"Solving the discrete logarithm problem in a finite prime field is an extremely important computing problem in modern cryptography. The hardness of solving the discrete logarithm problem in a finite prime field is the security foundation of numerous cryptography schemes. In this paper, we propose the double index calculus algorithm to solve the discrete logarithm problem in a finite prime field. Our algorithm is faster than the index calculus algorithm, which is the state-of-the-art algorithm for solving the discrete logarithm problem in a finite prime field. Empirical experiment results indica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.08784","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.08784/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":"2409.08784","created_at":"2026-05-27T01:05:32.522310+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.08784v2","created_at":"2026-05-27T01:05:32.522310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.08784","created_at":"2026-05-27T01:05:32.522310+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z54I7G67JCS3","created_at":"2026-05-27T01:05:32.522310+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z54I7G67JCS3BYFO","created_at":"2026-05-27T01:05:32.522310+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z54I7G67","created_at":"2026-05-27T01:05:32.522310+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/Z54I7G67JCS3BYFOK3B34ZZMEU","json":"https://pith.science/pith/Z54I7G67JCS3BYFOK3B34ZZMEU.json","graph_json":"https://pith.science/api/pith-number/Z54I7G67JCS3BYFOK3B34ZZMEU/graph.json","events_json":"https://pith.science/api/pith-number/Z54I7G67JCS3BYFOK3B34ZZMEU/events.json","paper":"https://pith.science/paper/Z54I7G67"},"agent_actions":{"view_html":"https://pith.science/pith/Z54I7G67JCS3BYFOK3B34ZZMEU","download_json":"https://pith.science/pith/Z54I7G67JCS3BYFOK3B34ZZMEU.json","view_paper":"https://pith.science/paper/Z54I7G67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.08784&json=true","fetch_graph":"https://pith.science/api/pith-number/Z54I7G67JCS3BYFOK3B34ZZMEU/graph.json","fetch_events":"https://pith.science/api/pith-number/Z54I7G67JCS3BYFOK3B34ZZMEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z54I7G67JCS3BYFOK3B34ZZMEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z54I7G67JCS3BYFOK3B34ZZMEU/action/storage_attestation","attest_author":"https://pith.science/pith/Z54I7G67JCS3BYFOK3B34ZZMEU/action/author_attestation","sign_citation":"https://pith.science/pith/Z54I7G67JCS3BYFOK3B34ZZMEU/action/citation_signature","submit_replication":"https://pith.science/pith/Z54I7G67JCS3BYFOK3B34ZZMEU/action/replication_record"}},"created_at":"2026-05-27T01:05:32.522310+00:00","updated_at":"2026-05-27T01:05:32.522310+00:00"}