Pages that link to "Item:Q1340057"
From MaRDI portal
The following pages link to Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057):
Displaying 50 items.
- On random nonsingular Hermite normal form (Q266588) (← links)
- Homomorphic AES evaluation using the modified LTV scheme (Q310240) (← links)
- A survey of VLSI implementations of tree search algorithms for MIMO detection (Q318217) (← links)
- A semantically secure public key cryptoscheme using bit-pair shadows (Q344780) (← links)
- PotLLL: a polynomial time version of LLL with deep insertions (Q398939) (← links)
- A public key cryptosystem based on three new provable problems (Q418738) (← links)
- Another 80-dimensional extremal lattice (Q449686) (← links)
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors (Q515394) (← links)
- Topics in computational algebraic number theory (Q558179) (← links)
- Approximate polynomial GCD over integers (Q651873) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Factoring polynomials and the knapsack problem (Q701105) (← links)
- Parallel Cholesky-based reduction for the weighted integer least squares problem (Q727439) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- Probability method for cryptanalysis of general multivariate modular linear equation (Q848370) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Reduced complexity \(K\) -best sphere decoder design for MIMO systems (Q1035267) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- On the ring-LWE and polynomial-LWE problems (Q1648786) (← links)
- A non-commutative cryptosystem based on quaternion algebras (Q1671643) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- Comment on: ``Sum of squares of uniform random variables'' by I. Weissman (Q1726716) (← links)
- On the optimality of lattices for the Coppersmith technique (Q1745898) (← links)
- A public-key encryption scheme based on non-linear indeterminate equations (Q1746969) (← links)
- A semidefinite programming method for integer convex quadratic minimization (Q1749779) (← links)
- Solving market split problems with heuristical lattice reduction (Q1761840) (← links)
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme (Q1784985) (← links)
- Dynamic trading under integer constraints (Q1788825) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- Analysis of DeepBKZ reduction for finding short lattice vectors (Q2004968) (← links)
- Quantum algorithms for computing general discrete logarithms and orders with tradeoffs (Q2048182) (← links)
- (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes (Q2055644) (← links)
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP (Q2056696) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
- Advanced lattice sieving on GPUs, with tensor cores (Q2056731) (← links)
- The convergence of slide-type reductions (Q2061912) (← links)
- On the success probability of solving unique SVP via BKZ (Q2061913) (← links)
- Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521) (← links)
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP (Q2096523) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- Improved lattice enumeration algorithms by primal and dual reordering methods (Q2104429) (← links)
- A physical study of the LLL algorithm (Q2112788) (← links)
- A practical algorithm for completing half-Hadamard matrices using LLL (Q2114786) (← links)
- Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873) (← links)
- Quantum security analysis of CSIDH (Q2119022) (← links)
