{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3YLTF5QL3NQ2WWDLA7VD35AYEC","short_pith_number":"pith:3YLTF5QL","canonical_record":{"source":{"id":"1206.2610","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-06-12T18:19:28Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"cb80c6760aab8b61fd5e5fa73e64c8446906cebdf96f90cbfc8290dec835fd7d","abstract_canon_sha256":"ee08c3231ed68e8173ba834111180a2a4d2887c98a4aa3f9bb1b58bd22e5b3ea"},"schema_version":"1.0"},"canonical_sha256":"de1732f60bdb61ab586b07ea3df41820ae6701dc549e08bddc8cdd6e9a23dcf9","source":{"kind":"arxiv","id":"1206.2610","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2610","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2610v2","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2610","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"3YLTF5QL3NQ2","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3YLTF5QL3NQ2WWDL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3YLTF5QL","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3YLTF5QL3NQ2WWDLA7VD35AYEC","target":"record","payload":{"canonical_record":{"source":{"id":"1206.2610","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-06-12T18:19:28Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"cb80c6760aab8b61fd5e5fa73e64c8446906cebdf96f90cbfc8290dec835fd7d","abstract_canon_sha256":"ee08c3231ed68e8173ba834111180a2a4d2887c98a4aa3f9bb1b58bd22e5b3ea"},"schema_version":"1.0"},"canonical_sha256":"de1732f60bdb61ab586b07ea3df41820ae6701dc549e08bddc8cdd6e9a23dcf9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:10.509121Z","signature_b64":"ffoWo5awdZ48FWlvWE7c7VrNSPlAZxfd7rPVUEY9ukTQi6EHGFhOov/c/b920UYYt6ot1yxHGFCc1Ow/nHjsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de1732f60bdb61ab586b07ea3df41820ae6701dc549e08bddc8cdd6e9a23dcf9","last_reissued_at":"2026-05-18T03:45:10.508573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:10.508573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.2610","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-18T03:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwJm7Psc8b7WNLWI4NHhvNZr5cCoGsbc2v9Z+GPzQWyW50KwyNEsfiREQH12AGAS9FlaHNOD/hK+4QDfBon0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:35:27.193507Z"},"content_sha256":"687c8ab381eae9c51e2c7222a30c723148c5e1009cf1720d1cd894ac6d316a81","schema_version":"1.0","event_id":"sha256:687c8ab381eae9c51e2c7222a30c723148c5e1009cf1720d1cd894ac6d316a81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3YLTF5QL3NQ2WWDLA7VD35AYEC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Signature Scheme based on Factoring and Discrete Logarithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Abdoul Aziz Ciss, Ahmed Youssef Ould Cheikh","submitted_at":"2012-06-12T18:19:28Z","abstract_excerpt":"This paper proposes a new signature scheme based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli, IFP) and the discrete logarithm problem(DLP). By combining these two cryptographic assumptions, we introduce an efficient and strongly secure signature scheme. We show that if an adversary can break the new scheme with an algorithm $\\mathcal{A},$ then $\\mathcal{A}$ can be used to sove both the DLP and the IFP. The key generation is a simple operation based on the discrete logarithm modulo a composite moduli. The sign"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2610","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":""},"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-18T03:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/dg6i3Wdhd6F0dBoTezHHCkiylcHilPLzssRvCxtfHonlZgPC6JsOs9GN4lWTtvf38fyQVf9SddCN6bfsQUpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:35:27.193849Z"},"content_sha256":"bdab06f39b5eb435eda2267944abfd01c9abee93702d934019c95817c05215ad","schema_version":"1.0","event_id":"sha256:bdab06f39b5eb435eda2267944abfd01c9abee93702d934019c95817c05215ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YLTF5QL3NQ2WWDLA7VD35AYEC/bundle.json","state_url":"https://pith.science/pith/3YLTF5QL3NQ2WWDLA7VD35AYEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YLTF5QL3NQ2WWDLA7VD35AYEC/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-11T13:35:27Z","links":{"resolver":"https://pith.science/pith/3YLTF5QL3NQ2WWDLA7VD35AYEC","bundle":"https://pith.science/pith/3YLTF5QL3NQ2WWDLA7VD35AYEC/bundle.json","state":"https://pith.science/pith/3YLTF5QL3NQ2WWDLA7VD35AYEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YLTF5QL3NQ2WWDLA7VD35AYEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3YLTF5QL3NQ2WWDLA7VD35AYEC","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":"ee08c3231ed68e8173ba834111180a2a4d2887c98a4aa3f9bb1b58bd22e5b3ea","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-06-12T18:19:28Z","title_canon_sha256":"cb80c6760aab8b61fd5e5fa73e64c8446906cebdf96f90cbfc8290dec835fd7d"},"schema_version":"1.0","source":{"id":"1206.2610","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2610","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2610v2","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2610","created_at":"2026-05-18T03:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"3YLTF5QL3NQ2","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3YLTF5QL3NQ2WWDL","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3YLTF5QL","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:bdab06f39b5eb435eda2267944abfd01c9abee93702d934019c95817c05215ad","target":"graph","created_at":"2026-05-18T03:45:10Z","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"},"paper":{"abstract_excerpt":"This paper proposes a new signature scheme based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli, IFP) and the discrete logarithm problem(DLP). By combining these two cryptographic assumptions, we introduce an efficient and strongly secure signature scheme. We show that if an adversary can break the new scheme with an algorithm $\\mathcal{A},$ then $\\mathcal{A}$ can be used to sove both the DLP and the IFP. The key generation is a simple operation based on the discrete logarithm modulo a composite moduli. The sign","authors_text":"Abdoul Aziz Ciss, Ahmed Youssef Ould Cheikh","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-06-12T18:19:28Z","title":"An Efficient Signature Scheme based on Factoring and Discrete Logarithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2610","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:687c8ab381eae9c51e2c7222a30c723148c5e1009cf1720d1cd894ac6d316a81","target":"record","created_at":"2026-05-18T03:45:10Z","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":"ee08c3231ed68e8173ba834111180a2a4d2887c98a4aa3f9bb1b58bd22e5b3ea","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-06-12T18:19:28Z","title_canon_sha256":"cb80c6760aab8b61fd5e5fa73e64c8446906cebdf96f90cbfc8290dec835fd7d"},"schema_version":"1.0","source":{"id":"1206.2610","kind":"arxiv","version":2}},"canonical_sha256":"de1732f60bdb61ab586b07ea3df41820ae6701dc549e08bddc8cdd6e9a23dcf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de1732f60bdb61ab586b07ea3df41820ae6701dc549e08bddc8cdd6e9a23dcf9","first_computed_at":"2026-05-18T03:45:10.508573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:10.508573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ffoWo5awdZ48FWlvWE7c7VrNSPlAZxfd7rPVUEY9ukTQi6EHGFhOov/c/b920UYYt6ot1yxHGFCc1Ow/nHjsAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:10.509121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.2610","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:687c8ab381eae9c51e2c7222a30c723148c5e1009cf1720d1cd894ac6d316a81","sha256:bdab06f39b5eb435eda2267944abfd01c9abee93702d934019c95817c05215ad"],"state_sha256":"166b234568841c82203b8648b2b31e5e041877c8a40013fe5124afd5c52c0671"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6POSD3q18elSvlvfBi67MGa/TbP7u5+HlWNjeml+lKBT7mD103eMWzcbBPdvLe8QcAStYUQe9HSCC53tDhtJBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:35:27.195819Z","bundle_sha256":"549e08f512a82b9112381195c129cab00df03d784bce8e36d480fdca835242c9"}}