Two relational structures are indistinguishable by k-RCR if and only if they receive identical homomorphism counts from every structure of generalised hypertreewidth ≤ k.
On lattices, learning with errors, random linear codes, and cryptography
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 7roles
background 1polarities
background 1representative citing papers
On random unimodular lattices, full-sign Gibbs mass of e^{a/n}-edge windows vanishes for c≤1 and converges to a Poisson–Dirichlet partition for c>1; primitive fixed-γ windows have visibility threshold c=γ^{-2} in the high-temperature regime.
Quantum rejection sampling yields a quadratically faster discrete Gaussian sampler on lattices, enabling two improved versions of quantum dual attacks with trade-offs in speed and memory.
DQI-Kit automates encoding of objectives and constraints into Max-LINSAT instances and estimates expected DQI performance on the resulting problems.
The paper develops a general incremental maintenance technique for arbitrary join queries that achieves update times bounded by an optimizable maintenance width using heavy-light partitioning.
A layered framework is defined to interpret post-quantum cryptographic security assumptions through complexity models, combinatorial Hodge theory on lattices, and Julia-based lattice reduction experiments.
An OpenACC GPU implementation of an LWE KEM achieves up to 208x speedup on Grace Hopper Superchip with roughly 2x better energy efficiency than CPU baselines.
citing papers explorer
-
Homomorphism Indistinguishability Beyond Graphs: Relational Weisfeiler--Leman and Hypertree Width
Two relational structures are indistinguishable by k-RCR if and only if they receive identical homomorphism counts from every structure of generalised hypertreewidth ≤ k.
-
Thermal Concentration and Poisson-Dirichlet Edge Statistics for Random-Lattice Gibbs Ensembles
On random unimodular lattices, full-sign Gibbs mass of e^{a/n}-edge windows vanishes for c≤1 and converges to a Poisson–Dirichlet partition for c>1; primitive fixed-γ windows have visibility threshold c=γ^{-2} in the high-temperature regime.
-
Quantum algorithm for Discrete Gaussian Sampling
Quantum rejection sampling yields a quadratically faster discrete Gaussian sampler on lattices, enabling two improved versions of quantum dual attacks with trade-offs in speed and memory.
-
From Constraint to Code: DQI-Kit -- A Software Framework for Decoded Quantum Interferometry
DQI-Kit automates encoding of objectives and constraints into Max-LINSAT instances and estimates expected DQI performance on the resulting problems.
-
Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations
The paper develops a general incremental maintenance technique for arbitrary join queries that achieves update times bounded by an optimizable maintenance width using heavy-light partitioning.
-
Explainable PQC: A Layered Interpretive Framework for Post-Quantum Cryptographic Security Assumptions
A layered framework is defined to interpret post-quantum cryptographic security assumptions through complexity models, combinatorial Hodge theory on lattices, and Julia-based lattice reduction experiments.
-
GPU Acceleration of Learning With Errors KEMs Using OpenACC for Post-Quantum Cryptography
An OpenACC GPU implementation of an LWE KEM achieves up to 208x speedup on Grace Hopper Superchip with roughly 2x better energy efficiency than CPU baselines.