scientific article; zbMATH DE number 6297802
From MaRDI portal
Publication:5417723
zbMath1288.94076MaRDI QIDQ5417723
Daniele Micciancio, Panagiotis Voulgaris
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (41)
Lower bounds on lattice sieving and information set decoding ⋮ Sieve, Enumerate, Slice, and Lift: ⋮ Shortest vector from lattice sieving: a few dimensions for free ⋮ Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! ⋮ Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing ⋮ Lattice Point Enumeration on Block Reduced Bases ⋮ Finding shortest lattice vectors faster using quantum search ⋮ Predicting the concrete security of LWE against the dual attack using binary search ⋮ Lattice Sieving via Quantum Random Walks ⋮ On the number of lattice points in a small sphere and a recursive lattice decoding algorithm ⋮ Sieve algorithms for some orthogonal integer lattices ⋮ Tight bounds on the expected number of holes in random point sets ⋮ Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice ⋮ The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings ⋮ Does the dual-sieve attack on learning with errors even work? ⋮ Cryptanalysis of a quadratic compact knapsack public-key cryptosystem ⋮ Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems ⋮ Sieving for closest lattice vectors (with preprocessing) ⋮ A lattice reduction algorithm based on sublattice BKZ ⋮ The irreducible vectors of a lattice: some theory and applications ⋮ Gauss Sieve Algorithm on GPUs ⋮ Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Approximate CVP_p in Time 2^{0.802 n} ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ Unnamed Item ⋮ Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems ⋮ Improved Algorithms for the Approximate k-List Problem in Euclidean Norm ⋮ Revisiting Lattice Attacks on Overstretched NTRU Parameters ⋮ Finding Shortest Lattice Vectors in the Presence of Gaps ⋮ Approximate Voronoi cells for lattices, revisited ⋮ Learning strikes again: the case of the DRS signature scheme ⋮ Improvements in the analysis of Kannan's CVP algorithm ⋮ Better Key Sizes (and Attacks) for LWE-Based Encryption ⋮ Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices ⋮ A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge ⋮ Approximate CVP\(_p\) in time \(2^{0.802n}\) ⋮ On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem ⋮ Advanced lattice sieving on GPUs, with tensor cores ⋮ Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes ⋮ A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
Uses Software
This page was built for publication:
