Re:Experimenting with Post-Quantum Cryptography
by aseipp on Thursday July 07, 2016 @02:10PM
(#12051096)
NTRU is patented though and requires you to use their GPL library for patent exemption, or have a paid license (as said in the project README). However, given that, there's also http://tbuktu.github.io/ntru/ as BSD, so I'm not sure how to square that with what the owners of NTRU publicly stated. Apparently the EU is also considering it for some sort of standardization?
Bernstein also recently released a paper on NTRU Prime which I just became aware of, although it makes no mention of the patent issue. https://ntruprime.cr.yp.to/ntruprime-20160511.pdf
In any case, it'd be interesting to get an answer on this, since NTRU has looked interesting for a long time, but the patents were pretty unfortunate.
Re:Experimenting with Post-Quantum Cryptography
by eximius on Thursday July 07, 2016 @04:44PM
(#12051956)
It is lattice based so the state of the art to attack it uses LLL lattice reduction, I believe. I wrote a python implementation of both and, with pypy, it is quite fast at encrypting and decrypting. The LLL reduction was rather slow, but impressive that it could be done within a few minutes for some low-rank lattices.
Re:Experimenting with Post-Quantum Cryptography
by math_and_stuff on Friday July 08, 2016 @12:47AM
(#12053606)
Alternating between tours of BKZ(50) and y-sparse enumeration is much stronger. I have some BSD-d C++ implementations here: https://github.com/elemental/Elemental/tree/master/include/E...
https://github.com/NTRUOpenSourceProject/ntru-crypto