This paper introduces a new central trapdoor for multivariate quadratic (MQ) public-key cryptosystems that allows for encryption, in contrast to time-tested MQ primitives such as Unbalanced Oil and Vinegar or Hidden Field Equations which only allow for signatures. Our construction is a mixed-ﬁeld scheme that exploits the commutativity of the extension ﬁeld to dramatically reduce the complexity of the extension ﬁeld polynomial implicitly present in the public key. However, this reduction can only be performed by the user who knows concise descriptions of two simple polynomials, which constitute the private key. After applying this transformation, the plaintext can be recovered by solving a linear system. We use the minus and projection modiﬁers to inoculate our scheme against known attacks. A straightforward C++ implementation conﬁrms the eﬃcient operation of the public key algorithms.