Advertisement

Cryptosystems

  • Ernst L. Leiss
Part of the Foundations of Computer Science book series (FCSC)

Abstract

Suppose two persons, A and B, wish to communicate, i.e., exchange messages. At first glance it appears that this is an easy enough task. Unfortunately, this appearance may be quite deceptive. The following problems arise:
  1. (1)

    How can A and B make sure that nobody else can receive these messages?

     
  2. (2)

    How can A (B) make sure that B (A) receives all of A’s (all of B’s) messages?

     
  3. (3)

    How can A and B make sure that they receive only these messages and no others?

     

Keywords

Knapsack Problem Encrypt Data Symmetric Encryption Cipher Text Encryption Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Plenum Press, New York 1982

Authors and Affiliations

  • Ernst L. Leiss
    • 1
  1. 1.University of HoustonHoustonUSA

Personalised recommendations