Ring learning with errors key exchange: Difference between revisions

Revision as of 15:42, 2 June 2015

Revision as of 15:45, 2 June 2015

Line 1:

{{AFC submission|||u=Carvalho1988|ns=118|ts=20150517232922}} <!-- Do not remove this line! -->

{{AFC comment|1=Like many mathematical articles on here, this seems far too technical for most Wikipedians to understand; I have a Masters degree in Maths, and can just about understand all of it. Also needs a lead section, per [[MOS:LEAD]]- maybe add some of the background content as a lead? [[User:Joseph2302|Joseph2302]] ([[User talk:Joseph2302|talk]]) 15:45, 2 June 2015 (UTC)}}

----

{{technical|date=June 2015}}

{{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 primarily based on a small number of [[public key]] algorithms. The security of these algorithms is based on a similarly small number of computationally hard problems in classical computing. These problems are the difficulty of [[Integer factorization|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 computing|quantum computer]]. If a [[quantum computer]] of sufficient size were built, all of the public key algorithms based on these three classically hard problems would become extremely insecure.

Line 73 ⟶ 79:

=== References ===

<references />

[[:Category:Cryptographic algorithms]]