Pages that link to "Item:Q1101500"
From MaRDI portal
The following pages link to A hierarchy of polynomial time lattice basis reduction algorithms (Q1101500):
Displaying 50 items.
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Self-dual DeepBKZ for finding short lattice vectors (Q2191205) (← links)
- Characterizing overstretched NTRU attacks (Q2191207) (← links)
- A polynomial algorithm for minimizing discrete convic functions in fixed dimension (Q2192061) (← links)
- Sparse recovery with integrality constraints (Q2192094) (← links)
- On post-processing in the quantum algorithm for computing short discrete logarithms (Q2205884) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Non-planar universal anomalous dimension of twist-two operators with general Lorentz spin at four loops in \(\mathcal{N} = 4\) SYM theory (Q2233733) (← links)
- Pseudorandom functions in NC class from the standard LWE assumption (Q2243895) (← links)
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
- The remote set problem on lattices (Q2353188) (← links)
- Bounding basis reduction properties (Q2364641) (← links)
- Lattices with symmetry (Q2408587) (← links)
- Solving low-density multiple subset sum problems with SVP oracle (Q2416533) (← links)
- Fast LLL-type lattice reduction (Q2490117) (← links)
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259) (← links)
- Subexponential time relations in the class group of large degree number fields (Q2513760) (← links)
- Sharper bounds on four lattice constants (Q2672303) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
- Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices (Q2692387) (← links)
- Security of the most significant bits of the Shamir message passing scheme (Q2759102) (← links)
- Decompositions of triangle-dense graphs (Q2796209) (← links)
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security (Q2829953) (← links)
- A Subfield Lattice Attack on Overstretched NTRU Assumptions (Q2835586) (← links)
- Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts (Q2835588) (← links)
- Slide reduction, successive minima and several~applications (Q2872006) (← links)
- Approximating the densest sublattice from Rankin's inequality (Q2878829) (← links)
- Subexponential class group and unit group computation in large degree number fields (Q2878849) (← links)
- A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors (Q2942829) (← links)
- Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing (Q2946443) (← links)
- Lattice Point Enumeration on Block Reduced Bases (Q2947536) (← links)
- Lattice-based FHE as secure as PKE (Q2988863) (← links)
- Cryptogenography (Q2988864) (← links)
- Limits of random oracles in secure computation (Q2988865) (← links)
- Non-commutative arithmetic circuits with division (Q2988867) (← links)
- Decision trees, protocols and the entropy-influence conjecture (Q2988868) (← links)
- Locally testable codes and cayley graphs (Q2988869) (← links)
- Invitation games and the price of stability (Q2988870) (← links)
- Welfare maximization and truthfulness in mechanism design with ordinal preferences (Q2988871) (← links)
- Coordination mechanisms from (almost) all scheduling policies (Q2988872) (← links)
- Private interactive communication across an adversarial channel (Q2988873) (← links)
- Tree codes and a conjecture on exponential sums (Q2988874) (← links)
- Capacity of non-malleable codes (Q2988875) (← links)
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications (Q2988877) (← links)
- Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements (Q2988878) (← links)
- Sequential decision making with vector outcomes (Q2988880) (← links)
- Learning mixtures of arbitrary distributions over large discrete domains (Q2988881) (← links)
- Why do simple algorithms for triangle enumeration work in the real world? (Q2988883) (← links)
- Black-box obfuscation for d-CNFs (Q2988884) (← links)
- Candidate weak pseudorandom functions in AC <sup>0</sup> ○ MOD <sub>2</sub> (Q2988885) (← links)
