Reduction algorithms for the cryptanalysis of lattice based asymmetrical cryptosystems
Beyazıt, Mutlu.

Reduction algorithms for the cryptanalysis of lattice based asymmetrical cryptosystems

Beyazıt, Mutlu.

Yazar Ek Girişi
Beyazıt, Mutlu.

Yayın Bilgileri
[s.l.]: [s.n.], 2008.

Fiziksel Tanımlama
xi, 119 leaves.: ill. + 1 computer laser optical disc.

The theory of lattices has attracted a great deal of attention in cryptology in recent years. Several cryptosystems are constructed based on the hardness of the lattice problems such as the shortest vector problem and the closest vector problem. The aim of this thesis is to study the most commonly used lattice basis reduction algorithms, namely Lenstra Lenstra Lovasz (LLL) and Block Kolmogorov Zolotarev (BKZ) algorithms, which are utilized to approximately solve the mentioned lattice based problems.Furthermore, the most popular variants of these algorithms in practice are evaluated experimentally by varying the common reduction parameter delta in order to propose some practical assessments about the effect of this parameter on the process of basis reduction.These kind of practical assessments are believed to have non-negligible impact on the theory of lattice reduction, and so the cryptanalysis of lattice cryptosystems, due to thefact that the contemporary nature of the reduction process is mainly controlled by theheuristics.

Konu Başlığı
Lattice theory.

Yazar Ek Girişi
Koltuksuz, Ahmet.

Tüzel Kişi Ek Girişi
İzmir Institute of Technology. Computer Engineering.

Tek Biçim Eser Adı
Thesis (Master)--İzmir Institute of Technology:Computer Engineering.
İzmir Institute of Technology:Computer Engineering--Thesis (Master).

Elektronik Erişim
Access to Electronic Version.

LibraryMateryal TürüDemirbaş NumarasıYer Numarası
IYTE LibraryTezT000719QA171.5 .B573 2008