{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:2TBWZCZHGODEGTBYKYS3F2I5B4","short_pith_number":"pith:2TBWZCZH","schema_version":"1.0","canonical_sha256":"d4c36c8b273386434c385625b2e91d0f02d0b486c2e55cb336aaa2b16396bae4","source":{"kind":"arxiv","id":"0705.2862","version":2},"attestation_state":"computed","paper":{"title":"Cryptanalysis of group-based key agreement protocols using subgroup distance functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Adi Shamir, Boaz Tsaban, Dima Ruinskiy","submitted_at":"2007-05-20T12:20:56Z","abstract_excerpt":"We introduce a new approach for cryptanalysis of key agreement protocols based on noncommutative groups. This approach uses functions that estimate the distance of a group element to a given subgroup. We test it against the Shpilrain-Ushakov protocol, which is based on Thompson's group F."},"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":"0705.2862","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2007-05-20T12:20:56Z","cross_cats_sorted":[],"title_canon_sha256":"035af5c9f984ee443f57c5280d7258765b139edbc8bc60b16e01d32d1b6cb434","abstract_canon_sha256":"6ebd2247351557f42863a08f98432483502097a82c2447eb666aec3e29dd7b3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:11.684103Z","signature_b64":"Ks46wH1km41e1CD0J574eAoos8r1CXlAsi7JWdMbD6lv89TZVRTkoauX8FL9qwpZi0+ypJ74ZG+5lU9DfxlrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4c36c8b273386434c385625b2e91d0f02d0b486c2e55cb336aaa2b16396bae4","last_reissued_at":"2026-05-18T04:37:11.683321Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:11.683321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cryptanalysis of group-based key agreement protocols using subgroup distance functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Adi Shamir, Boaz Tsaban, Dima Ruinskiy","submitted_at":"2007-05-20T12:20:56Z","abstract_excerpt":"We introduce a new approach for cryptanalysis of key agreement protocols based on noncommutative groups. This approach uses functions that estimate the distance of a group element to a given subgroup. We test it against the Shpilrain-Ushakov protocol, which is based on Thompson's group F."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.2862","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0705.2862","created_at":"2026-05-18T04:37:11.683401+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.2862v2","created_at":"2026-05-18T04:37:11.683401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.2862","created_at":"2026-05-18T04:37:11.683401+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TBWZCZHGODE","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TBWZCZHGODEGTBY","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TBWZCZH","created_at":"2026-05-18T12:25:54.717736+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/2TBWZCZHGODEGTBYKYS3F2I5B4","json":"https://pith.science/pith/2TBWZCZHGODEGTBYKYS3F2I5B4.json","graph_json":"https://pith.science/api/pith-number/2TBWZCZHGODEGTBYKYS3F2I5B4/graph.json","events_json":"https://pith.science/api/pith-number/2TBWZCZHGODEGTBYKYS3F2I5B4/events.json","paper":"https://pith.science/paper/2TBWZCZH"},"agent_actions":{"view_html":"https://pith.science/pith/2TBWZCZHGODEGTBYKYS3F2I5B4","download_json":"https://pith.science/pith/2TBWZCZHGODEGTBYKYS3F2I5B4.json","view_paper":"https://pith.science/paper/2TBWZCZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.2862&json=true","fetch_graph":"https://pith.science/api/pith-number/2TBWZCZHGODEGTBYKYS3F2I5B4/graph.json","fetch_events":"https://pith.science/api/pith-number/2TBWZCZHGODEGTBYKYS3F2I5B4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TBWZCZHGODEGTBYKYS3F2I5B4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TBWZCZHGODEGTBYKYS3F2I5B4/action/storage_attestation","attest_author":"https://pith.science/pith/2TBWZCZHGODEGTBYKYS3F2I5B4/action/author_attestation","sign_citation":"https://pith.science/pith/2TBWZCZHGODEGTBYKYS3F2I5B4/action/citation_signature","submit_replication":"https://pith.science/pith/2TBWZCZHGODEGTBYKYS3F2I5B4/action/replication_record"}},"created_at":"2026-05-18T04:37:11.683401+00:00","updated_at":"2026-05-18T04:37:11.683401+00:00"}