Pages that link to "Item:Q6045073"
From MaRDI portal
The following pages link to Lattice Sieving via Quantum Random Walks (Q6045073):
Displaying 12 items.
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Quantum lattice enumeration and tweaking discrete pruning (Q1633464) (← links)
- A hybrid lattice basis reduction and quantum search attack on LWE (Q1673605) (← links)
- An improved quantum algorithm for the quantum learning with errors problem (Q2107929) (← links)
- Estimating quantum speedups for lattice sieves (Q2692396) (← links)
- Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method (Q6051902) (← links)
- Shorter hash-and-sign lattice-based signatures (Q6104336) (← links)
- Estimating the hidden overheads in the BDGL lattice sieving algorithm (Q6166998) (← links)
- Quantum augmented lattice attack on NTRU with side information (Q6575057) (← links)
- Concrete analysis of quantum lattice enumeration (Q6595811) (← links)
- \textsf{SMAUG}: pushing lattice-based key encapsulation mechanisms to the limits (Q6620040) (← links)
- Further improvements of the estimation of key enumeration with applications to solving LWE (Q6643252) (← links)