Module learning with rounding based key agreement scheme with modified reconciliation

Akleylek S., Seyhan K.

COMPUTER STANDARDS & INTERFACES, cilt.79, 2022 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 79
  • Basım Tarihi: 2022
  • Doi Numarası: 10.1016/j.csi.2021.103549
  • Dergi Adı: COMPUTER STANDARDS & INTERFACES
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Aerospace Database, Applied Science & Technology Source, Communication Abstracts, Computer & Applied Sciences, INSPEC, Linguistic Bibliography, Metadex, Civil Engineering Abstracts
  • Anahtar Kelimeler: Lattice-based cryptography, Key agreement, MLWR problem, Reconciliation, EXCHANGE
  • Ondokuz Mayıs Üniversitesi Adresli: Evet

Özet

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.