Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR96-056 | 12th November 1996 00:00

Public-Key Cryptosystems from Lattice Reduction Problems

RSS-Feed




TR96-056
Authors: Oded Goldreich, Shai Halevi
Publication: 13th November 1996 10:37
Downloads: 1068
Keywords: 


Abstract:

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 conjectured computational difficulty of lattice-reduction
problems, providing a possible alternative to existing
public-key encryption algorithms and digital signatures such
as RSA and DSS.



ISSN 1433-8092 | Imprint