Pages that link to "Item:Q1076512"

The following pages link to On Lovász' lattice reduction and the nearest lattice point problem (Q1076512):

Displayed 50 items.

• A survey of VLSI implementations of tree search algorithms for MIMO detection (Q318217) ‎ (← links)
• The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves (Q321311) ‎ (← links)
• Improvements in closest point search based on dual HKZ-bases (Q391764) ‎ (← links)
• A randomized sieving algorithm for approximate integer programming (Q486990) ‎ (← links)
• Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices (Q537960) ‎ (← links)
• On the complexity of cutting-plane proofs (Q580175) ‎ (← links)
• On finite-precision representations of geometric objects (Q584309) ‎ (← links)
• Lattice-basis reduction precoding based on successive interference cancellation design for multiuser MIMO downlink system (Q615272) ‎ (← links)
• Cryptanalysis of the GGH cryptosystem (Q626951) ‎ (← links)
• Lattice polly cracker cryptosystems (Q633081) ‎ (← links)
• Simplicial volume and fillings of hyperbolic manifolds (Q640310) ‎ (← links)
• Parallel Cholesky-based reduction for the weighted integer least squares problem (Q727439) ‎ (← links)
• Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice (Q757465) ‎ (← links)
• On the minimum order of graphs with given semigroup (Q793058) ‎ (← links)
• Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) ‎ (← links)
• Column basis reduction and decomposable knapsack problems (Q834182) ‎ (← links)
• Probability method for cryptanalysis of general multivariate modular linear equation (Q848370) ‎ (← links)
• Gaussian sampling of lattices for cryptographic applications (Q893724) ‎ (← links)
• Jug measuring: algorithms and complexity (Q924133) ‎ (← links)
• Lattice-based treshold-changeability for standard CRT secret-sharing schemes (Q998654) ‎ (← links)
• Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) ‎ (← links)
• Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) ‎ (← links)
• Generalized symmetry of graphs - a survey (Q1044907) ‎ (← links)
• Algorithms to construct Minkowski reduced and Hermite reduced lattice bases (Q1081304) ‎ (← links)
• Dual vectors and lower bounds for the nearest lattice point problem (Q1107568) ‎ (← links)
• Simultaneously good bases of a lattice and its reciprocal lattice (Q1119682) ‎ (← links)
• A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) ‎ (← links)
• New bounds in some transference theorems in the geometry of numbers (Q1318081) ‎ (← links)
• The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) ‎ (← links)
• Diophantine approximation of matrices (Q1359157) ‎ (← links)
• Symmetry groups of Boolean functions and constructions of permutation groups (Q1378434) ‎ (← links)
• Automorphism groups and isomorphisms of Cayley digraphs (Q1379988) ‎ (← links)
• Geometry of the Kronecker sequence (Q1382625) ‎ (← links)
• The optimal LLL algorithm is still polynomial in fixed dimension. (Q1401288) ‎ (← links)
• On the limits of nonapproximability of lattice problems (Q1577010) ‎ (← links)
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) ‎ (← links)
• Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard (Q1608337) ‎ (← links)
• Cryptanalysis of a public key cryptosystem based on Diophantine equations via weighted LLL reduction (Q1630230) ‎ (← links)
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) ‎ (← links)
• Shortest vector from lattice sieving: a few dimensions for free (Q1648783) ‎ (← links)
• The closest vector problem in tensored root lattices of type A and in their duals (Q1692156) ‎ (← links)
• Lattice attacks against elliptic-curve signatures with blinded scalar multiplication (Q1698621) ‎ (← links)
• A public-key encryption scheme based on non-linear indeterminate equations (Q1746969) ‎ (← links)
• Security analysis of cryptosystems using short generators over ideal lattices (Q1756730) ‎ (← links)
• Solving market split problems with heuristical lattice reduction (Q1761840) ‎ (← links)
• Cutting-plane proofs in polynomial space (Q1813835) ‎ (← links)
• Automorphism groups of graphs with 1-factorizations (Q1815305) ‎ (← links)
• A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) ‎ (← links)
• Cubic \((m,n)\)-metacirculant graphs which are not Cayley graphs (Q1918554) ‎ (← links)
• LLL-reduction for integer knapsacks (Q1928499) ‎ (← links)