<p style='text-indent:20px;'>Since their introduction in 2004, Polynomial Modular Number Systems (PMNS) have become a very interesting tool for implementing cryptosystems relying on modular arithmetic secure and efficient way. However, while implementation is simple, parameterization not trivial relies suitable choice of the polynomial which PMNS operates. The initial proposals were based...

We define a theta operator between spaces of Siegel modular forms (mod p), generalizing the theta operator for (elliptic) modular forms.