{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EISPKYGLLSIMMPDV4G4QWRZSOR","short_pith_number":"pith:EISPKYGL","schema_version":"1.0","canonical_sha256":"2224f560cb5c90c63c75e1b90b47327453648c0e0d072ce43a8b436fb337af02","source":{"kind":"arxiv","id":"2607.18533","version":1},"attestation_state":"computed","paper":{"title":"PIP-NTT: Towards a Scalable Memory-Parallelized Accelerator for Iterative NTT in PQC","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.AR","authors_text":"Ayesha Khalid, Ciara Rafferty, Maire O'Neill, Malik Imran, Muhammad Rashid, Safiullah Khan","submitted_at":"2026-07-20T21:57:25Z","abstract_excerpt":"The iterative forward and inverse number theoretic transform (NTT) is a key component in lattice-based post-quantum cryptography (PQC), typically implemented using Cooley-Tukey and Gentleman-Sande butterfly units. Existing iterative NTT accelerators often rely on ping-pong memory schemes and large memory blocks tied to the cyclotomic ring, which limits overall efficiency. To overcome this, we propose a memory-parallelization strategy using four smaller n/4-sized memories for ring size n, preserving the total memory footprint of conventional designs. We also introduce a multiplication-free resc"},"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":"2607.18533","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-07-20T21:57:25Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"6f58541693b49d6060838c080c70ddb15ec2451955bd866d614553f3080dc8bc","abstract_canon_sha256":"998f2c6b9444dd193f08c1f9e54ae1c15bfc068b6ba6e734ebfa56b7aee60c4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T00:22:53.122357Z","signature_b64":"D1VqapA41kwdtZIs247BnNQylj3QNaeSdUWib8Imyuq5SfqHPiyokZV8T372uyz247UQ8nTJiTwv8+3VMsMsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2224f560cb5c90c63c75e1b90b47327453648c0e0d072ce43a8b436fb337af02","last_reissued_at":"2026-07-22T00:22:53.121617Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T00:22:53.121617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PIP-NTT: Towards a Scalable Memory-Parallelized Accelerator for Iterative NTT in PQC","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.AR","authors_text":"Ayesha Khalid, Ciara Rafferty, Maire O'Neill, Malik Imran, Muhammad Rashid, Safiullah Khan","submitted_at":"2026-07-20T21:57:25Z","abstract_excerpt":"The iterative forward and inverse number theoretic transform (NTT) is a key component in lattice-based post-quantum cryptography (PQC), typically implemented using Cooley-Tukey and Gentleman-Sande butterfly units. Existing iterative NTT accelerators often rely on ping-pong memory schemes and large memory blocks tied to the cyclotomic ring, which limits overall efficiency. To overcome this, we propose a memory-parallelization strategy using four smaller n/4-sized memories for ring size n, preserving the total memory footprint of conventional designs. We also introduce a multiplication-free resc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.18533","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.18533/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":"2607.18533","created_at":"2026-07-22T00:22:53.122027+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.18533v1","created_at":"2026-07-22T00:22:53.122027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.18533","created_at":"2026-07-22T00:22:53.122027+00:00"},{"alias_kind":"pith_short_12","alias_value":"EISPKYGLLSIM","created_at":"2026-07-22T00:22:53.122027+00:00"},{"alias_kind":"pith_short_16","alias_value":"EISPKYGLLSIMMPDV","created_at":"2026-07-22T00:22:53.122027+00:00"},{"alias_kind":"pith_short_8","alias_value":"EISPKYGL","created_at":"2026-07-22T00:22:53.122027+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/EISPKYGLLSIMMPDV4G4QWRZSOR","json":"https://pith.science/pith/EISPKYGLLSIMMPDV4G4QWRZSOR.json","graph_json":"https://pith.science/api/pith-number/EISPKYGLLSIMMPDV4G4QWRZSOR/graph.json","events_json":"https://pith.science/api/pith-number/EISPKYGLLSIMMPDV4G4QWRZSOR/events.json","paper":"https://pith.science/paper/EISPKYGL"},"agent_actions":{"view_html":"https://pith.science/pith/EISPKYGLLSIMMPDV4G4QWRZSOR","download_json":"https://pith.science/pith/EISPKYGLLSIMMPDV4G4QWRZSOR.json","view_paper":"https://pith.science/paper/EISPKYGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.18533&json=true","fetch_graph":"https://pith.science/api/pith-number/EISPKYGLLSIMMPDV4G4QWRZSOR/graph.json","fetch_events":"https://pith.science/api/pith-number/EISPKYGLLSIMMPDV4G4QWRZSOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EISPKYGLLSIMMPDV4G4QWRZSOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EISPKYGLLSIMMPDV4G4QWRZSOR/action/storage_attestation","attest_author":"https://pith.science/pith/EISPKYGLLSIMMPDV4G4QWRZSOR/action/author_attestation","sign_citation":"https://pith.science/pith/EISPKYGLLSIMMPDV4G4QWRZSOR/action/citation_signature","submit_replication":"https://pith.science/pith/EISPKYGLLSIMMPDV4G4QWRZSOR/action/replication_record"}},"created_at":"2026-07-22T00:22:53.122027+00:00","updated_at":"2026-07-22T00:22:53.122027+00:00"}