CLASSICAL REDUCTION OF GAP SVP TO LWE: A CONCRETE SECURITY ANALYSIS

Article Type

Research Article

Publication Title

Advances in Mathematics of Communications

Abstract

Regev (2005) introduced the learning with errors (LWE) problem and showed a quantum reduction from a worst case lattice problem to LWE. Building on the work of Peikert (2009), a classical reduction from the gap shortest vector problem to LWE was obtained by Brakerski et al. (2013). A concrete security analysis of Regev’s reduction by Chatterjee et al. (2016) identified a huge tightness gap. The present work performs a concrete analysis of the tightness gap in the classical reduction of Brakerski et al. It turns out that the tightness gap in the Brakerski et al. classical reduction is even larger than the tightness gap in the quantum reduction of Regev. This casts doubts on the implication of the reduction to security assurance of practical cryptosystems.

First Page

484

Last Page

499

DOI

https://10.3934/amc.2021004

Publication Date

4-1-2023

Comments

Open Access, Gold

This document is currently not available here.

Share

COinS