4 ms·
I discovered NTRU while searching for a fast alternative to RSA for asymmetric encryption. It's said to be quantum resistant as well but I can only vouch for it
by gfody 10y ago
I discovered NTRU while searching for a fast alternative to RSA for asymmetric encryption. It's said to be quantum resistant as well but I can only vouch for its speed (it is very fast and served my purpose perfectly).
https://github.com/NTRUOpenSourceProject/ntru-crypto https://github.com/NTRUOpenSourceProject/ntru-crypto
- aseipp 10y agoNTRU 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/ 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 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.
- eximius 10y agoIt 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.
- math_and_stuff 10y agoAlternating 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/El/number_theory/lattice https://github.com/elemental/Elemental/tree/master/include/E...