Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Does the improved version of NTRU — which is described in "Making NTRU as Secure as Worst-Case Problems over Ideal Lattices" by Stehlé and Steinfeld — fall under the same patents as the original?

share|improve this question
As a side-note: The proof is asymptotic and thus of limited value for practical key-sizes. – CodesInChaos Sep 8 '13 at 13:07
Ah, thanks for the clarification. – Geoffrey Irving Sep 8 '13 at 17:17
up vote 1 down vote accepted

I work for Security Innovation, which owns the NTRU patents. We think the NTRU patents would cover this algorithm too -- the patents are written broadly enough to cover different types of keys.

Note that although there are patents, we try to be reasonable about licensing terms. We have granted a free license for non-commercial use on many occasions and are currently exploring our options about licensing both the patents and a reference implementation under an open-source license. If you're interested in learning more, you can contact me directly on

share|improve this answer
The patents are now available under GPL. Go use them! – William Whyte Nov 28 '13 at 5:21

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.