Perfect Secrecy

Cryptography

Authors

  • Mark Gondree Sonoma State University

Abstract

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

Downloads

Published

2023-01-05

How to Cite

Gondree, M. (2023). Perfect Secrecy: Cryptography. POGIL Activity Clearinghouse, 3(4). Retrieved from https://pac.pogil.org/index.php/pac/article/view/269

Issue

Vol. 3 No. 4 (2022): CS-POGIL Special Issue

Section

CS-POGIL Activity Writing Program

License

Copyright of this work and the permissions granted to users of the PAC are defined in the PAC Activity User License.