Review of the course

Congratulations! You have now completed this short course on An introduction to Cryptography.

During the second week of this short course we looked at:

  • Formal notation for discussing cryptography
  • How randomness is used in cryptography and why it is both critical for security and hard to achieve
  • Hashing algorithms for securing passwords and authenticating messages

Your task

At the beginning of the course we asked a big question:

Is it possible to prove the security of encrypted data, or will every algorithm fail, given sufficient time or computing power?

What are your thoughts now that you have gone through the course? Share your final thoughts with your fellow learners.

Share this article:

This article is from the free online course:

An Introduction to Cryptography

Coventry University