A sieve algorithm based on overlattices
type: Item
instance of: scholarly article
title: A sieve algorithm based on overlattices
zbMATH Open document ID: 1296.11090
DOI: 10.1112/S1461157014000229
author: Anja Becker
author: Nicolas Gama
author: Antoine Joux
published in: LMS Journal of Computation and Mathematics
publication date: 2014-09-05T00:00:00Z
Mathematics Subject Classification ID: 11H99
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11N36
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6340487
zbMATH Keywords: overlattice
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: shortest vector
zbMATH Keywords: closest vector, quasi-orthonormal basis
MaRDI profile type: Publication
cites work: Higher-dimensional analogs of Hermite's constant
cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems
cites work: On Positive Definite Quadratic Forms
cites work: Sieve algorithms for the shortest vector problem are practical
cites work: Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
cites work: Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
cites work: Lattice Enumeration Using Extreme Pruning
cites work: Radon transforms and packings
cites work: Rankin’s Constant and Blockwise Lattice Reduction
cites work: Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
cites work: Improved Generic Algorithms for Hard Knapsacks
cites work: A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
cites work: A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
cites work: Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
cites work: Factoring polynomials with rational coefficients
cites work: Lattice reduction: a toolbox for the cryptoanalyst
description: scientific article; zbMATH DE number 6340487