Ring learning with errors key exchange: Difference between revisions

Revision as of 14:29, 11 July 2015

Revision as of 11:15, 12 July 2015

Line 68:

For 256 bits of security, n = 1024, q = 40961, and Φ(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. If we assume that the Gaussian parameter σ is 8/sqrt(2π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⁻⁷¹ for the 128-bit secure parameters and <u>less than</u> 2⁻⁹¹ for the 256-bit secure parameters.

== Key Exchange Security ==