The following pages link to (Q2757225):
Displaying 20 items.
- Non-standard approaches to integer programming (Q697562) (← links)
- New \(t\)-designs and large sets of \(t\)-designs (Q1292816) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- Solving the knapsack problem via \(\mathbb Z\)-transform (Q1870019) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- Search for combinatorial objects using lattice algorithms -- revisited (Q2115837) (← links)
- Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
- Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA (Q2152160) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Low-density attack revisited (Q2384011) (← links)
- Safer parameters for the Chor-Rivest cryptosystem (Q2389473) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- New Definition of Density on Knapsack Cryptosystems (Q3506377) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- Predicting Lattice Reduction (Q5458584) (← links)
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning (Q5738970) (← links)
- Non-injective knapsack public-key cryptosystems (Q5941079) (← links)
- Lattice-based cryptography: a survey (Q6183909) (← links)