A deterministic polynomial-time algorithm computes two-element representations of ideals in number fields under a coprimality condition on the norm and index.
multiplicatively perturbed
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Constructs an explicit isomorphism showing root-based attacks cannot extend to fully-split PLWE without distorting samples, and proves all such isomorphisms take this form.
citing papers explorer
-
Deterministic and Efficient Ideal Arithmetic via Two-Element Representations
A deterministic polynomial-time algorithm computes two-element representations of ideals in number fields under a coprimality condition on the norm and index.
-
An alternative approach towards attacks against fully-split PLWE instances
Constructs an explicit isomorphism showing root-based attacks cannot extend to fully-split PLWE without distorting samples, and proves all such isomorphisms take this form.