Ring learning with errors key exchange: Difference between revisions

Revision as of 21:20, 22 December 2020

Revision as of 19:38, 26 January 2021

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 some [[public key algorithm]]s in use today will be easily broken by a quantum computer if and when such computers are implemented. [[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 ==