Hi all!
I have a question about polynomial mult in CKKS. in particular I’d have to multiply two plaintexts p, \hat{p} to obtain p \cdot \hat{p} \bmod \mathbb{Z}[X]/(X^N+1), not in slot-wise.
As far as I am aware this can be done by “removing” the iDFT encoding, namely with a SlotsToCoeff procedure. I also know that the EvalSlotsToCoeffs(p.m_U0PreFFT, ctxtEnc) function computes exactly that, but inside the bootstrapping procedure, using bootstrapping precomputed material.
Is there a more friendly/adapt function to evaluate the SlotsToCoeff procedure * outside * of the bootstrapping to change the encoding of a ciphertext? thanks!