{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:Z54I7G67JCS3BYFOK3B34ZZMEU","short_pith_number":"pith:Z54I7G67","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"},"canonical_sha256":"cf788f9bdf48a5b0e0ae56c3be672c2533619af27c05eca4b3e5e0014a0e8600","source":{"kind":"arxiv","id":"2409.08784","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.08784","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2409.08784v2","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.08784","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"Z54I7G67JCS3","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"Z54I7G67JCS3BYFO","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"Z54I7G67","created_at":"2026-05-27T01:05:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:Z54I7G67JCS3BYFOK3B34ZZMEU","target":"record","payload":{"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"},"canonical_sha256":"cf788f9bdf48a5b0e0ae56c3be672c2533619af27c05eca4b3e5e0014a0e8600","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"},"source_kind":"arxiv","source_id":"2409.08784","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:05:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"De4MU/riEax4Z8UXyd/Vp7hLGoFVfwjmb/I7JHtgrYdevwk2uqmUDbADjtw4/SXVipp1bIODIUkONT5wFiVwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:16:23.205302Z"},"content_sha256":"9cf8c44127c174bbfc3aac514a854c8989a98cb0179c7f9da958ef79f96230cd","schema_version":"1.0","event_id":"sha256:9cf8c44127c174bbfc3aac514a854c8989a98cb0179c7f9da958ef79f96230cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:Z54I7G67JCS3BYFOK3B34ZZMEU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:05:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gMdye/6k9Fj+B/qwbbsYLlLCsQMuswnGHp5e5JMhFL5f0uPZRLa/olcA9+hxKDxa7EYElRaJTsNM4YoVA4JSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:16:23.206078Z"},"content_sha256":"9540b574496190d9fd7b0da55db76195785f3f7dbf7244661b690bad03a2f5f1","schema_version":"1.0","event_id":"sha256:9540b574496190d9fd7b0da55db76195785f3f7dbf7244661b690bad03a2f5f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z54I7G67JCS3BYFOK3B34ZZMEU/bundle.json","state_url":"https://pith.science/pith/Z54I7G67JCS3BYFOK3B34ZZMEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z54I7G67JCS3BYFOK3B34ZZMEU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T05:16:23Z","links":{"resolver":"https://pith.science/pith/Z54I7G67JCS3BYFOK3B34ZZMEU","bundle":"https://pith.science/pith/Z54I7G67JCS3BYFOK3B34ZZMEU/bundle.json","state":"https://pith.science/pith/Z54I7G67JCS3BYFOK3B34ZZMEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z54I7G67JCS3BYFOK3B34ZZMEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Z54I7G67JCS3BYFOK3B34ZZMEU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9708774858e29c90990785c86490136233b2c956ac196e09d73bb279af60fb57","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2024-09-13T12:41:32Z","title_canon_sha256":"08fd9cd5fd7f547d6e7a1c1763a47564130c598f386b10ee8e79b124c453e072"},"schema_version":"1.0","source":{"id":"2409.08784","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.08784","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2409.08784v2","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.08784","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"Z54I7G67JCS3","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"Z54I7G67JCS3BYFO","created_at":"2026-05-27T01:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"Z54I7G67","created_at":"2026-05-27T01:05:32Z"}],"graph_snapshots":[{"event_id":"sha256:9540b574496190d9fd7b0da55db76195785f3f7dbf7244661b690bad03a2f5f1","target":"graph","created_at":"2026-05-27T01:05:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.08784/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Wen Huang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2024-09-13T12:41:32Z","title":"Double Index Calculus Algorithm: Faster Solving Discrete Logarithm Problem in Finite Prime Field"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.08784","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9cf8c44127c174bbfc3aac514a854c8989a98cb0179c7f9da958ef79f96230cd","target":"record","created_at":"2026-05-27T01:05:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9708774858e29c90990785c86490136233b2c956ac196e09d73bb279af60fb57","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2024-09-13T12:41:32Z","title_canon_sha256":"08fd9cd5fd7f547d6e7a1c1763a47564130c598f386b10ee8e79b124c453e072"},"schema_version":"1.0","source":{"id":"2409.08784","kind":"arxiv","version":2}},"canonical_sha256":"cf788f9bdf48a5b0e0ae56c3be672c2533619af27c05eca4b3e5e0014a0e8600","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf788f9bdf48a5b0e0ae56c3be672c2533619af27c05eca4b3e5e0014a0e8600","first_computed_at":"2026-05-27T01:05:32.522254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:05:32.522254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ho7bFa8D2ltGpcXLXe88ENCLuJhPp1HhXYHI989RBL7aRWsHE+PGYNrwJJ/2/kB4EKqJaUo2BvR/qhiN7CCDQ==","signature_status":"signed_v1","signed_at":"2026-05-27T01:05:32.522865Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.08784","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cf8c44127c174bbfc3aac514a854c8989a98cb0179c7f9da958ef79f96230cd","sha256:9540b574496190d9fd7b0da55db76195785f3f7dbf7244661b690bad03a2f5f1"],"state_sha256":"f76454d6dd1d9a1da547b08ce48593c6192d2438afc117c32bfaa3c4615aecee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wjx/AcoY8nAjjg1mKS3wQriiWGxuC0efcWr6fAA2O3O4GD62pjSinP+eDA4QZsvRk7mYvTo8gvkNd6swiv9+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:16:23.210124Z","bundle_sha256":"fce40cc92c480579b35684e61a2bce1417369dd7ad55c41450ba3399d898db30"}}