This activity introduces one of the strongest confidentiality notions called perfect secrecy. It has a fairly technical mathematical formulation and is only achieved by systems that are not very practical, but it is the basis of many practical designs.
This activity was developed with NSF support through IUSE-1626765. You may request access to this activity via the following link: IntroCS-POGIL Activity Writing Program.
- Level: Undergraduate
- Setting: Classroom
- Activity Type: Learning Cycle
- Discipline: Computer Science
- Course: Cryptography
- Keywords: Bayes' theorem, conditional probability, cryptosystem, cipher
How to Cite
Copyright of this work and the permissions granted to users of the PAC are defined in the PAC Activity User License.