@inproceedings{924ec0429e524ef19c0bddabdf3b77e4,
title = "A lattice- based public-key cryptosystem",
abstract = "Ajtai recently found a random class of lattices of integer points for which he could prove the following worst-case/average-case equivalence result: If there is a probabilistic polynomial time algorithm which finds a short vector in a random lattice from the class, then there is also a probabilistic polynomial time algorithm which solves several problems related to the shortest lattice vector problem (SVP) in any n-dimensional lattice. Ajtai and Dwork then designed a public-key cryptosystem which is provably secure unless the worst case of a version of the SVP can be solved in probabilistic polynomial time. However, their cryptosystem suffers from massive data expansion because it encrypts data bit-by-bit. Here we present a public-key cryptosystem based on similar ideas, but with much less data expansion.",
keywords = "Cryptographic security, Lattice, Public-key cryptosystem",
author = "Cai, \{Jin Yi\} and Cusick, \{Thomas W.\}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 5th Annual Workshops on Selected Areas in Cryptography, SAC 1998 ; Conference date: 17-08-1998 Through 18-08-1998",
year = "1999",
doi = "10.1007/3-540-48892-8\_18",
language = "English",
isbn = "3540658947",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "219--233",
editor = "Stafford Tavares and Henk Meijer",
booktitle = "Selected Areas in Cryptography - 5th Annual International Workshop, SAC 1998, Proceedings",
address = "Germany",
}