Alekseychuk A.N., Matiyko A.A.
Achievable upper bound for the sup-norm of the elements' product in the ring of truncated polynomials and its application to the analysis of ntru-like cryptosystems

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. © 2021, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: decryption failure probability, lattice-based cryptography, NTRU-like cryptosystem, sup-norm of product of polynomials, truncated polynomial ring, Cryptography, Decryption failures, ITS applications, Real coefficients, Upper Bound, Polynomials

Cite:
Alekseychuk A.N., Matiyko A.A. (2021). Achievable upper bound for the sup-norm of the elements' product in the ring of truncated polynomials and its application to the analysis of ntru-like cryptosystems. Cybernetics and Systems Analysis, 57 (2), 23–29. doi: https://doi.org/10.1007/s10559-021-00343-z http://jnas.nbuv.gov.ua/article/UJRN-0001221018 [In Russian].