Ring learning with errors key exchange: Difference between revisions

Revision as of 16:46, 30 May 2016

Revision as of 05:18, 18 July 2016

Line 62:

== Parameter Choices ==

The RWLE-KEX exchange presented above worked in the Ring of Polynomials of degree n-1 or less mod a polynomial Φ(x). The presentation assumed that n was a power of 2 and that q was a prime which was congruent to 1 (mod 4). Following the guidance given in Peikert's paper, Singh suggested two sets of parameters for the RWLERLWE-KEX.

For 128 bits of security, n = 512, q = 25601, and Φ(x) = x⁵¹² + 1