{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LWXJ2FVN7ZXSYHPWRL4AGMPBQV","short_pith_number":"pith:LWXJ2FVN","schema_version":"1.0","canonical_sha256":"5dae9d16adfe6f2c1df68af80331e1855991133e686959f12c552a3fee5b17fe","source":{"kind":"arxiv","id":"1108.2714","version":2},"attestation_state":"computed","paper":{"title":"Approximate common divisors via lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"math.NT","authors_text":"Henry Cohn, Nadia Heninger","submitted_at":"2011-08-12T20:43:12Z","abstract_excerpt":"We analyze the multivariate generalization of Howgrave-Graham's algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common divisor of size N^beta, this improves the size of the error tolerated from N^(beta^2) to N^(beta^((m+1)/m)), under a commonly used heuristic assumption. This gives a more detailed analysis of the hardness assumption underlying the recent fully homomorphic cryptosystem of van Dijk, Gentry, Halevi, and Vaikuntanathan. While these results do not challenge the suggested parameters, a 2^(n^epsilon) approximation algorithm "},"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":"1108.2714","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-08-12T20:43:12Z","cross_cats_sorted":["cs.CR","cs.IT","math.IT"],"title_canon_sha256":"f0658b7665d9a87528027c7363feb0dfe23e9880becfa3d9fa160a68b87ed7c4","abstract_canon_sha256":"13d5735f813fdf4a40fa3d8c3e29f32ffb01a1275e3fde363583a807a03b4375"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:13.529308Z","signature_b64":"obbH+7Qk1yHNT/B3FpJAlEay8NgJaNsIq+waEUt7H3DalDwXbuiZLX+QsthHarIYSGBzsxXXNaG6cLV6MtTJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dae9d16adfe6f2c1df68af80331e1855991133e686959f12c552a3fee5b17fe","last_reissued_at":"2026-05-18T04:00:13.528589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:13.528589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate common divisors via lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.IT"],"primary_cat":"math.NT","authors_text":"Henry Cohn, Nadia Heninger","submitted_at":"2011-08-12T20:43:12Z","abstract_excerpt":"We analyze the multivariate generalization of Howgrave-Graham's algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common divisor of size N^beta, this improves the size of the error tolerated from N^(beta^2) to N^(beta^((m+1)/m)), under a commonly used heuristic assumption. This gives a more detailed analysis of the hardness assumption underlying the recent fully homomorphic cryptosystem of van Dijk, Gentry, Halevi, and Vaikuntanathan. While these results do not challenge the suggested parameters, a 2^(n^epsilon) approximation algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.2714","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":""},"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":"1108.2714","created_at":"2026-05-18T04:00:13.528696+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.2714v2","created_at":"2026-05-18T04:00:13.528696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.2714","created_at":"2026-05-18T04:00:13.528696+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWXJ2FVN7ZXS","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWXJ2FVN7ZXSYHPW","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWXJ2FVN","created_at":"2026-05-18T12:26:34.985390+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/LWXJ2FVN7ZXSYHPWRL4AGMPBQV","json":"https://pith.science/pith/LWXJ2FVN7ZXSYHPWRL4AGMPBQV.json","graph_json":"https://pith.science/api/pith-number/LWXJ2FVN7ZXSYHPWRL4AGMPBQV/graph.json","events_json":"https://pith.science/api/pith-number/LWXJ2FVN7ZXSYHPWRL4AGMPBQV/events.json","paper":"https://pith.science/paper/LWXJ2FVN"},"agent_actions":{"view_html":"https://pith.science/pith/LWXJ2FVN7ZXSYHPWRL4AGMPBQV","download_json":"https://pith.science/pith/LWXJ2FVN7ZXSYHPWRL4AGMPBQV.json","view_paper":"https://pith.science/paper/LWXJ2FVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.2714&json=true","fetch_graph":"https://pith.science/api/pith-number/LWXJ2FVN7ZXSYHPWRL4AGMPBQV/graph.json","fetch_events":"https://pith.science/api/pith-number/LWXJ2FVN7ZXSYHPWRL4AGMPBQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWXJ2FVN7ZXSYHPWRL4AGMPBQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWXJ2FVN7ZXSYHPWRL4AGMPBQV/action/storage_attestation","attest_author":"https://pith.science/pith/LWXJ2FVN7ZXSYHPWRL4AGMPBQV/action/author_attestation","sign_citation":"https://pith.science/pith/LWXJ2FVN7ZXSYHPWRL4AGMPBQV/action/citation_signature","submit_replication":"https://pith.science/pith/LWXJ2FVN7ZXSYHPWRL4AGMPBQV/action/replication_record"}},"created_at":"2026-05-18T04:00:13.528696+00:00","updated_at":"2026-05-18T04:00:13.528696+00:00"}