{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DTVYGPKJ5IB2TM5MTCYQYBVCEZ","short_pith_number":"pith:DTVYGPKJ","schema_version":"1.0","canonical_sha256":"1ceb833d49ea03a9b3ac98b10c06a22647b6317106c2e784a930765ff9191726","source":{"kind":"arxiv","id":"2604.22900","version":2},"attestation_state":"computed","paper":{"title":"Module Lattice Security (Part II): Module Lattice Reduction via Optimal Sign Selection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Module lattices reduce to the same quality as ideal lattices by decomposing them into rank-1 submodules and optimizing sign choices.","cross_cats":["cs.IT","math.IT","quant-ph"],"primary_cat":"cs.CR","authors_text":"Ming-Xing Luo","submitted_at":"2026-04-24T13:54:33Z","abstract_excerpt":"We extend the CDPR's quantum attack from ideal lattices to module lattices over $2^k$-th cyclotomic rings. Using trace orthogonality of the power basis, we decompose a rank-$d$ module into mutually orthogonal rank-$1$ submodules, and apply CDPR's analysis to each independently and return the shortest candidate. The Hermite factor $\\exp(\\tilde{O}(\\sqrt{n}))$ matches the ideal case, with a module reduction factor $\\alpha_d=O(1)$ independent of the rank, under a balance hypothesis (proved for Gaussian distribution) automatic for MLWE-distributed bases. To enable a bounded-precision implementation"},"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":"2604.22900","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-04-24T13:54:33Z","cross_cats_sorted":["cs.IT","math.IT","quant-ph"],"title_canon_sha256":"f22d4343e2ae3f58bf1679107170bd675ec8d4262d17856ad5ca3c2b45bcce6b","abstract_canon_sha256":"753d4ab5ff835b2e1ea8debe452131b663a8d2a03a4345b4be5edb1822f2f9d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:50.644891Z","signature_b64":"vtGzkcjqgBfwl7R27skrzqyBnHqwRwKXnYknsBKKEtbVfJ8h7rE634/HXC7pkbc88J7gBz9sLLt/hRaDbu7gDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ceb833d49ea03a9b3ac98b10c06a22647b6317106c2e784a930765ff9191726","last_reissued_at":"2026-06-03T01:05:50.644486Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:50.644486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Module Lattice Security (Part II): Module Lattice Reduction via Optimal Sign Selection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Module lattices reduce to the same quality as ideal lattices by decomposing them into rank-1 submodules and optimizing sign choices.","cross_cats":["cs.IT","math.IT","quant-ph"],"primary_cat":"cs.CR","authors_text":"Ming-Xing Luo","submitted_at":"2026-04-24T13:54:33Z","abstract_excerpt":"We extend the CDPR's quantum attack from ideal lattices to module lattices over $2^k$-th cyclotomic rings. Using trace orthogonality of the power basis, we decompose a rank-$d$ module into mutually orthogonal rank-$1$ submodules, and apply CDPR's analysis to each independently and return the shortest candidate. The Hermite factor $\\exp(\\tilde{O}(\\sqrt{n}))$ matches the ideal case, with a module reduction factor $\\alpha_d=O(1)$ independent of the rank, under a balance hypothesis (proved for Gaussian distribution) automatic for MLWE-distributed bases. To enable a bounded-precision implementation"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"This base module reduction achieves a Hermite factor exp(Õ(√n)) matching the ideal case, with a module reduction factor O(1) independent of the rank, under a balance hypothesis automatically satisfied for MLWE-distributed bases.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"All results build on the class number one condition h_k^+=1 established in Part I of this series; the balance hypothesis is assumed to hold automatically for MLWE bases without independent proof here.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"CDPR reduction extends to module lattices with Hermite factor exp(Õ(√n)), O(1) rank-independent module factor under MLWE balance, plus optimal sign discrepancy δ*≈0.4407 from MILP, assuming class number one from Part I.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Module lattices reduce to the same quality as ideal lattices by decomposing them into rank-1 submodules and optimizing sign choices.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8a8c983e07c500053276d690da7b25441ebc9247d97e5add0a8e71cd4d719f6d"},"source":{"id":"2604.22900","kind":"arxiv","version":2},"verdict":{"id":"0ff17cde-d17b-4527-aef7-b8397e5b9ee8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T11:25:55.368898Z","strongest_claim":"This base module reduction achieves a Hermite factor exp(Õ(√n)) matching the ideal case, with a module reduction factor O(1) independent of the rank, under a balance hypothesis automatically satisfied for MLWE-distributed bases.","one_line_summary":"CDPR reduction extends to module lattices with Hermite factor exp(Õ(√n)), O(1) rank-independent module factor under MLWE balance, plus optimal sign discrepancy δ*≈0.4407 from MILP, assuming class number one from Part I.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"All results build on the class number one condition h_k^+=1 established in Part I of this series; the balance hypothesis is assumed to hold automatically for MLWE bases without independent proof here.","pith_extraction_headline":"Module lattices reduce to the same quality as ideal lattices by decomposing them into rank-1 submodules and optimizing sign choices."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.22900/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T10:37:26.541258Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:53:24.646855Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"4b0bf08ef350ab3a8d225857e3b85c884a5871121328928984e1b7301539a8ea"},"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":"2604.22900","created_at":"2026-06-03T01:05:50.644541+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.22900v2","created_at":"2026-06-03T01:05:50.644541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.22900","created_at":"2026-06-03T01:05:50.644541+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTVYGPKJ5IB2","created_at":"2026-06-03T01:05:50.644541+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTVYGPKJ5IB2TM5M","created_at":"2026-06-03T01:05:50.644541+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTVYGPKJ","created_at":"2026-06-03T01:05:50.644541+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/DTVYGPKJ5IB2TM5MTCYQYBVCEZ","json":"https://pith.science/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ.json","graph_json":"https://pith.science/api/pith-number/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/graph.json","events_json":"https://pith.science/api/pith-number/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/events.json","paper":"https://pith.science/paper/DTVYGPKJ"},"agent_actions":{"view_html":"https://pith.science/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ","download_json":"https://pith.science/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ.json","view_paper":"https://pith.science/paper/DTVYGPKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.22900&json=true","fetch_graph":"https://pith.science/api/pith-number/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/action/storage_attestation","attest_author":"https://pith.science/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/action/author_attestation","sign_citation":"https://pith.science/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/action/citation_signature","submit_replication":"https://pith.science/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/action/replication_record"}},"created_at":"2026-06-03T01:05:50.644541+00:00","updated_at":"2026-06-03T01:05:50.644541+00:00"}