scientific article; zbMATH DE number 1775383
From MaRDI portal
Publication:4542515
zbMath1027.68609MaRDI QIDQ4542515
Publication date: 17 September 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (77)
Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance ⋮ The inapproximability of lattice and coding problems with preprocessing ⋮ Magnifying computing gaps. Establishing encrypted communication over unidirectional channels ⋮ Planckian axions and the weak gravity conjecture ⋮ FPT Suspects and Tough Customers: Open Problems of Downey and Fellows ⋮ An efficient lattice reduction using reuse technique blockwisely on NTRU ⋮ On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes ⋮ Counting lattice vectors ⋮ Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! ⋮ Ciphertext-only attacks against compact-LWE submitted to NIST PQC project ⋮ Segment LLL reduction of lattice bases using modular arithmetic ⋮ A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors ⋮ Practical strategies for generating rank-1 split cuts in mixed-integer linear programming ⋮ Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing ⋮ Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem ⋮ Finding shortest lattice vectors faster using quantum search ⋮ Lattice Sieving via Quantum Random Walks ⋮ Revisiting lower dimension lattice attacks on NTRU ⋮ New orthogonality criterion for shortest vector of lattices and its applications ⋮ Finding points on elliptic curves with Coppersmith's method ⋮ New Definition of Density on Knapsack Cryptosystems ⋮ The optimal LLL algorithm is still polynomial in fixed dimension. ⋮ Lattice Identification and Separation: Theory and Algorithm ⋮ Improved broadcast attacks against subset sum problems via lattice oracle ⋮ Cryptanalysis of the GGH cryptosystem ⋮ Improving convergence and practicality of slide-type reductions ⋮ Gradual sub-lattice reduction and a new complexity for factoring polynomials ⋮ On fluxes in the \(1^9\) Landau-Ginzburg model ⋮ Lattice-based cryptography: a survey ⋮ Mathematics of computation through the lens of linear equations and lattices ⋮ Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions ⋮ Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) ⋮ Improved strategies for branching on general disjunctions ⋮ Thrackles: An Improved Upper Bound ⋮ A Parametric Version of LLL and Some Consequences: Parametric Shortest and Closest Vector Problems ⋮ Lower bounds of shortest vector lengths in random NTRU lattices ⋮ Parameterized and approximation complexity of \textsc{Partial VC Dimension} ⋮ A Lattice Attack on Homomorphic NTRU with Non-invertible Public Keys ⋮ Approximate CVP_p in Time 2^{0.802 n} ⋮ Minimal condition for shortest vectors in lattices of low dimension ⋮ The projection games conjecture and the hardness of approximation of Super-SAT and related problems ⋮ Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction ⋮ Unnamed Item ⋮ Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors ⋮ \((2,2)\) superconformal bootstrap in two dimensions ⋮ Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\) ⋮ Vulnerable public keys in NTRU cryptosystem ⋮ Non-standard approaches to integer programming ⋮ Restricted parameter range promise set cover problems are easy ⋮ Detecting squarefree numbers ⋮ Unnamed Item ⋮ Fast LLL-type lattice reduction ⋮ Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms ⋮ On the unique shortest lattice vector problem ⋮ Hermite’s Constant and Lattice Algorithms ⋮ Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits ⋮ Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme ⋮ Lattice-Based Identification Schemes Secure Under Active Attacks ⋮ A Digital Signature Scheme Based on CVP ∞ ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem ⋮ Sampling methods for shortest vectors, closest vectors and successive minima ⋮ Approximate CVP\(_p\) in time \(2^{0.802n}\) ⋮ Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle ⋮ Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes ⋮ The Geometry of Lattice Cryptography ⋮ A relation of primal--dual lattices and the complexity of shortest lattice vector problem ⋮ Hardness of bounded distance decoding on lattices in lp norms ⋮ Algorithmically solving the tadpole problem ⋮ On the limits of nonapproximability of lattice problems ⋮ A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. ⋮ On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) ⋮ Unnamed Item ⋮ Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces ⋮ Random lattices, threshold phenomena and efficient reduction algorithms. ⋮ A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor ⋮ Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
This page was built for publication:
