Pages that link to "Item:Q887421"
From MaRDI portal
The following pages link to Finding shortest lattice vectors faster using quantum search (Q887421):
Displaying 17 items.
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- NTRU prime: reducing attack surface at low cost (Q1746970) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- A new post-quantum multivariate polynomial public key encapsulation algorithm (Q2102772) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Pseudorandom functions in NC class from the standard LWE assumption (Q2243895) (← links)
- Quantum binary search algorithm (Q2323771) (← links)
- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency (Q2334442) (← links)
- Estimation of the hardness of the learning with errors problem with a restricted number of samples (Q2415419) (← links)
- Estimating quantum speedups for lattice sieves (Q2692396) (← links)
- Improved classical and quantum algorithms for subset-sum (Q2692398) (← links)
- Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing (Q2946443) (← links)
- Finding shortest vector using quantum NV sieve on Grover (Q6547855) (← links)
- Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction (Q6584316) (← links)
- Further improvements of the estimation of key enumeration with applications to solving LWE (Q6643252) (← links)
- Estimates of implementation complexity for quantum cryptanalysis of post-quantum lattice-based cryptosystems (Q6644067) (← links)
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)
