Cryptography: History, Ciphers & Public Key

Learning Goal: Examine the historical evolution of cryptography and secret communication—from substitution ciphers and the Enigma machine to public-key cryptography—and its influence on military intelligence, individual privacy, and digital trust.

  • Prerequisites: Basic knowledge of modular arithmetic and elementary algebra. No prior computer science or cybersecurity experience is required.
  • Estimated Total Study Time: 12 Hours

Module 1: Classical Cryptography: From Caesar to Vigenère

This module covers the origins of secret writing. You will explore how ancient civilizations sought to secure messages using shift-based substitutions and how polyalphabetic methods later attempted to defeat frequency-based decryption strategies.

Recommended Videos

The Caesar cipher | Journey into cryptography | Computer Science | Khan Academy
The Caesar cipher | Journey into cryptography | Computer Science | Khan Academy
@khanacademy01:01815,688
The Caesar cipher | Journey into cryptography | Computer Science | Khan Academy

Frequency analysis is a technique used to break substitution ciphers by exploiting the statistical properties of language. Al-Kindi, an Arab mathematician, discovered that every language has a characteristic letter frequency pattern—a fingerprint that remains even when text is encrypted. By counting the frequency of each letter in the encrypted text and comparing it to the known frequency distribution of the original language, codebreakers can determine how much the letters have been shifted. Fo

@khanacademy · 01:01

Why this video: This concise visual introduction introduces the core mechanics of the Caesar Shift Cipher. Crucially, it highlights Al-Kindi's historic discovery of frequency analysis—the statistical method of leveraging natural language patterns to break monoalphabetic substitution ciphers.

Knowledge Checkpoint:

  • Understand how a shift cipher moves plaintext characters down the alphabet using a fixed offset key.
  • Explain how letter frequency tables (identifying common letters like 'E', 'T', and 'A') allow cryptanalysts to break simple monoalphabetic substitution ciphers without knowing the key.
How the Vigenère Cipher Works
How the Vigenère Cipher Works
@brodmann-3804:25959
How the Vigenère Cipher Works

The Vigenère cipher is a classical polyalphabetic substitution cipher that encrypts alphabetic text using a keyword. The encryption process involves: (1) selecting a key word, (2) repeating the key to match plaintext length, (3) converting letters to numbers (A=0, B=1, ..., Z=25), (4) adding plaintext and key numbers together, (5) applying modulo 26 to results exceeding 25, and (6) converting back to letters for ciphertext. Decryption reverses this process: convert ciphertext and key to numbers,

@brodmann-38 · 04:25

Why this video: This guide breaks down the multi-layered mechanics of the Vigenère cipher. By walking through step-by-step keyword repeating and the use of the Vigenère table (tabula recta), it illustrates how polyalphabetic encryption masks natural language frequency distributions.

Knowledge Checkpoint:

  • Define how a keyword is repeated and mapped over a plaintext message to construct a polyalphabetic key.
  • Contrast monoalphabetic substitution ciphers with polyalphabetic substitution ciphers.
Vigenere Cipher - Decryption (Unknown Key)
Vigenere Cipher - Decryption (Unknown Key)
@ddxfraxinusdne17:44331,195
Vigenere Cipher - Decryption (Unknown Key)

To decrypt a Vigenère cipher without knowing the key, follow a two-step process: First, determine the key length by writing the ciphertext multiple times with increasing shifts and counting coincidences (matching letters at the same position); the key length corresponds to the periodicity of high coincidence counts. Second, find each key character by grouping every Nth letter (where N is the key length), calculating letter frequencies for each group, and finding the shift that maximizes the sum

@ddxfraxinusdne · 17:44

Why this video: This detailed tutorial demonstrates how to cryptanalyze a Vigenère cipher when the key is unknown. It visually maps out how to find the key length by checking index coincidence and how to crack individual Caesar sub-ciphers using frequency analysis.

Knowledge Checkpoint:

  • Explain how repeating sequences in ciphertext reveal the key length of a Vigenère cipher (Kasiski examination theory).
  • Detail the exact steps required to isolate and break individual polyalphabetic segments using standard single-alphabet frequency techniques.

Gap Note on Classical Cryptanalysis: While these videos offer clear structural examples, the best way to master this is hands-on practice. We highly recommend using online interactive substitution cipher solvers to crack historical texts using frequency histograms.

Module 2: Mechanical Warfare: The Enigma Machine and Bletchley Park

In this module, you will step into the electro-mechanical era of cryptography. You will study the inner workings of the German military's Enigma machine and investigate the logical methods Alan Turing and his Bletchley Park colleagues used to crack it during World War II.

Recommended Videos

How did the Enigma Machine work?
How did the Enigma Machine work?
@JaredOwen19:2513,231,252
How did the Enigma Machine work?

The Enigma machine was an electromechanical cipher device used by Nazi Germany during WWII to encrypt military communications. It worked by routing electrical current through a series of three rotors (each containing scrambled internal wiring), a reflector that redirected the current back through the rotors, and a plugboard that could swap letter pairs. Each key press caused the rotors to rotate, changing the electrical path and ensuring that identical letters were never encrypted the same way t

@JaredOwen · 19:25

Why this video: This highly polished 3D animation reveals the physical, mechanical, and electrical subsystems inside the Enigma machine. It details the exact electrical path from keypress, through the plugboard (Steckerbrett), through the rotating rotors, to the reflector (Umkehrwalze), and back to the lampboard.

Knowledge Checkpoint:

  • Trace the path of an electrical signal through the keyboard, plugboard, rotors, reflector, and lightboard.
  • Explain why the reflector mechanism made decryption identical to encryption, and understand the core physical flaw it introduced: a letter could never encrypt to itself.
158,962,555,217,826,360,000 (Enigma Machine) - Numberphile
158,962,555,217,826,360,000 (Enigma Machine) - Numberphile
@numberphile03:196,571,210
158,962,555,217,826,360,000 (Enigma Machine) - Numberphile

The Enigma machine was a cipher device used by Nazi Germany during World War II for sending secret military communications. This original army Enigma machine, manufactured in 1936, demonstrates how mechanical encryption worked. The machine converts plaintext letters to ciphertext by routing electrical signals through rotating rotors with internal wiring. When a key is pressed, the rotors turn, changing the electrical path and producing different ciphertext letters for the same plaintext input. T

@numberphile · 03:19

Why this video: This video calculates the mathematical space of Enigma configurations, totaling over 158 quintillion possibilities. It explains how rotor selection, rotor starting positions, ring settings, and plugboard connections combined to create a key space that WWII military intelligence considered unbreakable.

Knowledge Checkpoint:

  • Calculate the permutations generated by selecting 3 rotors out of a pool of 5.
  • Describe how the plugboard (Steckerbrett) dramatically expanded the size of Enigma's mathematical key space compared to commercial versions.
TURING: the man who cracked the nazi code | History Calls | FULL DOCUMENTARY
TURING: the man who cracked the nazi code | History Calls | FULL DOCUMENTARY
@SLICEHistory51:47464,142
TURING: the man who cracked the nazi code | History Calls | FULL DOCUMENTARY

Alan Turing, a mathematician at Bletchley Park during World War II, developed the theoretical foundation for modern computers through his 'Turing Machine' concept and successfully broke the German Enigma code using the Bombe machine, which provided crucial intelligence that shortened the war by approximately two years and laid the groundwork for artificial intelligence and computer science.

@SLICEHistory · 51:47

Why this video: This historical documentary places mechanical cryptography in context. It traces Alan Turing's mathematical achievements at Bletchley Park, the design of the electro-mechanical Bombe machines, and how intelligence derived from decrypted messages (Ultra) influenced the Battle of the Atlantic.

Knowledge Checkpoint:

  • Identify what a "crib" is and how predictable language in German military broadcasts (such as weather reports) gave Allied codebreakers a foothold.
  • Explain the mechanical logic of Turing’s Bombe machine in filtering out millions of incorrect rotor configurations based on electrical contradictions.

Module 3: Symmetric Encryption and the Key Exchange Problem

This module covers the modern era of symmetric cryptography. You will study the evolution from the Data Encryption Standard (DES) to the Advanced Encryption Standard (AES) and analyze the fundamental security vulnerability of symmetric cryptography: the Key Distribution Problem.

Recommended Videos

The Science Of Secrecy, Going Public, Part 1
The Science Of Secrecy, Going Public, Part 1
@MattiDVHS01:0230,043
The Science Of Secrecy, Going Public, Part 1

The fundamental problem of cryptography is how to securely distribute encryption keys between parties without an eavesdropper intercepting them. In traditional cryptography, if you want to send a secret message, you must first put it in a box (encrypt it), then lock it with a padlock (the key). However, the critical challenge is getting the key to your friend without the eavesdropper obtaining it. This 'key distribution problem' was the oldest and toughest problem in cryptography for 2,000 years

@MattiDVHS · 01:02

Why this video: This video introduces the Key Distribution Problem. It shows why secure communication fails if parties have no secure way to share their identical symmetric keys without an eavesdropper intercepting them.

Knowledge Checkpoint:

  • Define symmetric cryptography and explain why sharing a single key becomes a security vulnerability at scale.
  • Explain why symmetric systems scale poorly (O(N2)O(N^2) keys needed for NN users) when every pair of communicators requires a unique private key.
Encrypting Data - CompTIA Security+ SY0-701 - 1.4
Encrypting Data - CompTIA Security+ SY0-701 - 1.4
@professormesser00:40308,853
Encrypting Data - CompTIA Security+ SY0-701 - 1.4

DES (Data Encryption Standard) and AES (Advanced Encryption Standard) are two major encryption algorithms with fundamental differences. DES operates through five steps including breaking data into left and right plaintext segments to produce 64-bit ciphertext. AES works differently by taking plaintext and a secret key, adding them to a cipher, and producing ciphertext. Different versions of AES can produce different output levels. These algorithms are incompatible - data encrypted with DES canno

@professormesser · 00:40

Why this video: This video compares the structure of DES with the design of AES, explaining why DES had to be phased out due to its insecure key size.

Knowledge Checkpoint:

  • State the key size difference between standard DES (56-bit key) and AES (128, 192, or 256-bit keys).
  • Explain why a 56-bit key size became vulnerable to modern brute-force computing power.
Lecture 8: Advanced Encryption Standard (AES) by Christof Paar
Lecture 8: Advanced Encryption Standard (AES) by Christof Paar
@introductiontocryptography422311:07322,005
Lecture 8: Advanced Encryption Standard (AES) by Christof Paar

AES emerged as a replacement for DES after DES became insecure due to attacks. In 1997, NIST initiated an open competition accepting 15 submissions, reducing to 5 finalists by 1999. On October 2, 2000, Rijndael (designed by Belgian cryptographers Joan Daemen and Vincent Rijmen) was selected over IBM's expected winner. AES operates on 128-bit blocks with 10, 12, or 14 rounds depending on key length (128, 192, or 256 bits). It has become the most widely used symmetric encryption algorithm, impleme

@introductiontocryptography4223 · 11:07

Why this video: Delivered by academic cryptographer Christof Paar, this lecture segment details the transition from DES to the Rijndael cipher (AES). It describes the public, multi-year competitive evaluation process hosted by NIST that established AES as the global standard.

Knowledge Checkpoint:

  • Describe the history of the NIST AES competition launched in 1997.
  • Identify the main design requirements for the winning Rijndael algorithm (efficiency, security, and hardware compatibility).
AES Explained (Advanced Encryption Standard) - Computerphile
AES Explained (Advanced Encryption Standard) - Computerphile
@Computerphile14:141,421,444
AES Explained (Advanced Encryption Standard) - Computerphile

AES (Advanced Encryption Standard) is a 128-bit symmetric block cipher that encrypts data through a series of rounds involving substitution, permutation, and key addition operations. The algorithm processes data as a 4x4 grid of bytes and performs four main operations in each round: AddRoundKey (XOR with the round key), SubBytes (nonlinear byte substitution using an S-box designed to avoid fixed points), ShiftRows (horizontal row shifting), and MixColumns (matrix multiplication for diffusion). A

@Computerphile · 14:14

Why this video: This computer science classic demystifies the inner mathematical rounds of AES. It breaks down the matrix operations, showing how bytes are shifted, mixed, substituted, and combined with round keys to achieve secure confusion and diffusion.

Knowledge Checkpoint:

  • Detail the four mathematical transformations performed in each round of AES: SubBytes, ShiftRows, MixColumns, and AddRoundKey.
  • Explain the difference between AES symmetric block encryptions and classical stream/substitution methods.

Module 4: The Public-Key Revolution: RSA and Diffie-Hellman

This module explores the shift to asymmetric cryptography. You will study how mathematical one-way functions allowed untrusted parties to establish secure communications without sharing private keys in advance.

Recommended Videos

Diffie-Hellman Key Exchange
Diffie-Hellman Key Exchange
@ArtOfTheProblem08:38924,381
Diffie-Hellman Key Exchange

The Diffie-Hellman key exchange algorithm, invented by Whitfield Diffie and Martin Hellman in 1976, enables two parties to securely establish a shared secret key over an insecure channel without having previously shared any information. The algorithm leverages the mathematical properties of modular exponentiation and the discrete logarithm problem, which is computationally easy to perform in one direction (exponentiation) but extremely difficult to reverse (logarithm), allowing Alice and Bob to

@ArtOfTheProblem · 08:38

Why this video: Using an intuitive paint-mixing metaphor, this video explains how asymmetric protocols work. It shows how public values and private components can combine to produce an identical, secure shared key over public channels.

Knowledge Checkpoint:

  • Explain the paint-mixing analogy of the Diffie-Hellman key exchange.
  • Identify which elements must remain private and which elements are shared publicly.
Diffie Hellman -the Mathematics bit- Computerphile
Diffie Hellman -the Mathematics bit- Computerphile
@Computerphile07:05553,034
Diffie Hellman -the Mathematics bit- Computerphile

The Diffie-Hellman key exchange protocol enables two parties to securely establish a shared secret over an insecure channel using modular arithmetic. Alice and Bob agree on public values G (a small prime) and N (a large prime, typically 2000-4000 bits), then each selects a private random number (a for Alice, b for Bob). They exchange G^a mod N and G^b mod N publicly. Both can compute the shared secret G^(ab) mod N by raising the received value to their own private exponent, while an eavesdropper

@Computerphile · 07:05

Why this video: This video transitions from the paint analogy to the actual modular arithmetic powering Diffie-Hellman. It demonstrates how prime numbers (pp), generators (gg), and the mathematical difficulty of discrete logarithms keep shared keys secure.

Knowledge Checkpoint:

  • State the formula used by both parties to compute their public keys: Y=gx(modp)Y = g^x \pmod p.
  • Explain why the "Discrete Logarithm Problem" makes it computationally impossible for an attacker to deduce the private exponent xx from the public parameters.
Public Key Cryptography - Computerphile
Public Key Cryptography - Computerphile
@Computerphile06:20962,170
Public Key Cryptography - Computerphile

Public key cryptography solves the key distribution problem by using a pair of mathematically linked keys—a public key for encryption and a private key for decryption—allowing secure communication without pre-shared secrets; anyone can encrypt messages using the recipient's public key, and only the recipient can decrypt them with their private key, while encrypting with one's own private key provides authentication and message integrity.

@Computerphile · 06:20

Why this video: This video introduces asymmetric key pairs. It shows how public keys function as open locks that anyone can use to encrypt a message, while only the recipient's private key can decrypt it.

Knowledge Checkpoint:

  • Distinguish between a public key (used for encryption) and a private key (used for decryption).
  • Explain why knowing a public key does not allow an eavesdropper to derive the corresponding private key.
Prime Numbers & RSA Encryption: How Modular Arithmetic Secures the Internet
Prime Numbers & RSA Encryption: How Modular Arithmetic Secures the Internet
@Computerphile15:06204,981
Prime Numbers & RSA Encryption: How Modular Arithmetic Secures the Internet

RSA encryption uses the mathematical difficulty of factoring large composite numbers into their prime factors to create secure communication. The algorithm works by generating a public key (e, n) where n is the product of two large primes p and q, and a private key (d, n) where d is derived using the extended Euclidean algorithm on φ(n) = (p-1)(q-1). The security relies on the fact that while multiplying two primes is easy, reversing this process to find the original primes from n is computation

@Computerphile · 15:06

Why this video: This video covers the mathematical engine behind RSA encryption. It explains prime factorization, modular inverses, and how Euler’s Totient function (ϕ(n)\phi(n)) acts as the mathematical trapdoor that makes RSA secure.

Knowledge Checkpoint:

  • Explain why multiplying two massive prime numbers (p×q=np \times q = n) is computationally easy, while factoring nn back into pp and qq is extremely difficult.
  • Define the role of Euler’s Totient function ϕ(n)=(p−1)(q−1)\phi(n) = (p-1)(q-1) in calculating the private exponent dd.

Module 5: Digital Trust: HTTPS, End-to-End Encryption, and Privacy

This module covers how cryptography secures the modern internet. You will analyze how web browsers secure connections, how end-to-end encryption protocols protect personal messaging, and the ongoing socio-political battles over privacy and government surveillance.

Recommended Videos

TLS Handshake Explained - Computerphile
TLS Handshake Explained - Computerphile
@Computerphile16:59626,986
TLS Handshake Explained - Computerphile

The TLS handshake is a critical procedure where a client and server establish a secure encrypted connection through a series of messages: the client sends its supported protocols and cipher suites, the server selects one and authenticates itself using a digital certificate, they exchange cryptographic parameters to derive a shared secret, and finally verify the handshake completion to ensure no tampering occurred, enabling subsequent encrypted communication.

@Computerphile · 16:59

Why this video: This video breaks down the steps of a TLS handshake. It details how asymmetric cryptography, symmetric cryptography, and digital certificates work together to establish secure, encrypted HTTPS web connections.

Knowledge Checkpoint:

  • Outline the core stages of the TLS handshake (ClientHello, ServerHello, Certificate Verification, Key Exchange, Finished).
  • Explain how asymmetric keys are used to agree upon a temporary symmetric session key for the rest of the connection.
What Is End-to-End Encryption (E2EE) And How Does It Work? | E2EE Explained | Simplilearn
What Is End-to-End Encryption (E2EE) And How Does It Work? | E2EE Explained | Simplilearn
@SimplilearnOfficial08:413,971
What Is End-to-End Encryption (E2EE) And How Does It Work? | E2EE Explained | Simplilearn

End-to-end encryption (E2EE) is a security technology that ensures only the sender and recipient can read messages by encrypting data on the sender's device and decrypting it only on the recipient's device, using public-key cryptography where the sender uses the recipient's public key to encrypt and the recipient uses their private key to decrypt, thereby preventing service providers, hackers, or anyone else from accessing the content during transmission; however, E2EE has limitations including

@SimplilearnOfficial · 08:41

Why this video: This video explains the mechanics of End-to-End Encryption (E2EE). It shows how E2EE ensures that only the sender and recipient can read messages, keeping them secure from transit routers, ISPs, and the messaging platforms themselves.

Knowledge Checkpoint:

  • Define the fundamental rule of E2EE: data must be encrypted on the sender's device and decrypted only on the recipient's device.
  • Identify what metadata is exposed during E2EE transit (e.g., timestamps, sender/receiver identity) even when message contents remain encrypted.
Moxie Marlinspike - Making Private Communication Simple
Moxie Marlinspike - Making Private Communication Simple
@Absurd_110:2428,863
Moxie Marlinspike - Making Private Communication Simple

In the 1990s, cypherpunks fought a war against government surveillance, advocating for free cryptography while agencies classified encryption as 'ammunition' and prosecuted those who shared it. The Clipper Chip represented government surveillance with a master key. Cypherpunks responded by creating cleanroom implementations in Anguilla and Sealand, and Phil Zimmermann published PGP source code in a book to leverage free speech protections. Despite these efforts, PGP failed to achieve mass adopti

@Absurd_1 · 10:24

Why this video: Featuring Moxie Marlinspike (creator of the Signal Protocol), this talk explores the history of cryptography and the "Crypto Wars" of the 1990s. It traces how encryption evolved from military use to consumer applications, and details early battles over export restrictions and the Clipper Chip.

Knowledge Checkpoint:

  • Understand why the U.S. government initially classified high-grade cryptography software as "munitions" subject to strict export controls.
  • Explain the design of the "Clipper Chip" proposal and how its escrowed backdoor design threatened individual privacy.
Encryption: Last Week Tonight with John Oliver (HBO)
Encryption: Last Week Tonight with John Oliver (HBO)
@LastWeekTonight01:0814,265,465
Encryption: Last Week Tonight with John Oliver (HBO)

In the early 1990s, the U.S. government proposed requiring private companies to use a Clipper chip in their computers, which would allow authorities to monitor coded messages while still providing encryption. The government compared it to giving a trusted neighbor your house key—someone who would only use it when absolutely necessary. However, computer scientist Matt Blaze discovered a way to disable the government access feature, leading to the project's abandonment. This historical attempt dem

@LastWeekTonight · 01:08

Why this video: This segment explores the modern debate between individual privacy and national security. It covers the friction between technology companies implementing end-to-end encryption and law enforcement agencies demanding "exceptional access" backdoors.

Knowledge Checkpoint:

  • Articulate the trade-offs of the "encryption debate" (individual privacy and secure commerce vs. national security and law enforcement access).
  • Explain why cryptographers agree that creating a "law-enforcement-only" backdoor makes a system vulnerable to hackers and foreign adversaries.

Gap Note on Modern E2EE Implementations: While these videos cover the conceptual foundations of E2EE and the history of privacy debates, they do not details the math behind advanced messaging protocols. For a deeper understanding, search for "The Double Ratchet Algorithm" to learn how modern messaging apps generate fresh keys for every single message.

Course Map

Key People Index

  • Al-Kindi (801–873 AD): Arab mathematician who discovered frequency analysis, breaking monoalphabetic substitution ciphers and establishing the foundation of scientific cryptanalysis.
  • Arthur Scherbius (1878–1929): The German electrical engineer who patented and designed the electro-mechanical Enigma cipher machine.
  • Alan Turing (1912–1954): British mathematician and computer pioneer who cracked the naval Enigma machine at Bletchley Park and formulated the concept of universal computing.
  • Whitfield Diffie & Martin Hellman: Inventors of the Diffie-Hellman key exchange in 1976, which solved the key distribution problem and launched the asymmetric cryptography revolution.
  • Ron Rivest, Adi Shamir, & Leonard Adleman: Computer scientists who created the RSA cryptosystem in 1977, implementing prime factorization as a practical public-key encryption mechanism.
  • Moxie Marlinspike: Software developer and founder of Signal, who co-developed the modern Signal Protocol to provide automatic end-to-end encryption for global communications.

Final Self-Assessment

Complete this comprehensive self-assessment to verify your understanding of classical, mechanical, and modern digital cryptography.

  • Classical Substitution: Can you explain how a polyalphabetic Vigenère cipher flattens natural letter frequency distributions compared to a simple Caesar cipher?
  • Frequency Analysis: Can you trace the mathematical steps required to determine the key length of an encrypted Vigenère ciphertext using index coincidence?
  • Enigma Mechanics: Can you describe the electrical path of a keypress through the Enigma machine and explain why its reflector prevented a letter from encrypting to itself?
  • Turing's Codebreaking: Do you understand how Alan Turing used linguistic patterns (cribs) and electrical contradictions to eliminate billions of rotor combinations?
  • Symmetric Scalability: Can you explain the Key Distribution Problem and calculate why symmetric encryption is difficult to scale for millions of internet users?
  • DES vs. AES: Do you understand the physical and mathematical reasons why the 56-bit DES standard was replaced by the Rijndael algorithm (AES)?
  • AES Internals: Can you list and define the four matrix-shuffling rounds used by AES to secure data blocks?
  • Diffie-Hellman Mechanics: Can you write the modular arithmetic formula that allows two untrusted parties to establish a shared secret key over an insecure connection?
  • RSA Trapdoors: Can you explain why prime factorization acts as a mathematical one-way function that powers RSA asymmetric key pairs?
  • TLS Handshake: Can you outline how asymmetric encryption, symmetric encryption, and digital certificates work together to secure HTTPS web connections?
  • End-to-End Encryption: Can you explain the security difference between transport-layer encryption (HTTPS) and device-to-device end-to-end encryption (E2EE)?
  • Socio-Political History: Can you summarize the core arguments of the 1990s "Crypto Wars" and explain why technical experts oppose backdoor access for law enforcement?
Explore Further

Related General Studies Roadmaps

View All→
general-studies

Containerization: Evolution, Logistics & Trade

01Ancient Trade & Bulk Cargo: Amphorae to Barrels
02The Industrial Revolution & Cardboard Packaging
03The Containerization Revolution: Malcom McLean
+ 2 more learning modules
12h5 modules
Explore Roadmap
general-studies

Textile Tech: Evolution, Labor & Global Impact

01Pre-Industrial Textiles: Handloom & Cottage Industry
02Mechanization: The Spinning Jenny to the Power Loom
03The Factory System & Global Labor Transformation
+ 2 more learning modules
10h5 modules
Explore Roadmap
general-studies

Pharmacology: Botany, Patents & Biopiracy

01Foundations of Ethnobotany & Traditional Medicine
02The Birth of Synthetic Chemistry: Aspirin & Penicillin
03The Battle Against Malaria: Quinine to Artemisinin
+ 3 more learning modules
12h6 modules
Explore Roadmap
general-studies

Writing Surfaces: Papyrus, Parchment & Paper

01Ancient Foundations: Clay, Stone, and Egyptian Papyrus
02Parchment, Vellum, and the Rise of the Codex
03The Chinese Rag Paper Revolution and the Silk Road
+ 3 more learning modules
9h6 modules
Explore Roadmap