Ring learning with errors key exchange: Difference between revisions

Revision as of 19:16, 9 September 2015

Revision as of 18:10, 10 November 2015

Line 1:

{{technical|date=June 2015}}

In [[cryptography]], a [[key exchange|public key exchange]] is a [[cryptographic algorithm]] which allows two parties to create and share a secret key which they 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 all of the [[public key algorithm]]s in use today are easily broken by a quantum computer and scientists are making steady progress toward creating such a computer. The [[Ring Learning with Errors|RLWE]]-KEX is one of a set of [[Post-quantum cryptography|Post Quantum cryptographic]] algorithms being which are based on the difficulty of solving mathematical 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 ==