@Article{CR88,
  author = 	 { Benny Chor and Ronald L. Rivest },
  title = 	 { A Knapsack-type public key cryptosystem based on arithmetic in finite fields },
  journal = 	 { IEEE Transactions on Information Theory },
  OPTyear = 	 { 1988 },
  OPTmonth = 	 { September },
  date =         { 1988-09 },                  
  volume = 	 { 34 },
  number = 	 { 5 },
  pages = 	 { 901--909 },
  doi =          { 10.1109/18.21214 },                  
  abstract =     {
        A new knapsack-type public key cryptosystem is introduced.  The system
        is based on a novel application of arithmetic in finite fields, following a 
        construction by Bose and Chowla.  By appropriately choosing the parameters,
        one can control the density of the resulting knapsack, which is the ratio 
        between the number of elements in the knapsack and their size in bits.  In particular,
        the density can be made high enough to foil ``low-density'' attacks against our
        system.  At the moment, no attacks capable of ``breaking'' this system in a
        reasonable amount of time are known.                  
                 },
}