DeepAI AI Chat
Log In Sign Up

The Asymptotic Complexity of Coded-BKW with Sieving Using Increasing Reduction Factors

01/19/2019
by   Erik Mårtensson, et al.
LUNDS TEKNISKA HÖGSKOLA
0

The Learning with Errors problem (LWE) is one of the main candidates for post-quantum cryptography. At Asiacrypt 2017, coded-BKW with sieving, an algorithm combining the Blum-Kalai-Wasserman algorithm (BKW) with lattice sieving techniques, was proposed. In this paper, we improve that algorithm by using different reduction factors in different steps of the sieving part of the algorithm. In the Regev setting, where q = n^2 and σ = n^1.5/(√(2π)_2^2 n), the asymptotic complexity is 2^0.8917n, improving the previously best complexity of 2^0.8951n. When a quantum computer is assumed or the number of samples is limited, we get a similar level of improvement.

READ FULL TEXT
05/12/2021

Lattice sieving via quantum random walks

Lattice-based cryptography is one of the leading proposals for post-quan...
10/23/2017

Learning With Errors and Extrapolated Dihedral Cosets

The hardness of the learning with errors (LWE) problem is one of the mos...
10/26/2020

Variance-Reduced Off-Policy TDC Learning: Non-Asymptotic Convergence Analysis

Variance reduction techniques have been successfully applied to temporal...
02/03/2021

On the Sample Complexity of solving LWE using BKW-Style Algorithms

The Learning with Errors (LWE) problem receives much attention in crypto...
05/10/2018

The Hidden Subgroup Problem and Post-quantum Group-based Cryptography

In this paper we discuss the Hidden Subgroup Problem (HSP) in relation t...
08/10/2019

Slide Reduction, Revisited---Filling the Gaps in SVP Approximation

We show how to generalize Gama and Nguyen's slide reduction algorithm [S...
01/23/2018

Post-Quantum Cryptography: Riemann Primitives and Chrysalis

The Chrysalis project is a proposed method for post-quantum cryptography...