Parameter Estimation for Lattice-Based Cryptosystems By Using Sieving Algorithms

Akleylek S., SATILMIŞ H.

4th International Conference on Computer Science and Engineering (UBMK), Samsun, Türkiye, 11 - 15 Eylül 2019, ss.372-377 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/ubmk.2019.8907018
  • Basıldığı Şehir: Samsun
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.372-377
  • Anahtar Kelimeler: sieving algorithms, lattice-based cryptography, SVP, parameter selection
  • Ondokuz Mayıs Üniversitesi Adresli: Evet

Özet

The security of quantum resistant lattice-based cryptosystems mainly depend on the shortest vector problem (SVP) or the closest vector problem (CVP). In this paper, sieving algorithms such as ListSieve, GaussSieve, ProGaussSieve and HashSieve are discussed and compared in terms of their complexity and capabilities. The algorithm of Becker et al., used in LIVE-Estimator software, is analyzed by considering HashSieve to generate reliable parameter sets. According to the experimental results, up to 81-bit security level, using HashSieve is comparable with other algorithms. It's shown that for low security levels small key sizes can be obtained.