We may earn an affiliate commission when you visit our partners.
Course image
Kevin Matthews, James Shuttleworth, Dominique D, Serena Turton, Derrick Newton, Fadzayi Guri, Antal Goldschmidt, Natasha Macmanard, Martyn Clayden, Ana Karnesova, Parminder Kaur, Matt Compton, and Melissa B.

Most FutureLearn courses run multiple times. Every run of a course has a set start date but you can join it and work through it after it starts. Find out more 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. You can use the hashtag #cryptography to talk about this course on social media.

Read more

Most FutureLearn courses run multiple times. Every run of a course has a set start date but you can join it and work through it after it starts. Find out more 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. You can use the hashtag #cryptography to talk about this course on social media.

Topics Covered

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

Save this course

Create your own learning path. Save this course to your list so you can find it easily later.
Save

Reviews summary

Foundational cryptography: clear concepts, historical context

According to learners, 'An Introduction to Cryptography' is a largely positive experience, particularly praised for its ability to demystify complex concepts and provide a strong foundational understanding. Students frequently highlight the instructor's clear explanations, making the mathematical concepts accessible even to those with limited prior knowledge. The course's well-structured modules and integration of fascinating historical context are also frequently mentioned as strengths. While excellent for building a theoretical base and preparing for advanced study, some students note it is highly theoretical, with a desire for more practical examples or coding exercises.
Engaging insights into classical ciphers.
"I particularly enjoyed how they integrated the historical context of ciphers with the underlying mathematical principles."
"The historical examples were fascinating, and the explanations of hashing and random number generation were exceptionally clear."
"I liked the historical progression of cryptography."
Builds essential conceptual understanding.
"It laid a very strong foundation for understanding modern encryption techniques. Highly recommend for anyone curious about the subject or preparing for further study."
"It does exactly what an 'introduction' should do; it opens the door to a fascinating field."
"It provided a strong understanding of fundamental concepts, which is exactly what I needed to prepare for a more advanced university course."
"It's an excellent stepping stone for anyone considering further study in cybersecurity or information theory."
Demystifies complex cryptographic concepts.
"Absolutely fantastic introduction! The instructor managed to demystify complex cryptographic concepts without oversimplifying them."
"As someone with a limited math background, I was initially intimidated, but the way the instructor broke down the concepts was incredibly helpful."
"Perfect for a curious mind! I found the explanations compelling and the content fascinating. It truly makes complex ideas accessible without dumbing them down."
Some found the delivery somewhat dry.
"I found this course a bit too theoretical and at times, dry."
"The course is informative, but the presentation can be a bit dry at times. Some lectures felt like reading a textbook aloud."
Assumes some prior math knowledge.
"Some mathematical parts required re-watching lectures."
"Certain mathematical derivations were a bit rushed for a beginner, and I had to look up external resources."
"I felt like it assumed a certain level of prior math knowledge which wasn't explicitly stated."
Lacks practical application or coding exercises.
"A bit more practical application or small coding examples would have made it perfect, but it's theory-focused as advertised."
"It's more theoretical than practical, which might not suit everyone looking for hands-on skills."
"I wanted to learn about how to actually use encryption in real-world scenarios, but this was all about history and abstract math."
"If you're looking for practical applications, you'll need to seek them elsewhere, but for pure understanding, this is great."

Career center

Learners who complete An Introduction to Cryptography will develop knowledge and skills that may be useful to these careers:

Reading list

We've selected 43 books that we think will supplement your learning. Use these to develop background knowledge, enrich your coursework, and gain a deeper understanding of the topics covered in An Introduction to Cryptography.
This comprehensive textbook covers the latest developments in cryptography, including public-key cryptography, digital signatures, and quantum computing.
Spanning the entire discipline of hashing from Hans Peter Luhn's 1953 IBM memo to modern hash tables and message digests, Alan Konheim analyzes chained and open-addressed occupancy distributions, double hashing, Rabin-Karp string matching, and cryptographic hashing.
Focusing on modern hash-based probabilistic data structures used in high-throughput storage engines and distributed systems, Medjedovic, Tahirovic, and Dedovic detail Bloom filters, quotient filters, cuckoo hashing, Count-Min sketches, and HyperLogLog.
Considered a standard textbook for introductory cryptography courses at the undergraduate and graduate levels. provides a rigorous theoretical foundation with an emphasis on formal definitions and proofs of security. It's essential for students seeking a deep understanding of cryptographic principles.
Containing the most celebrated mathematical analysis of hash tables in computer science, Section 6.4 derives exact probe counts for linear probing (where Donald Knuth's very first asymptotic analysis originated in 1962), coalesced hashing, Brent's variation, and extendible hashing.
Illustrating how well-chosen hash tables, bit vectors, and signature hashing solve real-world spellcheckers, anagram detectors, and Markov text generators in a fraction of the memory of naive search structures, Jon Bentley teaches timeless engineering judgment.
Provides a practical introduction to modern cryptography with a focus on real-world applications and implementation pitfalls. It is suitable for undergraduate students and working professionals, particularly those with a programming background. It covers essential concepts and valuable reference for understanding how cryptographic primitives are used securely.
Focuses on the practical aspects of designing and implementing secure cryptographic systems. It's an excellent resource for software engineers and system architects, bridging the gap between theoretical cryptography and real-world deployment. It highlights common pitfalls and provides guidance on building secure systems.
This classic textbook provides a rigorous foundation in information theory, which is essential for understanding the theory behind cryptography.
Provides a practical guide to implementing cryptographic algorithms in real-world applications.
Providing the rigorous theoretical treatment of cryptographic hashing, Arno Mittelbach and Marc Fischlin examine collision resistance, second-preimage bounds, universal one-way hash families, and the sponge and Merkle-Damgård paradigms.
A classic and comprehensive survey of cryptographic protocols and algorithms. While some of the algorithms covered may be outdated for current implementation, this book remains an invaluable reference for understanding the breadth of cryptography and its historical development. It's particularly useful for those interested in the practical application of cryptography.
Offers a clear and accessible introduction to modern cryptography, suitable for undergraduate students. It focuses on the fundamental concepts and provides a good balance between theory and practical examples.
Key resource for understanding the emerging field of post-quantum cryptography, which focuses on cryptographic algorithms resistant to attacks by quantum computers. It is suitable for graduate students and researchers interested in contemporary cryptographic challenges.
Offering an approachable, visual introduction for self-taught programmers, Jay Wengrow demonstrates how trading a modest amount of memory for a hash table transforms nested O(N^2) array lookups into instantaneous O(1) passes.
Detailing how distributed storage systems combine consistent hashing rings, virtual nodes (vnodes), Merkle anti-entropy trees, and Bloom filters to route queries and reconcile replica divergence in Dynamo-style key-value stores.
Explaining how distributed databases use consistent hashing (rendezvous and ring partitioning) to distribute keys across cluster nodes without massive data movement, alongside in-memory Bitcask hash indexes and hash-join execution.
Provides a solid introduction to the theory and practice of cryptography, suitable for advanced undergraduate and graduate students. It covers a wide range of topics and includes a good balance of theoretical concepts and practical algorithms.
Provides a comprehensive overview of the principles and practice of random sampling. It covers a wide range of topics, including sampling theory, design, and implementation.
Considered a classic and definitive history of cryptography. While not a technical guide, this book provides invaluable context and a fascinating narrative of the evolution of secret communication. It's a must-read for anyone interested in the historical and cultural impact of cryptography.
Combining clean Java implementations with empirical performance histograms, Robert Sedgewick and Kevin Wayne walk through hashCode design for compound keys, dynamic table resizing, separate chaining symbol tables, and linear-probing deletion.
Going beyond introductory hash tables, Peter Brass provides self-contained C implementations and proofs for universal hash families, dynamic perfect hashing, cuckoo hashing with two tables, and extendible/linear external-memory hashing.
Offers a cohesive introduction to public-key cryptography with a strong focus on the underlying mathematics, including number theory and algebraic geometry. It's suitable for advanced undergraduate and graduate students with a solid mathematical background.
Explores the mathematical foundations of cryptography, including number theory, group theory, and abstract algebra.
Contains the proceedings of the MCQMC 2012 conference, which was held in Vienna, Austria. The conference brought together leading researchers in the field of Monte Carlo and quasi-Monte Carlo methods, and the book contains a collection of papers on the latest advances in the field.
Focuses on the algorithmic aspects of breaking cryptographic systems. It is suitable for advanced undergraduate and graduate students with a strong algorithmic and mathematical background. It provides insights into the techniques used to analyze the security of cryptographic schemes.
Connecting balls-into-bins occupancy bounds, the power of two choices in balanced allocations, universal 2-independent hash families, and algebraic fingerprinting, Rajeev Motwani and Prabhakar Raghavan illuminate why randomization makes hashing provably fast.
Chapter 11 of CLRS provides the canonical university exposition of direct-address tables, chaining under simple uniform hashing, open addressing with linear/quadratic probing and double hashing, Carter-Wegman universal hashing, and static FKS perfect hashing.
Explores the connections between number theory and cryptography. It is mathematically rigorous and suitable for students with a strong background in number theory. It provides a deeper understanding of the mathematical principles behind many cryptographic algorithms.
Co-authored by cuckoo filter and power-of-two-choices pioneer Michael Mitzenmacher with Eli Upfal, this text derives Chernoff bounds for hash bucket maximum load, Bloom filter false-positive rates, and cuckoo hashing cycle probabilities.
Teaching how similarity-preserving hashing scales data mining to billions of items, Leskovec, Rajaraman, and Ullman explain shingling, MinHash for Jaccard similarity, Locality-Sensitive Hashing (LSH), and Flajolet-Martin distinct-element hashing.
Offers an accessible introduction to the fundamental principles of cryptography and its applications in everyday life. It is suitable for beginners and those who want to understand the basic concepts without deep mathematical detail.
Formalizing hash-based maps, balanced search trees, and amortized complexity proofs in Isabelle/HOL, Tobias Nipkow and coauthors demonstrate how to verify functional data structures and hashing invariants mechanically.
Connecting caching, human memory organization, and randomized hash bucketing to everyday library filing and cognitive recall, Brian Christian and Tom Griffiths reveal why controlled disorder (hashing) often beats meticulous sorting.
Provides a comprehensive overview of random number generation and modeling. It covers a wide range of topics, including the generation of random numbers, the design of simulation experiments, and applications in various fields.
Provides a practical guide to random number generators and simulation. It covers a wide range of topics, including the generation of random numbers, the design of simulation experiments, and applications in various fields.
A beginner-friendly guide covering the history and fundamental concepts of modern cryptography. is suitable for those with little to no prior knowledge of the subject and provides a good starting point for understanding the basics.

Share

Help others find this course page by sharing it with your friends and followers:

Similar courses

Here are nine courses similar to An Introduction to Cryptography.

Futurelearn Buyer Protection & Guarantee

Verified partner policies & purchase protections

UK & International University Partner
Free Trial & Audit

Free Access on Short Courses

Free access option on most short courses for the duration of the course plus 14 days; free trial available on select subscriptions and tracks.

Return & Refund Policy

14-Day Cooling-Off Refund Window

14-day statutory cooling-off refund window from the date of purchase for course upgrades, Unlimited subscriptions, and ExpertTracks, provided no tests have been attempted and no certificates have been downloaded. Renewals are non-refundable.

Buyer Protections

Verified Academic & Industry Partner

Accredited university microcredentials and certificates from top institutions (British Council, leading UK and global universities), with secure payment safeguards.

Key Purchase Protections
Free access track on many short courses
14-day cooling-off refund window on initial purchases
Refund eligible if no tests completed and no certificate issued
Accredited certifications from top UK & global universities
OpenCourser Verified Partner Policy details last reviewed: 2026-10-22
Our mission

OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.

Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.

Find this site helpful? Tell a friend about us.

Affiliate disclosure

We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.

Your purchases help us maintain our catalog and keep our servers humming without ads.

Thank you for supporting OpenCourser.

© 2016 - 2025 OpenCourser