Optimized voronoi-based algorithms for parallel shortest vector computation
This chapter addresses Voronoi cell-based algorithms, solving the Shortest Vector Problem, a fundamental challenge in lattice-based cryptanalysis. Several optimizations reduce the original algorithm's execution time. The algorithm suitability for parallel execution on both CPUs and GPUs is also...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | bookPart |
| Idioma: | eng |
| Publicado em: |
2022
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/1822/78135 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/78135 |