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 47 items.
- 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)
- On the Bit Security of Elliptic Curve Diffie–Hellman (Q5738794) (← links)
- Revisiting Lattice Attacks on Overstretched NTRU Parameters (Q5738868) (← links)
- Short Stickelberger Class Relations and Application to Ideal-SVP (Q5738882) (← links)
- Hermite reduction and a Waring’s problem for integral quadratic forms over number fields (Q5853497) (← links)
- Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
- Expanders with respect to Hadamard spaces and random graphs (Q5892453) (← links)
- Limits of local algorithms over sparse random graphs (Q5892454) (← links)
- Deterministic compression with uncertain priors (Q5892455) (← links)
- The truth behind the myth of the folk theorem (Q5892456) (← links)
- Improvements in the analysis of Kannan's CVP algorithm (Q5964026) (← links)
- NTRU Fatigue: How Stretched is Overstretched? (Q6045070) (← links)
- Homomorphic encryption: a mathematical survey (Q6118172) (← links)
- Subfield attacks on HSVP in ideal lattices (Q6134036) (← links)
- Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP (Q6135454) (← links)
- On module unique-SVP and NTRU (Q6135456) (← links)
- On the hardness of the NTRU problem (Q6157484) (← links)
- A sharper lower bound on Rankin's constant (Q6161436) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
- Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2 (Q6489782) (← links)
- Minimizing convex functions with rational minimizers (Q6567265) (← links)
- On the properties of reduced basis related to lattice-reduced algorithm (Q6585461) (← links)
- On the probability of generating a primitive matrix (Q6595060) (← links)
- Concrete analysis of quantum lattice enumeration (Q6595811) (← links)
- Too many hints -- when LLL breaks LWE (Q6604869) (← links)
- Provable dual attacks on learning with errors (Q6637724) (← links)
- Further improvements of the estimation of key enumeration with applications to solving LWE (Q6643252) (← links)
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)
- An algebraic algorithm for breaking NTRU with multiple keys (Q6651896) (← links)
- Functional commitments for arbitrary circuits of bounded sizes (Q6651898) (← links)
- A systematic study of sparse LWE (Q6652897) (← links)
- On the quantum security of high-dimensional RSA protocol (Q6657369) (← links)
- A complete analysis of the BKZ lattice reduction algorithm (Q6665548) (← links)
- On the smallest ratio problem of lattice bases (Q6666549) (← links)
