{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:WP3KSOHETU3QUGLILXSIOSCLCS","short_pith_number":"pith:WP3KSOHE","schema_version":"1.0","canonical_sha256":"b3f6a938e49d370a19685de487484b149c9f30957af7f42f2eb49ea50b886d9c","source":{"kind":"arxiv","id":"math/0209267","version":5},"attestation_state":"computed","paper":{"title":"Length-based conjugacy search in the Braid group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.AG"],"primary_cat":"math.GR","authors_text":"B. Tsaban, D. Garber, M. Teicher, S. Kaplan, U. Vishne","submitted_at":"2002-09-20T14:19:51Z","abstract_excerpt":"Several key agreement protocols are based on the following \"Generalized Conjugacy Search Problem\": Find, given elements b_1,...,b_n and xb_1x^{-1},...,xb_nx^{-1} in a nonabelian group G, the conjugator x. In the case of subgroups of the braid group B_N, Hughes and Tannenbaum suggested a length-based approach to finding x. Since the introduction of this approach, its effectiveness and successfulness were debated.\n  We introduce several effective realizations of this approach. In particular, a new length function is defined on B_N which possesses significantly better properties than the natural "},"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":"math/0209267","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2002-09-20T14:19:51Z","cross_cats_sorted":["cs.CR","math.AG"],"title_canon_sha256":"0e072b449b08ca65dd6ce9a7f3c965853f4f103617c15afb864de643d207f4e7","abstract_canon_sha256":"d13e9027be619940299147b8dc13df4ffc47b4ad38d20102dd02b9472fd3b745"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:23.211851Z","signature_b64":"o/rA/4L+8ALeBi7ODLHg0m0yoy4stTOUWZyGXiGyurbiFwBbBZM7egkscOL9UEEzbsBbHM7CIu4BRtlOO7FsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3f6a938e49d370a19685de487484b149c9f30957af7f42f2eb49ea50b886d9c","last_reissued_at":"2026-05-18T04:37:23.211295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:23.211295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Length-based conjugacy search in the Braid group","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.AG"],"primary_cat":"math.GR","authors_text":"B. Tsaban, D. Garber, M. Teicher, S. Kaplan, U. Vishne","submitted_at":"2002-09-20T14:19:51Z","abstract_excerpt":"Several key agreement protocols are based on the following \"Generalized Conjugacy Search Problem\": Find, given elements b_1,...,b_n and xb_1x^{-1},...,xb_nx^{-1} in a nonabelian group G, the conjugator x. In the case of subgroups of the braid group B_N, Hughes and Tannenbaum suggested a length-based approach to finding x. Since the introduction of this approach, its effectiveness and successfulness were debated.\n  We introduce several effective realizations of this approach. In particular, a new length function is defined on B_N which possesses significantly better properties than the natural "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0209267","kind":"arxiv","version":5},"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":"math/0209267","created_at":"2026-05-18T04:37:23.211392+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0209267v5","created_at":"2026-05-18T04:37:23.211392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0209267","created_at":"2026-05-18T04:37:23.211392+00:00"},{"alias_kind":"pith_short_12","alias_value":"WP3KSOHETU3Q","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_16","alias_value":"WP3KSOHETU3QUGLI","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_8","alias_value":"WP3KSOHE","created_at":"2026-05-18T12:25:51.375804+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/WP3KSOHETU3QUGLILXSIOSCLCS","json":"https://pith.science/pith/WP3KSOHETU3QUGLILXSIOSCLCS.json","graph_json":"https://pith.science/api/pith-number/WP3KSOHETU3QUGLILXSIOSCLCS/graph.json","events_json":"https://pith.science/api/pith-number/WP3KSOHETU3QUGLILXSIOSCLCS/events.json","paper":"https://pith.science/paper/WP3KSOHE"},"agent_actions":{"view_html":"https://pith.science/pith/WP3KSOHETU3QUGLILXSIOSCLCS","download_json":"https://pith.science/pith/WP3KSOHETU3QUGLILXSIOSCLCS.json","view_paper":"https://pith.science/paper/WP3KSOHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0209267&json=true","fetch_graph":"https://pith.science/api/pith-number/WP3KSOHETU3QUGLILXSIOSCLCS/graph.json","fetch_events":"https://pith.science/api/pith-number/WP3KSOHETU3QUGLILXSIOSCLCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WP3KSOHETU3QUGLILXSIOSCLCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WP3KSOHETU3QUGLILXSIOSCLCS/action/storage_attestation","attest_author":"https://pith.science/pith/WP3KSOHETU3QUGLILXSIOSCLCS/action/author_attestation","sign_citation":"https://pith.science/pith/WP3KSOHETU3QUGLILXSIOSCLCS/action/citation_signature","submit_replication":"https://pith.science/pith/WP3KSOHETU3QUGLILXSIOSCLCS/action/replication_record"}},"created_at":"2026-05-18T04:37:23.211392+00:00","updated_at":"2026-05-18T04:37:23.211392+00:00"}