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.
[ Parent
| on HN ]
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...