Abstract: We consider the complexity of deciding the truth of first-order existential sentences of linear arithmetic with divisibility over both the integers and the p-adic numbers. We show that if an ...
Abstract: Modular arithmetic, particularly modular reduction, is widely used in cryptographic applications such as homomorphic encryption (HE) and zero-knowledge proofs (ZKP). High-bit-width ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback