Pages that link to "Item:Q1101500"
From MaRDI portal
The following pages link to A hierarchy of polynomial time lattice basis reduction algorithms (Q1101500):
Displayed 50 items.
- Mechanism design in large games (Q2988894) (← links)
- Redrawing the boundaries on purchasing data from privacy-sensitive individuals (Q2988895) (← links)
- Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems (Q2988896) (← links)
- Complexity of approximating CSP with balance / hard constraints (Q2988897) (← links)
- Integer feasibility of random polytopes (Q2988898) (← links)
- Multireference alignment using semidefinite programming (Q2988900) (← links)
- Partial tests, universal tests and decomposability (Q2988902) (← links)
- High dimensional expanders and property testing (Q2988903) (← links)
- Parameterized testability (Q2988904) (← links)
- Direct sum fails for zero error average communication (Q2988905) (← links)
- Rational arguments (Q2988906) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász (Q3033847) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices (Q3078387) (← links)
- Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093) (← links)
- Targeted Homomorphic Attribute-Based Encryption (Q3181032) (← links)
- Lattice-Based Fault Attacks Against ECMQV (Q3297553) (← links)
- On a quadratic Waring's problem with congruence conditions (Q3298853) (← links)
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes (Q3452347) (← links)
- Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization (Q3454586) (← links)
- Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm (Q3454866) (← links)
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing (Q3457102) (← links)
- Algebraic Cryptanalysis of CTRU Cryptosystem (Q3511333) (← links)
- Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
- Sieve algorithms for the shortest vector problem are practical (Q3537523) (← links)
- Bounding the sum of square roots via lattice reduction (Q3584821) (← links)
- Symplectic Lattice Reduction and NTRU (Q3593099) (← links)
- Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
- Improved Rounding for Spline Coefficients and Knots (Q4305975) (← links)
- Block Reduced Lattice Bases and Successive Minima (Q4325334) (← links)
- Thrackles: An Improved Upper Bound (Q4625109) (← links)
- On a Waring’s problem for integral quadratic and Hermitian forms (Q4633597) (← links)
- Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation (Q4806399) (← links)
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge (Q4964363) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Meta-heuristic approaches to solve shortest lattice vector problem (Q5035010) (← links)
- Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
- A Tale of Three Signatures: Practical Attack of ECDSA with wNAF (Q5048983) (← links)
- On the Security of OSIDH (Q5087250) (← links)
- A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic (Q5091762) (← links)
- Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem (Q5095931) (← links)
- Lattice Reformulation Cuts (Q5162650) (← links)
- Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
- LLL: A Tool for Effective Diophantine Approximation (Q5188542) (← links)
- The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance (Q5188548) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)
- Predicting Lattice Reduction (Q5458584) (← links)