{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:XE6TUCBSASDDDXSL3WFNACMPJ7","short_pith_number":"pith:XE6TUCBS","canonical_record":{"source":{"id":"math/0411644","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.GR","submitted_at":"2004-11-29T21:46:13Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"3eb17ac0d5197be691df03f8036725a0fb011f39999c8cce44654c15991fa55c","abstract_canon_sha256":"7bf53e0812810c071e219a4bf770fa5e93186318a80d2c87a7773700e8800407"},"schema_version":"1.0"},"canonical_sha256":"b93d3a0832048631de4bdd8ad0098f4fc22a535c3f2bd2e9acee15bb91c931a6","source":{"kind":"arxiv","id":"math/0411644","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0411644","created_at":"2026-05-18T01:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"math/0411644v1","created_at":"2026-05-18T01:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0411644","created_at":"2026-05-18T01:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"XE6TUCBSASDD","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"XE6TUCBSASDDDXSL","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"XE6TUCBS","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:XE6TUCBSASDDDXSL3WFNACMPJ7","target":"record","payload":{"canonical_record":{"source":{"id":"math/0411644","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.GR","submitted_at":"2004-11-29T21:46:13Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"3eb17ac0d5197be691df03f8036725a0fb011f39999c8cce44654c15991fa55c","abstract_canon_sha256":"7bf53e0812810c071e219a4bf770fa5e93186318a80d2c87a7773700e8800407"},"schema_version":"1.0"},"canonical_sha256":"b93d3a0832048631de4bdd8ad0098f4fc22a535c3f2bd2e9acee15bb91c931a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:25.583065Z","signature_b64":"r6COvTiJDlDxkDV0T0YMD+tHGnYWcK1S/7WZ32fpudiPtAWAM/5bMXxMge3teniuWCq9GLk0OUP11ebx18hPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b93d3a0832048631de4bdd8ad0098f4fc22a535c3f2bd2e9acee15bb91c931a6","last_reissued_at":"2026-05-18T01:05:25.582467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:25.582467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0411644","source_version":1,"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-18T01:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hEnuf5nM9FYBoNdcD8n5+LTFOKrT+ZvNGRlP0t/85YSRBQuUIVd6/xfaQ73KdwVE2H3reMTdulwiY6/wJZK9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:24:45.397365Z"},"content_sha256":"4acd94242b6c7df13b358ae3805ae20044670bb40f6112eccef669472dec1ce7","schema_version":"1.0","event_id":"sha256:4acd94242b6c7df13b358ae3805ae20044670bb40f6112eccef669472dec1ce7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:XE6TUCBSASDDDXSL3WFNACMPJ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The conjugacy search problem in public key cryptography: unnecessary and insufficient","license":"","headline":"","cross_cats":["cs.CR"],"primary_cat":"math.GR","authors_text":"Alexander Ushakov, Vladimir Shpilrain","submitted_at":"2004-11-29T21:46:13Z","abstract_excerpt":"The conjugacy search problem in a group G is the problem of recovering an x in G from given g in G and h=x^{-1}gx. This problem is in the core of several recently suggested public key exchange protocols, most notably the one due to Anshel, Anshel, and Goldfeld, and the one due to Ko, Lee at al.\n In this note, we make two observations that seem to have eluded most people's attention. The first observation is that solving the conjugacy search problem is not necessary for an adversary to get the common secret key in the Ko-Lee protocol. It is sufficient to solve an apparently easier problem of fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0411644","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":""},"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-18T01:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XSdIc5B+I/8jOS1WjjNw7/Tn/laqJNKfW+EzzR1DbfMJHVjkFK1LcG208L0TO1gQZhsnTyShjkui9I9lD/cpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:24:45.397747Z"},"content_sha256":"af88525d5e777afcdf6ab8f224e8da28766e1551936258637616eb6a617f3d08","schema_version":"1.0","event_id":"sha256:af88525d5e777afcdf6ab8f224e8da28766e1551936258637616eb6a617f3d08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XE6TUCBSASDDDXSL3WFNACMPJ7/bundle.json","state_url":"https://pith.science/pith/XE6TUCBSASDDDXSL3WFNACMPJ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XE6TUCBSASDDDXSL3WFNACMPJ7/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-01T13:24:45Z","links":{"resolver":"https://pith.science/pith/XE6TUCBSASDDDXSL3WFNACMPJ7","bundle":"https://pith.science/pith/XE6TUCBSASDDDXSL3WFNACMPJ7/bundle.json","state":"https://pith.science/pith/XE6TUCBSASDDDXSL3WFNACMPJ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XE6TUCBSASDDDXSL3WFNACMPJ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:XE6TUCBSASDDDXSL3WFNACMPJ7","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":"7bf53e0812810c071e219a4bf770fa5e93186318a80d2c87a7773700e8800407","cross_cats_sorted":["cs.CR"],"license":"","primary_cat":"math.GR","submitted_at":"2004-11-29T21:46:13Z","title_canon_sha256":"3eb17ac0d5197be691df03f8036725a0fb011f39999c8cce44654c15991fa55c"},"schema_version":"1.0","source":{"id":"math/0411644","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0411644","created_at":"2026-05-18T01:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"math/0411644v1","created_at":"2026-05-18T01:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0411644","created_at":"2026-05-18T01:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"XE6TUCBSASDD","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"XE6TUCBSASDDDXSL","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"XE6TUCBS","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:af88525d5e777afcdf6ab8f224e8da28766e1551936258637616eb6a617f3d08","target":"graph","created_at":"2026-05-18T01:05:25Z","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":"The conjugacy search problem in a group G is the problem of recovering an x in G from given g in G and h=x^{-1}gx. This problem is in the core of several recently suggested public key exchange protocols, most notably the one due to Anshel, Anshel, and Goldfeld, and the one due to Ko, Lee at al.\n In this note, we make two observations that seem to have eluded most people's attention. The first observation is that solving the conjugacy search problem is not necessary for an adversary to get the common secret key in the Ko-Lee protocol. It is sufficient to solve an apparently easier problem of fi","authors_text":"Alexander Ushakov, Vladimir Shpilrain","cross_cats":["cs.CR"],"headline":"","license":"","primary_cat":"math.GR","submitted_at":"2004-11-29T21:46:13Z","title":"The conjugacy search problem in public key cryptography: unnecessary and insufficient"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0411644","kind":"arxiv","version":1},"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:4acd94242b6c7df13b358ae3805ae20044670bb40f6112eccef669472dec1ce7","target":"record","created_at":"2026-05-18T01:05:25Z","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":"7bf53e0812810c071e219a4bf770fa5e93186318a80d2c87a7773700e8800407","cross_cats_sorted":["cs.CR"],"license":"","primary_cat":"math.GR","submitted_at":"2004-11-29T21:46:13Z","title_canon_sha256":"3eb17ac0d5197be691df03f8036725a0fb011f39999c8cce44654c15991fa55c"},"schema_version":"1.0","source":{"id":"math/0411644","kind":"arxiv","version":1}},"canonical_sha256":"b93d3a0832048631de4bdd8ad0098f4fc22a535c3f2bd2e9acee15bb91c931a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b93d3a0832048631de4bdd8ad0098f4fc22a535c3f2bd2e9acee15bb91c931a6","first_computed_at":"2026-05-18T01:05:25.582467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:25.582467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r6COvTiJDlDxkDV0T0YMD+tHGnYWcK1S/7WZ32fpudiPtAWAM/5bMXxMge3teniuWCq9GLk0OUP11ebx18hPDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:25.583065Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0411644","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4acd94242b6c7df13b358ae3805ae20044670bb40f6112eccef669472dec1ce7","sha256:af88525d5e777afcdf6ab8f224e8da28766e1551936258637616eb6a617f3d08"],"state_sha256":"176eb3dc2387d12ac77828aba48ee6965988d9ad80d8b0e7dbdf702f80e9f7bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wpro3kYx9HO203WA51gG2c3nIkZxJce0xSABSGCtrJ/7bAAaZoF1YJ8TpwKS2r5In6kBJlYwHooiywvFnLZoDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:24:45.399756Z","bundle_sha256":"609594ee92ddcb7d7c7336e5bfa16351ba3183051eb76c7dc5d5af419d628ced"}}