Ring learning with errors key exchange: Difference between revisions

Revision as of 00:07, 29 May 2015

Revision as of 18:09, 29 May 2015

Line 57:

For 256 bits of security, n = 1024, q = 40961, and F(x) = x¹⁰²⁴ + 1

Because the key exchange uses random sampling and fixed bounds there is a small probability that the key exchange will fail to produce the same key for the initiator and responder. This is generally referred to as the soundness of the If we assume that the gaussian parameter σ is 8/sqrt(2π) and the uniform sampling bound (b) = 5(see Singh)<ref name=":1" />, then the probability of key agreement failure is <u>'''less than'''</u> '''2^-71 for the 128-bit secure parameters and 2^-91 for the 256-bit secure parameters'''.

=== Key Exchange Security ===