Module learning with rounding based key agreement scheme with modified reconciliation

Abstract

In this paper, we propose a probably secure key agreement scheme based on module learning with rounding (MLWR) problem by modifying the reconciliation mechanism to obtain a shared key. In addition, compared with other schemes with the same properties, the error probability is relatively small. The detailed security analysis is provided against a passive adversary. Then, a modified software package is developed to generate a parameter set for any security level. Primal and dual attack costs are also computed. The main contribution of this paper is to construct a modified reconciliation mechanism and obtain agreed values with low error probability and bandwidth.