Probability and Perfect Secrecy

  • Johannes A. Buchmann
Part of the Undergraduate Texts in Mathematics book series (UTM)


In the previous chapter, we have described a number of historical cryptosystems. It turned out that they were all affine linear and therefore insecure. Are there cryptosystems that are provably secure? In 1949, Claude Shannon [66] was able to describe such systems. Unfortunately, those systems are not very efficient. Also, they are not secure against active attacks if no further cryptographic techniques are used. In this chapter, we present Shannon’s theory. At the same time, we will introduce a few notions and results of elementary probability theory.


Sample Space Elementary Event Active Attack Pseudorandom Number Generator 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2004

Authors and Affiliations

  • Johannes A. Buchmann
    • 1
  1. 1.Department of Computer ScienceTechnical UniversityDarmstadtGermany

Personalised recommendations