{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SARIWVICH4JSVCUQ4E6B7XIWBA","short_pith_number":"pith:SARIWVIC","schema_version":"1.0","canonical_sha256":"90228b55023f132a8a90e13c1fdd16080e9103a054acd3488421c08b3c476739","source":{"kind":"arxiv","id":"1711.07647","version":1},"attestation_state":"computed","paper":{"title":"Bilinear cryptography using finite $p$-groups of nilpotency class 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.GR","math.IT"],"primary_cat":"cs.CR","authors_text":"Ayan Mahalanobis, Pralhad Shinde","submitted_at":"2017-11-21T06:46:52Z","abstract_excerpt":"In this short note, we develop a novel idea of a bilinear cryptosystem using the discrete logarithm problem in matrices. These matrices come from a linear representation of a finite $p$-group of class 2. We discuss an example at the end."},"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":"1711.07647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-11-21T06:46:52Z","cross_cats_sorted":["cs.IT","math.GR","math.IT"],"title_canon_sha256":"9266806cfcec8c1ef4ba5320cd4efed52a3e3396eec00e3e97dff963e74d441c","abstract_canon_sha256":"5066afdba2741b6ff85b4b5e4546837d25b20819bbd1c7bde4e549789c76cacd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:51.001415Z","signature_b64":"1G5rhbZBEhk/cT4vqXXHMyaNFrYOhyie5VOZSRlMu5IPsHpEbNl2zhoC/kxyHpR9pkgqcWIxr44kNI86sXvqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90228b55023f132a8a90e13c1fdd16080e9103a054acd3488421c08b3c476739","last_reissued_at":"2026-05-18T00:29:51.000958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:51.000958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bilinear cryptography using finite $p$-groups of nilpotency class 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.GR","math.IT"],"primary_cat":"cs.CR","authors_text":"Ayan Mahalanobis, Pralhad Shinde","submitted_at":"2017-11-21T06:46:52Z","abstract_excerpt":"In this short note, we develop a novel idea of a bilinear cryptosystem using the discrete logarithm problem in matrices. These matrices come from a linear representation of a finite $p$-group of class 2. We discuss an example at the end."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07647","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.07647","created_at":"2026-05-18T00:29:51.001018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07647v1","created_at":"2026-05-18T00:29:51.001018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07647","created_at":"2026-05-18T00:29:51.001018+00:00"},{"alias_kind":"pith_short_12","alias_value":"SARIWVICH4JS","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SARIWVICH4JSVCUQ","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SARIWVIC","created_at":"2026-05-18T12:31:43.269735+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/SARIWVICH4JSVCUQ4E6B7XIWBA","json":"https://pith.science/pith/SARIWVICH4JSVCUQ4E6B7XIWBA.json","graph_json":"https://pith.science/api/pith-number/SARIWVICH4JSVCUQ4E6B7XIWBA/graph.json","events_json":"https://pith.science/api/pith-number/SARIWVICH4JSVCUQ4E6B7XIWBA/events.json","paper":"https://pith.science/paper/SARIWVIC"},"agent_actions":{"view_html":"https://pith.science/pith/SARIWVICH4JSVCUQ4E6B7XIWBA","download_json":"https://pith.science/pith/SARIWVICH4JSVCUQ4E6B7XIWBA.json","view_paper":"https://pith.science/paper/SARIWVIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07647&json=true","fetch_graph":"https://pith.science/api/pith-number/SARIWVICH4JSVCUQ4E6B7XIWBA/graph.json","fetch_events":"https://pith.science/api/pith-number/SARIWVICH4JSVCUQ4E6B7XIWBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SARIWVICH4JSVCUQ4E6B7XIWBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SARIWVICH4JSVCUQ4E6B7XIWBA/action/storage_attestation","attest_author":"https://pith.science/pith/SARIWVICH4JSVCUQ4E6B7XIWBA/action/author_attestation","sign_citation":"https://pith.science/pith/SARIWVICH4JSVCUQ4E6B7XIWBA/action/citation_signature","submit_replication":"https://pith.science/pith/SARIWVICH4JSVCUQ4E6B7XIWBA/action/replication_record"}},"created_at":"2026-05-18T00:29:51.001018+00:00","updated_at":"2026-05-18T00:29:51.001018+00:00"}