Please use this identifier to cite or link to this item:
Title: Reduction algorithms for the cryptanalysis of lattice based asymmetrical cryptosystems
Authors: Koltuksuz, Ahmet Hasan
Beyazıt, Mutlu
Issue Date: 2008
Publisher: Izmir Institute of Technology
Abstract: 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.
Description: Thesis (Master)--Izmir Institute of Technology, Computer Engineering, Izmir, 2008
Includes bibliographical references (leaves: 79-91)
Text in English; Abstract: Turkish and English
xi, 119 leaves
Appears in Collections:Master Degree / Yüksek Lisans Tezleri

Files in This Item:
File Description SizeFormat 
T000719.pdfMasterThesis988.67 kBAdobe PDFThumbnail
Show full item record

CORE Recommender

Page view(s)

checked on Jun 19, 2023


checked on Jun 19, 2023

Google ScholarTM


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.