Ring learning with errors key exchange: Difference between revisions

Content deleted Content added
corrected small mistake in introduction, in the polynomial expression, x_{n-2} x^{n-2} should be a_{n-2} x^{n-2}. i.e. the coefficients are a and the variable of the polynomials are x
Prodx3 (talk | contribs)
m Made more precise statement
Line 1:
{{technical|date=June 2015}}
 
In [[cryptography]], a [[key exchange|public key exchange]] algorithm is a [[cryptographic algorithm]] which allows two parties to create and share a secret key, which they can use to encrypt messages between themselves. The '''[[ring learning with errors]] key exchange''' ('''RLWE-KEX''') is one of a new class of public key exchange algorithms that are designed to be secure against an adversary that possesses a [[quantum computer]]. This is important because the vast majority ofsome [[public key algorithm]]s in use today arewill be easily broken by a quantum computer if and scientistswhen aresuch makingcomputers steadyare progress toward creating such a computerimplemented. [[Ring learning with errors|RLWE]]-KEX is one of a set of [[post-quantum cryptography|post-quantum cryptographic]] algorithms which are based on the difficulty of solving certain mathematical problems involving [[lattice-based cryptography|lattices]]. Unlike older lattice based cryptographic algorithms, the [[ring learning with errors|RLWE]]-KEX is provably reducible to a known hard problem in lattices.
 
== Background ==