@InProceedings{CR84, replaced-by = { CR88 }, author = { Benny Chor and Ronald L. Rivest }, title = { A Knapsack Type Public Key Cryptosystem Based on Arithmetic in Finite Fields (preliminary draft) }, pages = { 54--65 }, OPTurl = { http://dx.doi.org/10.1007/3-540-39568-7_6 }, doi = { 10.1007/3-540-39568-7_6 }, booktitle = { Advances in Cryptology -- Proceedings of CRYPTO 1984 }, date = { 1985 }, editor = { George Blakley and David Chaum }, publisher = { Springer }, isbn = { 978-3-540-15658-1 }, series = { Lecture Notes in Computer Science }, volume = { 196 }, organization = { IACR }, OPTyear = { 1985 }, OPTmonth = { August }, eventdate = { 1984-08-19/1984-08-22 }, eventtitle = { CRYPTO '84 }, venue = { Santa Barbara, California }, abstract = { We introduce a new knapsack type public key cryptosystem. The system is based on a novel application of arithmetic in finite fields, following a construction by Bose and Chowla. Appropriately choosing the parameters, we can control the density of the resulting knapsack. In particular, the density can be made high enough to foil ``low density'' attacks against our system. At the moment, we do not know of any attacks capable of ``breaking'' this system in a reasonable amount of time. }, }