Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Finding the shortest vector of a lattice is one of the most important problems in computational lattice theory. For a random lattice, one can estimate the length of the shortest vector using the Gaussian heuristic. Hover, no rigorous proof can be provided for some classes of lattices, as the Gaussian heuristic may not hold for them. ,  propose a general method to estimate lor bounds of the shortest vector lengths for random integral lattices in certain classes, which is based on the incompressibility method from the theory of Kolmogorov complexity. As an application,  can prove that for a random NTRU lattice, with an overwhelming probability, the ratio beten the length of the shortest vector and the length of the target vector, which corresponds to the secret key, is at least a constant, independent of the rank of the lattice.
['Jingguo Bi', 'Qi Cheng']
I am writing a research paper on a idea Lower bounds of shortest vector lengths in random NTRU lattices
[{"from": "human", "value": "I am writing a research paper on a idea Lower bounds of shortest vector lengths in random NTRU lattices"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Finding the shortest vector of a lattice is one of the most important problems in computational lattice theory. For a random lattice, one can estimate the length of the shortest vector using the Gaussian heuristic. Hover, no rigorous proof can be provided for some classes of lattices, as the Gaussian heuristic may not hold for them. ,  propose a general method to estimate lor bounds of the shortest vector lengths for random integral lattices in certain classes, which is based on the incompressibility method from the theory of Kolmogorov complexity. As an application,  can prove that for a random NTRU lattice, with an overwhelming probability, the ratio beten the length of the shortest vector and the length of the target vector, which corresponds to the secret key, is at least a constant, independent of the rank of the lattice."}]