Can we efficiently find the inverse of elements in polynomial rings？
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?
Can we efficiently find the inverse of e...You must login to comment