{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CNIZZ6BBNJHW7FIV5MSIVXNMGC","short_pith_number":"pith:CNIZZ6BB","schema_version":"1.0","canonical_sha256":"13519cf8216a4f6f9515eb248addac308591d2b251122e8e0d85c17821c9671b","source":{"kind":"arxiv","id":"2605.17222","version":1},"attestation_state":"computed","paper":{"title":"Triple-Hoisted Baby-Step Giant-Step Linear Transformation over CKKS Homomorphic Encryption and Hardware Accelerator","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A triple-hoisted BSGS algorithm for CKKS linear transforms plus FPGA accelerator reduces off-chip memory access 2.9x and computational latency 5.8x versus prior best designs.","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Sajjad Akherati, Xinmiao Zhang","submitted_at":"2026-05-17T01:57:35Z","abstract_excerpt":"Computations can be directly carried out over ciphertexts using homomorphic encryption (HE), which is indispensable for privacy-preserving cloud computing. Linear transformation is widely used in neural networks, including large language models. However, the implementation of linear transformation over HE requires a large number of ciphertext rotations, which incur significant memory and hardware overhead despite existing simplification techniques. This paper proposes a triple-hoisted baby-step giant-step algorithm that decomposes the baby step further to substantially reduce the number of cip"},"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":"2605.17222","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-17T01:57:35Z","cross_cats_sorted":[],"title_canon_sha256":"39444c6590ae0995d40f1ea25d423e4e69ac9bbd51ce1aeba3d386a543f82bfd","abstract_canon_sha256":"a78470f3cccffd7bce929a0475d4ac77c48c3337ed48cc523bf5eca915f6e3ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:46.009293Z","signature_b64":"BHRItJ3+ewkBShjWqcWaaqS3zBjL5Bt9vEEx2KT2tjf0AqNEnvGy+Y/AqzqDO2fbMaElqd98dhAVrLvnNyoXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13519cf8216a4f6f9515eb248addac308591d2b251122e8e0d85c17821c9671b","last_reissued_at":"2026-05-20T00:03:46.008502Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:46.008502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triple-Hoisted Baby-Step Giant-Step Linear Transformation over CKKS Homomorphic Encryption and Hardware Accelerator","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A triple-hoisted BSGS algorithm for CKKS linear transforms plus FPGA accelerator reduces off-chip memory access 2.9x and computational latency 5.8x versus prior best designs.","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Sajjad Akherati, Xinmiao Zhang","submitted_at":"2026-05-17T01:57:35Z","abstract_excerpt":"Computations can be directly carried out over ciphertexts using homomorphic encryption (HE), which is indispensable for privacy-preserving cloud computing. Linear transformation is widely used in neural networks, including large language models. However, the implementation of linear transformation over HE requires a large number of ciphertext rotations, which incur significant memory and hardware overhead despite existing simplification techniques. This paper proposes a triple-hoisted baby-step giant-step algorithm that decomposes the baby step further to substantially reduce the number of cip"},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"For a set of typical parameters, the proposed design reduces the off-chip memory access by 2.9x compared to the best prior design and achieves a 5.8x reduction in computational latency compared with the baseline design.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The reported gains assume that the chosen decomposition parameters and phase partitioning incur no hidden overheads that would appear in full end-to-end encrypted inference workloads; this premise is stated in the abstract when the authors restrict evaluation to 'a set of typical parameters' without showing workload-level measurements.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A triple-hoisted BSGS algorithm for CKKS linear transforms plus FPGA accelerator reduces off-chip memory access 2.9x and computational latency 5.8x versus prior best designs.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"f6a3766a43631dd3f9a39348c2c82cff6c97e94019f864c559785a5c8518041e"},"source":{"id":"2605.17222","kind":"arxiv","version":1},"verdict":{"id":"a095b363-50f7-4c2b-99a7-5f82e6de75ea","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-20T00:00:06.000135Z","strongest_claim":"For a set of typical parameters, the proposed design reduces the off-chip memory access by 2.9x compared to the best prior design and achieves a 5.8x reduction in computational latency compared with the baseline design.","one_line_summary":"A triple-hoisted BSGS algorithm for CKKS linear transforms plus FPGA accelerator reduces off-chip memory access 2.9x and computational latency 5.8x versus prior best designs.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The reported gains assume that the chosen decomposition parameters and phase partitioning incur no hidden overheads that would appear in full end-to-end encrypted inference workloads; this premise is stated in the abstract when the authors restrict evaluation to 'a set of typical parameters' without showing workload-level measurements.","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17222/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-19T22:01:57.916836Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.808450Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c59679a22c37c1eb005131c32c73d826be3f569883ea3c684dfece003224feef"},"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":"2605.17222","created_at":"2026-05-20T00:03:46.008626+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.17222v1","created_at":"2026-05-20T00:03:46.008626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17222","created_at":"2026-05-20T00:03:46.008626+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNIZZ6BBNJHW","created_at":"2026-05-20T00:03:46.008626+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNIZZ6BBNJHW7FIV","created_at":"2026-05-20T00:03:46.008626+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNIZZ6BB","created_at":"2026-05-20T00:03:46.008626+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/CNIZZ6BBNJHW7FIV5MSIVXNMGC","json":"https://pith.science/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC.json","graph_json":"https://pith.science/api/pith-number/CNIZZ6BBNJHW7FIV5MSIVXNMGC/graph.json","events_json":"https://pith.science/api/pith-number/CNIZZ6BBNJHW7FIV5MSIVXNMGC/events.json","paper":"https://pith.science/paper/CNIZZ6BB"},"agent_actions":{"view_html":"https://pith.science/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC","download_json":"https://pith.science/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC.json","view_paper":"https://pith.science/paper/CNIZZ6BB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.17222&json=true","fetch_graph":"https://pith.science/api/pith-number/CNIZZ6BBNJHW7FIV5MSIVXNMGC/graph.json","fetch_events":"https://pith.science/api/pith-number/CNIZZ6BBNJHW7FIV5MSIVXNMGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC/action/storage_attestation","attest_author":"https://pith.science/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC/action/author_attestation","sign_citation":"https://pith.science/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC/action/citation_signature","submit_replication":"https://pith.science/pith/CNIZZ6BBNJHW7FIV5MSIVXNMGC/action/replication_record"}},"created_at":"2026-05-20T00:03:46.008626+00:00","updated_at":"2026-05-20T00:03:46.008626+00:00"}