Evolutionary techniques in lattice sieving algorithms

07/10/2019
by   Thijs Laarhoven, et al.
0

Lattice-based cryptography has recently emerged as a prominent candidate for secure communication in the quantum age. Its security relies on the hardness of certain lattice problems, and the inability of known lattice algorithms, such as lattice sieving, to solve these problems efficiently. In this paper we investigate the similarities between lattice sieving and evolutionary algorithms, how various improvements to lattice sieving can be viewed as applications of known techniques from evolutionary computation, and how other evolutionary techniques can benefit lattice sieving in practice.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2021

Lattice sieving via quantum random walks

Lattice-based cryptography is one of the leading proposals for post-quan...
research
04/25/2023

LAST: Scalable Lattice-Based Speech Modelling in JAX

We introduce LAST, a LAttice-based Speech Transducer library in JAX. Wit...
research
09/29/2022

Fully Lattice Linear Algorithms

This paper focuses on analyzing and differentiating between lattice line...
research
12/04/2018

Searching for an analogue of ATR in the Weihrauch lattice

There are close similarities between the Weihrauch lattice and the zoo o...
research
02/17/2021

Automatic Generation of Interpolants for Lattice Samplings: Part I – Theory and Analysis

Interpolation is a fundamental technique in scientific computing and is ...
research
05/11/2022

Compact and Efficient NTRU-based KEM with Scalable Ciphertext Compression

The NTRU lattice is a promising candidate to construct practical cryptos...
research
04/17/2022

PiouCrypt: Decentralized Lattice-based Method for Visual Symmetric Cryptography

In recent years, establishing secure visual communications has turned in...

Please sign up or login with your details

Forgot password? Click here to reset