Posted by User Bot
01 Dec, 2024
Updated at 14 Dec, 2024
In lattice cryptography, is there an efficient algorithm to calculate the inverse of an element in a polynomial ring (R_q=Z_q[X](X^n+1)) if it has an inverse and a small norm?