On the underlying hard lattice problems of GGH encryption scheme
Based on numerous experiments, the inventors of the Goldreich, Goldwasser and Halevi encryption scheme (GGH Scheme) conjectured that the Closest Vector Problem (CVP) instance which arose from the scheme was practically intractable in lattice with a dimension more than 300. However, some attacks had...
| Hoofdauteurs: | , , |
|---|---|
| Formaat: | Conference or Workshop Item |
| Taal: | English |
| Gepubliceerd in: |
Institute for Mathematical Research, Universiti Putra Malaysia
2018
|
| Online toegang: | http://psasir.upm.edu.my/id/eprint/66528/1/Cryptology2018-3.pdf |