The following pages link to (Q4266548):
Displaying 21 items.
- Approximate polynomial GCD over integers (Q651873) (← links)
- An effective branch-and-bound algorithm for convex quadratic integer programming (Q715081) (← links)
- An experimental comparison of some LLL-type lattice basis reduction algorithms (Q722627) (← links)
- Improved low-density subset sum algorithms (Q1207335) (← links)
- New \(t\)-designs and large sets of \(t\)-designs (Q1292816) (← links)
- Simultaneous reduction of a lattice basis and its reciprocal basis (Q1311020) (← links)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
- Second order statistical behavior of LLL and BKZ (Q1746949) (← links)
- Random lattices, threshold phenomena and efficient reduction algorithms. (Q1853481) (← links)
- On the success probability of solving unique SVP via BKZ (Q2061913) (← links)
- Search for combinatorial objects using lattice algorithms -- revisited (Q2115837) (← links)
- Gadget-based iNTRU lattice trapdoors (Q2152053) (← links)
- Computing the character table of a finite group. (Q2457372) (← links)
- Fast LLL-type lattice reduction (Q2490117) (← links)
- (Q4237669) (← links)
- Improved Rounding for Spline Coefficients and Knots (Q4305975) (← links)
- Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients (Q5034517) (← links)
- Non-injective knapsack public-key cryptosystems (Q5941079) (← links)
- Key recovery attack on the partial Vandermonde knapsack problem (Q6637720) (← links)
- Quantum lattice enumeration in limited depth (Q6652982) (← links)
- A complete analysis of the BKZ lattice reduction algorithm (Q6665548) (← links)
