Combining LWE-Solving Algorithms

Gjorgjevski, Dario (2017) Combining LWE-Solving Algorithms. In: PROCEEDINGS of the 14th Conference on Informatics and Information Technology. Faculty of Computer Science and Engineering, Ss. Cyril and Methodius University in Skopje, Macedonia, Skopje, Macedonia, pp. 165-170. ISBN 978-608-4699-07-1

[img]
Preview
Text
978-608-4699-07-1_pp165-170.pdf

Download (166kB) | Preview
Official URL: http://ciit.finki.ukim.mk

Abstract

The goal of this report is to provide a systematic study of LWE-solving algorithms and explore possibilities of combining and unifying current approaches. The irst focus is on the Arora–Ge modeling, which we view as giving rise to another LWE instance with a new error distribution. Then, we adapt the BKW algorithm and provide complexity results for that particular error distribution. At the end, we analyze a combination of two strategies of improving the BKW algorithm: lazy modulus switching and coding. An improvement in both the running time and the memory is obtained over the individual approaches.

Item Type: Book Section
Subjects: International Conference on Informatics and Information Technologies > Students Session
Depositing User: Vangel Ajanovski
Date Deposited: 29 Nov 2017 18:30
Last Modified: 29 Nov 2017 18:30
URI: http://eprints.finki.ukim.mk/id/eprint/11397

Actions (login required)

View Item View Item