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…

Coeffs polynomial mult in CKKS

ypolyakov August 3, 2026, 6:40pm 2

Topic		Replies	Views
Polynomial Multiplication in CKKS FHE Questions	8	657	November 6, 2023
Implement CKKS- coefficient encoding multiplication Library Questions	3	152	April 29, 2026
Easy way to evaluate N/2 polynomials over N/2 slots Library Questions	3	101	November 5, 2025
CKKS: Plaintext from EVAL to COEFF Library Questions	3	227	December 7, 2023
CKKS with coefficient and slot encoding Library Questions	1	167	September 11, 2024