Lattice-based Cryptography
Top Cited Papers
- 31 January 2009
- book chapter
- other
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 57 references indexed in Scilit:
- Finding short lattice vectors within mordell's inequalityPublished by Association for Computing Machinery (ACM) ,2008
- Predicting Lattice ReductionPublished by Springer Science and Business Media LLC ,2008
- Lattice problems in NP ∩ coNPJournal of the ACM, 2005
- Noise-tolerant learning, the parity problem, and the statistical query modelJournal of the ACM, 2003
- Approximating CVP to Within Almost-Polynomial Factors is NP-HardCombinatorica, 2003
- A sieve algorithm for the shortest lattice vector problemPublished by Association for Computing Machinery (ACM) ,2001
- Approximating the SVP to within a Factor (1+1/dimε) Is NP-Hard under Randomized ReductionsJournal of Computer and System Sciences, 1999
- A public-key cryptosystem with worst-case/average-case equivalencePublished by Association for Computing Machinery (ACM) ,1997
- Lattice Attacks on NTRULecture Notes in Computer Science, 1997
- On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica, 1986