Achievable upper bound for the sup-norm of the product of elements of the ring of truncated polynomials and its application to the analysis of NTRU-like cryptosystems
From MaRDI portal
Publication:2043997
DOI10.1007/S10559-021-00343-ZzbMath1469.94085OpenAlexW3143654950MaRDI QIDQ2043997
A. A. Matiyko, A. N. Alekseychuk
Publication date: 4 August 2021
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-021-00343-z
lattice-based cryptographytruncated polynomial ringdecryption failure probabilityNTRU-like cryptosystemsup-norm of product of polynomials
Cites Work
- Unnamed Item
- Applied cryptography and network security. 7th international conference, ACNS 2009, Paris-Rocquencourt, France, June 2--5, 2009. Proceedings
- Estimate all the {LWE, NTRU} schemes!
- Choosing Parameters for NTRUEncrypt
- Probability Inequalities for Sums of Bounded Random Variables
- Lattice-Based Identification Schemes Secure Under Active Attacks
This page was built for publication: Achievable upper bound for the sup-norm of the product of elements of the ring of truncated polynomials and its application to the analysis of NTRU-like cryptosystems
