Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. This article is motivated by an interesting peculiar property of NTRU lattices. Namely,  show that NTRU lattices are proportional to the so-called symplectic lattices. This suggests to try to adapt the classical reduction theory to symplectic lattices, from both a mathematical and an algorithmic point of view. As a first step,  show that orthogonalization techniques (Cholesky, Gram-Schmidt, QR factorization, etc.) which are at the heart of all reduction algorithms known, are all compatible with symplecticity, and that they can be significantly sped up for symplectic matrices. Surprisingly, by doing so,  also discover a new integer Gram-Schmidt algorithm, which is faster than the usual algorithm for all matrices. Finally,  study symplectic variants of the celebrated LLL reduction algorithm, and obtain interesting speed ups.
['Nicolas Gama', 'Nick Howgrave-Graham', 'Phong Q. Nguyen']
I am writing a research paper on a idea Symplectic lattice reduction and NTRU
[{"from": "human", "value": "I am writing a research paper on a idea Symplectic lattice reduction and NTRU"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. This article is motivated by an interesting peculiar property of NTRU lattices. Namely,  show that NTRU lattices are proportional to the so-called symplectic lattices. This suggests to try to adapt the classical reduction theory to symplectic lattices, from both a mathematical and an algorithmic point of view. As a first step,  show that orthogonalization techniques (Cholesky, Gram-Schmidt, QR factorization, etc.) which are at the heart of all reduction algorithms known, are all compatible with symplecticity, and that they can be significantly sped up for symplectic matrices. Surprisingly, by doing so,  also discover a new integer Gram-Schmidt algorithm, which is faster than the usual algorithm for all matrices. Finally,  study symplectic variants of the celebrated LLL reduction algorithm, and obtain interesting speed ups."}]