scientific article; zbMATH DE number 7561389
From MaRDI portal
Publication:5091027
DOI10.4230/LIPIcs.ISAAC.2018.35MaRDI QIDQ5091027
Priyanka Mukhopadhyay, Divesh Aggarwal
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1801.02358
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! ⋮ On the Security of OSIDH ⋮ Approximate CVP\(_p\) in time \(2^{0.802n}\)
Cites Work
- Unnamed Item
- Sampling methods for shortest vectors, closest vectors and successive minima
- On Lovász' lattice reduction and the nearest lattice point problem
- Factoring polynomials with rational coefficients
- Improved low-density subset sum algorithms
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
- Finding Shortest Lattice Vectors in the Presence of Gaps
- A Decade of Lattice Cryptography
- A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
- Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
- Integer Programming with a Fixed Number of Variables
- Some Sieving Algorithms for Lattice Problems
- Sieve algorithms for the shortest vector problem are practical
- Minkowski's Convex Body Theorem and Integer Programming
- New directions in nearest neighbor searching with applications to lattice sieving
- A sieve algorithm for the shortest lattice vector problem
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP)
- Covering cubes and the closest vector problem
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication:
