Pages that link to "Item:Q2946443"
From MaRDI portal
The following pages link to Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing (Q2946443):
Displaying 14 items.
- Faster neighbour list generation using a novel lattice vector representation (Q709793) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- A new lattice sieving algorithm base on angular locality-sensitive hashing (Q1745006) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing (Q3457102) (← links)
- Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere (Q3603512) (← links)
- (Q5111221) (← links)
- Lattice Sieving via Quantum Random Walks (Q6045073) (← links)
- A non-heuristic approach to time-space tradeoffs and optimizations for BKW (Q6135457) (← links)
- Estimating the hidden overheads in the BDGL lattice sieving algorithm (Q6166998) (← links)
- Asymptotics and improvements of sieving for codes (Q6637718) (← links)
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)
- CryptAttackTester: high-assurance attack analysis (Q6652984) (← links)