Pages that link to "Item:Q937206"

The following pages link to Limits on the hardness of lattice problems in \(\ell_{p}\) norms (Q937206):

Displaying 19 items.

• New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors (Q393183) (← links)
• On the hardness of module-LWE with binary secret (Q826282) (← links)
• A polynomial time algorithm for GapCVPP in \(l_1\) norm (Q893692) (← links)
• Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
• STP-LWE: A variant of learning with error for a flexible encryption (Q1718158) (← links)
• Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
• On the smoothing parameter and last minimum of random orthogonal lattices (Q2182065) (← links)
• On a certain class of positive definite functions and measures on locally compact abelian groups and inner-product spaces (Q2243155) (← links)
• Worst-case to average-case reductions for module lattices (Q2345928) (← links)
• The remote set problem on lattices (Q2353188) (← links)
• On the hardness of module learning with errors with short distributions (Q2677644) (← links)
• The Reductions for the Approximating Covering Radius Problem (Q3297478) (← links)
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (Q3600386) (← links)
• PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model (Q5041165) (← links)
• A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic (Q5091762) (← links)
• Mixing time and eigenvalues of the abelian sandpile Markov chain (Q5243105) (← links)
• Provably Secure NTRU Instances over Prime Cyclotomic Rings (Q5738796) (← links)
• On lattice constructions \(D\) and \(D^\prime\) from \(q\)-ary linear codes (Q6594646) (← links)
• On Gaussian sampling, smoothing parameter and application to signatures (Q6595917) (← links)