8 search results - page 1 / 2 » Public-Key Cryptosystems from the Worst-Case Shortest Vector... |
ECCC
2008
13 years 7 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
ACISP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. At ACISP 2000, Yoo et al proposed a fast public key cryptosystem using matrices over a ring. The authors claim that the security of their system is based on the RSA probl...
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
STOC
2003
ACM
14 years 20 days ago
2003
ACM
We introduce the use of Fourier analysis on lattices as an integral part of a lattice based construction. The tools we develop provide an elegant description of certain Gaussian d...