Sieve algorithms for the shortest vector problem are practical
The most famous lattice problem is the Shortest Vector Problem (SVP), which has many applications in cryptology. The best approximation algorithms known for SVP in high dimension rely on a subroutine for exact SVP in low dimension. In this paper, we assess the practicality of the best (theoretical)...
Gorde:
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
De Gruyter
2008-07-01
|
| Saila: | Journal of Mathematical Cryptology |
| Gaiak: | |
| Sarrera elektronikoa: | https://doi.org/10.1515/JMC.2008.009 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|