[singletoon]

This is no news for the academia, more particularly for theoretical mathematicians. It's a well known fact that RSA and all other cryptography methods based on basic number theory results, will become useless with the appropriate usage of QC. Mathematicians have already suggested that non-commutative group-based cryptography is the appropriate solution to this issue. Yet, there's no ideal group that seems to be the right fit, for the proper implementation of these new, secure algorithms. The braids group used to be an ideal example, until it was found to be linear, thus heavily exposed to linear-based type of attacks. So, the only part that remains unsolved is which group could be ideally defined to support the theory that addresses this issue. Mathematicians are already aware of this challenge, perhaps this post by The Economist suggests that more funding should be given for the according research.