Lattice signatures using NTRU on the hardness of worst-case ideal lattice problems.

Dipayan Das Vishal Saraswat Kajla Basu

Published in: IET Inf. Secur. (2020)

Keyphrases

worst case
np complete
upper bound
data sets
information theoretic
lattice structure
machine learning
bayesian networks
objective function
lower bound
np hard
optimization problems
approximation algorithms
problems involving
np hardness
lattice points