Implementation Study of Public Key Cryptographic Protection in an Existing Electronic Mail and Document Handling System

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 219)


The problem which is addressed in this paper is to study the public key data protection (privacy, integrity and signatures) of an existing electronic mail and document handling system. This is not a trivial and straightforward problem since the protocols have to be tailored to the user’s needs and since many trade-offs are involved between speed, security and ease of use. Moreover the final security of the overall system not only depends on the choice of the cryptographic algorithm, but also on the communication protocol, the key management and their implementation (physical security and computer security). In other words the security is a property of the whole system [3]. Although many of the arguments described in the paper are rather system dependent, it is expected that the approaches taken here are valuable for other applications too. The readers are however cautioned not to transfer the conclusions blindly.


Central Computer Electronic Mail Cryptographic Scheme Packet Switching Network Public Switching Telephone Network 
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.


  1. [1]
    ISO, “Public key cryptosystem and mode of use, Annual report 1984”, Report ISO/TC 97/SC 2O/WG 2 N, Dec. 1984.Google Scholar
  2. [2]
    S. Weinstein, “Smart credit cards; the answer to cashless shopping”, IEEE Spectrum, Vol. 21, no2, pp.43–49, Febr. 1984.MathSciNetGoogle Scholar
  3. [3]
    D. Davies and W. Price, “Engineering secure information systems,” Proc. Eurocr.1985.Google Scholar
  4. [4]
    D.E. Denning, “Cryptography and data security,” Addison-Wesley, Reading, 1982zbMATHGoogle Scholar
  5. [5]
    D. Chaum, “Untracable electronic mail, return addresses, and digital pseudonyms”, Comm. ACM, Vol. 24, pp. 84–88, Febr. 1981.CrossRefGoogle Scholar
  6. [6]
    R.L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public key cryptosystems,” Comm. ACM, Vol. 21, pp. 294–299, April 1978.CrossRefMathSciNetGoogle Scholar
  7. [7]
    R. Merkle and M. Hellman, “Hiding information and signatures in trapdoor knapsacks”, IEEE Trans. Inform. Theory, Vol. 24, pp. 525–530, Sept. 1978.CrossRefGoogle Scholar
  8. [8]
    Y. Desmedt, J. Vandewalle, and R. Govaerts, “A general public key cryptographic knapsack algorithm based on linear algebra”, IEEE Proc ISIT, pp. 129–130, 1980.Google Scholar
  9. [9]
    Davis J.A., Holdridge D.B., Simmons G.J., “Status Report on factoring”, Sandia National Laboratories 1–33, 1984.Google Scholar
  10. [10]
    S. Serpell, C. Brookson, B. Clark, “A prototype encryption system using public key”, Proc. Crypto 84.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  1. 1.ESAT LaboratoryK.U. LeuvenLeuvenBelgium
  2. 2.G. SpeybrouckTelindusLeuvenBelgium

Personalised recommendations