Abstract
An answer is obtained to a question posed in 2008 by V. Lyubashevsky about an efficient algorithm for calculating the parameter θ(f) that characterizes the value of the sup-norm of the product of elements of the ring of truncated polynomials modulo a given unitary polynomial f (x) with real coefficients. The results are used to estimate the decryption failure probability in NTRU-like cryptosystems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
