Pages that link to "Item:Q2819600"

The following pages link to On the complexity of computing short linearly independent vectors and short bases in a lattice (Q2819600):

Displaying 13 items.

• New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors (Q393183) (← links)
• Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
• A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. (Q1589481) (← links)
• On basing search SIVP on \(\mathbf{NP}\)-hardness (Q1629401) (← links)
• Worst-case to average-case reductions for module lattices (Q2345928) (← links)
• Fast LLL-type lattice reduction (Q2490117) (← links)
• A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
• Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle (Q3088093) (← links)
• The Geometry of Lattice Cryptography (Q3092183) (← links)
• The Reductions for the Approximating Covering Radius Problem (Q3297478) (← links)
• Lattice-Based Identification Schemes Secure Under Active Attacks (Q5445452) (← links)
• Sieve algorithms for some orthogonal integer lattices (Q6059067) (← links)
• \(\mathrm{mR}_{\mathrm{LWE}}\)-CP-ABE: a revocable CP-ABE for post-quantum cryptography (Q6193390) (← links)