Course provided by Future Learn

Study type: Online

Starts: Anytime

Price: Free

Overview

Investigate the security of encrypted data

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

On this course you will get an introduction to cryptography and cryptanalysis. From ancient examples of secret messages and the spies that cracked them to modern cryptographic applications, you will have the opportunity to explore the foundations of data security.

During the course you will also get an opportunity to try encrypting data yourself by completing a cryptography and cryptanalysis challenge.

What topics will you cover?

  • The mathematical concepts underpinning cryptography
  • Classical cryptography and historical ciphers
  • The basics of cryptanalysis
  • Random number generation
  • Hashing

When would you like to start?

Start straight away and learn at your own pace. If the course hasn’t started yet you’ll see the future date listed below.

  • Available now

Who is the course for?

The Institute of Coding supported the development of this course in response to consultation with industry representatives from the healthcare, manufacturing and automotive sectors.

This course is for people who want to understand more about the way cryptography keeps our communications safe, either out of curiosity or to prepare for advanced study of the topic.

Please note that the individuals detailed in the ‘Who will you learn with?’ section below, are current staff members and may be subject to change.

Who developed the course?

Coventry University

Coventry secured gold in the UK Government’s 2017 Teaching Excellence Framework (TEF) and is University of the Year for Student Experience in The Times & The Sunday Times Good University Guide 2019.

  • Established1992
  • LocationCoventry

Institute of Coding

The Institute of Coding is a family of learners, businesses and educators creating a new way to develop the digital skills needed at work and beyond.