Pages that link to "Item:Q3546301"

The following pages link to Hardness of approximating the shortest vector problem in lattices (Q3546301):

Displaying 28 items.

• Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
• Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
• Vulnerable public keys in NTRU cryptosystem (Q1997177) (← links)
• Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858) (← links)
• Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
• Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
• The projection games conjecture and the hardness of approximation of Super-SAT and related problems (Q2237900) (← links)
• Restricted parameter range promise set cover problems are easy (Q2258109) (← links)
• The remote set problem on lattices (Q2353188) (← links)
• Post-quantum cryptography: lattice signatures (Q2390954) (← links)
• Improved analysis of the reduction from BDD to uSVP (Q2419802) (← links)
• Improved hardness results for unique shortest vector problem (Q2629774) (← links)
• Revisiting lower dimension lattice attacks on NTRU (Q2681396) (← links)
• Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
• (Q2913823) (← links)
• Lattice Point Enumeration on Block Reduced Bases (Q2947536) (← links)
• Quantum algorithms for algebraic problems (Q3077033) (← links)
• Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093) (← links)
• The Geometry of Lattice Cryptography (Q3092183) (← links)
• Three Problems on Exponential Bases (Q3121314) (← links)
• Bounding the sum of square roots via lattice reduction (Q3584821) (← links)
• Identification and signatures based on NP-hard problems of indefinite quadratic forms (Q3612243) (← links)
• Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH (Q5002683) (← links)
• Hardness of bounded distance decoding on lattices in lp norms (Q5092487) (← links)
• Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
• Cryptography Based on Quadratic Forms: Complexity Considerations (Q5504549) (← links)
• Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
• Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)