{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:I57LYGRFNWBDCCT474X4JFZKGG","short_pith_number":"pith:I57LYGRF","schema_version":"1.0","canonical_sha256":"477ebc1a256d82310a7cff2fc4972a3182f3f5c6bccc32296eba98e9d9384b31","source":{"kind":"arxiv","id":"2208.08125","version":2},"attestation_state":"computed","paper":{"title":"A Tutorial Introduction to Lattice-based Cryptography and Homomorphic Encryption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Kee Siong Ng, Michael Purcell, Yang Li","submitted_at":"2022-08-17T07:40:56Z","abstract_excerpt":"Why study Lattice-based Cryptography? There are a few ways to answer this question. 1. It is useful to have cryptosystems that are based on a variety of hard computational problems so the different cryptosystems are not all vulnerable in the same way. 2. The computational aspects of lattice-based cryptosystem are usually simple to understand and fairly easy to implement in practice. 3. Lattice-based cryptosystems have lower encryption/decryption computational complexities compared to popular cryptosystems that are based on the integer factorisation or the discrete logarithm problems. 4. Lattic"},"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":"2208.08125","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2022-08-17T07:40:56Z","cross_cats_sorted":[],"title_canon_sha256":"cf257aa70b0efbc11f8d2fa33b3c1123258368d708c0942e572ef9568b8b44ac","abstract_canon_sha256":"bb3c4aa3ed52bbb26c79748e3749abd447cf309ffdbe96b4a0443ad39ea612fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:01:40.428158Z","signature_b64":"xaWbM4SCmF9lpLLHP7ibwtYYLLycLOfKUulnReoyutU0yIXsOe/TMlt616/m8nJ8XRF0SrTKdOLWTBXRQR1sCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"477ebc1a256d82310a7cff2fc4972a3182f3f5c6bccc32296eba98e9d9384b31","last_reissued_at":"2026-07-05T05:01:40.427631Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:01:40.427631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tutorial Introduction to Lattice-based Cryptography and Homomorphic Encryption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Kee Siong Ng, Michael Purcell, Yang Li","submitted_at":"2022-08-17T07:40:56Z","abstract_excerpt":"Why study Lattice-based Cryptography? There are a few ways to answer this question. 1. It is useful to have cryptosystems that are based on a variety of hard computational problems so the different cryptosystems are not all vulnerable in the same way. 2. The computational aspects of lattice-based cryptosystem are usually simple to understand and fairly easy to implement in practice. 3. Lattice-based cryptosystems have lower encryption/decryption computational complexities compared to popular cryptosystems that are based on the integer factorisation or the discrete logarithm problems. 4. Lattic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.08125","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.08125/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2208.08125","created_at":"2026-07-05T05:01:40.427695+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.08125v2","created_at":"2026-07-05T05:01:40.427695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.08125","created_at":"2026-07-05T05:01:40.427695+00:00"},{"alias_kind":"pith_short_12","alias_value":"I57LYGRFNWBD","created_at":"2026-07-05T05:01:40.427695+00:00"},{"alias_kind":"pith_short_16","alias_value":"I57LYGRFNWBDCCT4","created_at":"2026-07-05T05:01:40.427695+00:00"},{"alias_kind":"pith_short_8","alias_value":"I57LYGRF","created_at":"2026-07-05T05:01:40.427695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.00352","citing_title":"Enabling Secure and Ephemeral AI Workloads in Data Mesh Environments","ref_index":53,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I57LYGRFNWBDCCT474X4JFZKGG","json":"https://pith.science/pith/I57LYGRFNWBDCCT474X4JFZKGG.json","graph_json":"https://pith.science/api/pith-number/I57LYGRFNWBDCCT474X4JFZKGG/graph.json","events_json":"https://pith.science/api/pith-number/I57LYGRFNWBDCCT474X4JFZKGG/events.json","paper":"https://pith.science/paper/I57LYGRF"},"agent_actions":{"view_html":"https://pith.science/pith/I57LYGRFNWBDCCT474X4JFZKGG","download_json":"https://pith.science/pith/I57LYGRFNWBDCCT474X4JFZKGG.json","view_paper":"https://pith.science/paper/I57LYGRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.08125&json=true","fetch_graph":"https://pith.science/api/pith-number/I57LYGRFNWBDCCT474X4JFZKGG/graph.json","fetch_events":"https://pith.science/api/pith-number/I57LYGRFNWBDCCT474X4JFZKGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I57LYGRFNWBDCCT474X4JFZKGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I57LYGRFNWBDCCT474X4JFZKGG/action/storage_attestation","attest_author":"https://pith.science/pith/I57LYGRFNWBDCCT474X4JFZKGG/action/author_attestation","sign_citation":"https://pith.science/pith/I57LYGRFNWBDCCT474X4JFZKGG/action/citation_signature","submit_replication":"https://pith.science/pith/I57LYGRFNWBDCCT474X4JFZKGG/action/replication_record"}},"created_at":"2026-07-05T05:01:40.427695+00:00","updated_at":"2026-07-05T05:01:40.427695+00:00"}