Efficient Mod Approximation and Its Applications to CKKS Ciphertexts
The episode discusses "Efficient Mod Approximation and Its Applications to CKKS Ciphertexts." Hosts review how the paper solves reliable mod computation across an entire input domain using polynomial interpolation and Chebyshev series. They also detail two data packing schemes, BitStack and CRTStack, which significantly improve space usage in CKKS for efficient secure computation.