Hot answers tagged

5

Sure there's a difference between Paillier and ElGamal as opposed to lattice-based cryptography regarding quantum attackers. Paillier's security is broken as soon as you can efficiently factor large integers which is "easy" using Shor's algorithm. This is caused by the fact that you can easily recover the private from the public key by factoring $n$. ...


2

There is no way to know what the authors of that paper even did. They say they used Python, but mention no libraries. If it is their own implementation of those algorithms in Python, it may tell you next to nothing of the real world performance of optimized implementations those algorithms. Further, they say they encrypted files of 68-235 KB, but do not ...



Only top voted, non community-wiki answers of a minimum length are eligible