Ring learning with errors key exchange: Difference between revisions

Revision as of 23:20, 17 May 2015

Revision as of 23:29, 17 May 2015

Line 1:

{{AFC submission|||ts=20150517232922|u=Carvalho1988|ns=118}}

=== Background ===

Since the 1980's the security of cryptographic [[key exchange]]<nowiki/>s and [[digital signature]]<nowiki/>s over the internet has been based on a small number of [[public key]] algorithms. The security of these algorithms is based on a small number of computationally hard problems in classical computing. These problems are the difficulty of [[factoring]] the product of two carefully chosen prime numbers, the difficulty to compute [[discrete logarithms]] in a carefully chosen finite field, and the difficulty of computing discrete logarithms in a carefully chosen [[elliptic curve]] group. These problems are very difficult to solve on a classical computer but are rather easily solved by a relatively small quantum computer. If a [[quantum computer]] of sufficient size were build, all of the public key algorithms based on these classically hard problems would become extremely insecure.