Ring learning with errors key exchange: Difference between revisions

Revision as of 14:17, 30 April 2020

Revision as of 05:57, 11 June 2020

Line 77:

== Parameter choices ==

The RWLERLWE-KEX exchange presented above worked in the Ring of Polynomials of degree ''n''&nbsp;−&nbsp;1 or less mod a polynomial <math>\Phi(x)</math>. The presentation assumed that n was a power of 2 and that q was a prime which was congruent to 1 (mod 2n). Following the guidance given in Peikert's paper, Singh suggested two sets of parameters for the RLWE-KEX.

For 128 bits of security, ''n'' = 512, ''q'' = 25601, and <math>\Phi(x) = x^{512} + 1</math>