77 search results - page 1 / 16 » Public-Key Cryptosystems from Lattice Reduction Problems |
138
Voted
CRYPTO
1997
Springer
15 years 2 months ago
1997
Springer
We present a new proposal for a trapdoor one-way function, from which we derive public-key encryption and digital signatures. The security of the new construction is based on the ...
ECCC
2008
14 years 10 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...
IMA
1999
Springer
15 years 2 months ago
1999
Springer
We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product. Using these trapdoors we set up a lattice-based cryptosystem which ...
ACISP
2001
Springer
15 years 2 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...
105
click to vote
STOC
2005
ACM
15 years 10 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...