3

How does NIST do a comparison that a particular algorithm is efficient and its security can not be broken by future quantum attacks? How efficient an algorithm to implement is easy - these algorithms run on classical computers, and so people have made implementations of these algorithms, and it is straight-forward to measure the performance. Security is ...


2

It is worth mentioning that concrete estimations of the quantum hardness of various problems is still a very new research area, and certain questions are still unresolved. A good example of this is Piekert's paper He Gives C Sieves by the CSIDH. Besides being a great pun, this paper uses something called the colliniation sieve (developed in 2013 by Greg ...


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