• DocumentCode
    891267
  • Title

    A knapsack-type public key cryptosystem based on arithmetic in finite fields

  • Author

    Chor, Benny ; Rivest, Ronald L.

  • Author_Institution
    AT&T Bell Lab., Murray Hill, NJ, USA
  • Volume
    34
  • Issue
    5
  • fYear
    1988
  • fDate
    9/1/1988 12:00:00 AM
  • Firstpage
    901
  • Lastpage
    909
  • Abstract
    A knapsack-type public key cryptosystem is introduced that is the system is based on a novel application of arithmetic in finite fields. 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 so-called low-density attacks against the system. At the moment, no attacks capable of breaking the system in a reasonable amount of time are known
  • Keywords
    cryptography; arithmetic; finite fields; knapsack-type public key cryptosystem; Arithmetic; Computer science; Error correction codes; Galois fields; Helium; Laboratories; Polynomials; Public key; Public key cryptography;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.21214
  • Filename
    21214