UPI Study › Courses › Ethics in Technology › Free lessons › Lesson 13.8 Free with a free account
From Ancient Ciphers to Modern Algorithms: How the Art of Secret Writing Has Evolved
Ethics in Technology · Chapter 13: Digital Espionage, Online Threats, and the Science of EncryptionSection 13.8 · lesson 85 of 11611 min · free with a free account
Free preview
Create a free account to keep watching
It takes a minute and costs nothing. Your free account unlocks all of Chapter 1 and 3 more lessons of Ethics in Technology.
Lesson complete
Earn the 3 college credits for Ethics in Technology
Enrolling adds a quiz after each lesson, the graded work and the official transcript. Recommended for credit by NCCRS.
Next lesson: What Encryption Actually Does to Your Data →← Stealing Digital Assets: From Financial Fraud to Identity Theft and BeyondNext lesson: What Encryption Actually Does to Your Data →
In this lesson
From alphabet shifts to machines and public keys.
- Explain fixed substitution, frequency patterns, and repeating keywords.
- Describe Enigma and the teamwork behind wartime codebreaking.
- Explain how computers changed encryption and cryptanalysis.
- Describe public and private keys and the shared-secret problem.
Free study notes
Get this lesson's notes by email
The key points and 4 practice questions with answers, in your inbox. One email, free.
One email. Unsubscribe in one click.
Transcript
Everything said in the video, section by section (1,346 words). Read along, or search it.
Chapter 13
Evolution of Secret Writing
People disguised written messages long before computers, aiming to keep intercepted information from unintended readers. This lesson follows four historical milestones from the source’s timeline. We will examine Caesar’s fixed shift, the Vigenere keyword method, Enigma machinery, and public-key cryptography. The methods address different problems, rather than form a complete history of every invention. We will explain why language patterns weaken simple substitutions. Next, we will see how repeating keywords change those patterns while leaving another weakness. Enigma and its analysis connect mathematical teamwork with purpose-built machines. Electronic computers then expanded both encryption design and the tools available for analysis. Finally, we will examine the shared-secret distribution problem, and why public keys changed how protected communication could begin.
Four Milestones
The Timeline Connects Methods with Different Security Problems
The source places Caesar’s example around fifty BCE, followed by the Vigenere tradition in the fifteen hundreds. It highlights Enigma in the nineteen thirties and forties, then public-key developments in the nineteen seventies. These dates are approximate milestones, rather than dates for every related invention. Hand ciphers replaced letters through fixed or changing shifts. Rotor machinery varied substitutions as the message was processed. Public-key methods later reduced the need to distribute the same secret before communicating. Cryptography develops through mathematical insight, analysis, available tools, and practical communication needs. This selective progression does not mean every method directly replaced the previous one, or that every possible encryption system must eventually fail.
Caesar Cipher
A Fixed Shift Replaces Each Letter Consistently
A Caesar cipher shifts each letter by the same number of alphabet positions. With a forward shift of three, A becomes D and B becomes E. The rule also wraps around the alphabet; X becomes A in this example. A reader knowing the shift reverses it to recover the original letters. The source associates the method with Julius Caesar’s military messages. The result can look unfamiliar, but its appearance does not establish security. Caesar has very few possible shifts, and the message retains important language structure. This is a useful historical example of a secret setting, rather than suitable protection for modern sensitive communication.
Simple Substitution
Consistent Replacement Preserves Useful Language Patterns
A substitution cipher replaces message symbols according to a defined rule. In simple fixed substitution, one replacement alphabet is used consistently throughout the message. A frequent original letter therefore remains frequent under its replacement. Repeated letters and recognizable word patterns can also survive the disguise. Frequency analysis compares observed patterns with the expected structure of the underlying language. Those clues can gradually reveal the substitution and help reconstruct the message. The amount of text, language, and context affect how useful the clues are. A very short message may not give enough evidence, so explain the weakness without promising an automatic answer from every sample.
Vigenere Cipher
A Repeating Keyword Changes the Shift Across Positions
The Vigenere cipher uses a repeating keyword, with each key letter specifying an alphabet shift. Successive message positions can therefore use different substitutions. The same original letter can become different encrypted letters, depending on its key position. That variation makes ordinary whole-message letter counts less revealing than in fixed substitution. The source places this tradition in the fifteen hundreds and describes its long reputation for strength. A reputation for being unbreakable expressed confidence in the method; it did not establish mathematical proof of security. However, changing shifts does not remove every kind of structure. The keyword repeats, creating a period across the encrypted message. The improvement and the weakness must be explained together; obscuring one statistical pattern can still leave another pattern available for analysis.
The Repeating-Key Weakness
Finding the Period Separates the Message into Simpler Groups
Repeated encrypted sequences can provide clues about the repeating keyword’s length. Their spacing may indicate positions processed under the same portion of the key. Once a plausible period is identified, positions using the same key letter can be grouped. For a three-letter keyword, the first group includes positions one, four, and seven. The next group contains positions two, five, and eight; the third includes three, six, and nine. Each group then behaves like a simpler fixed-shift substitution, allowing separate frequency analysis. The proposed length must be checked, and sufficient text matters for drawing useful conclusions. Finding a plausible period is an analytical route, rather than instant certainty about the keyword or every original letter.
Enigma Machinery
Rotating Components Change the Substitution During the Message
Enigma moved encryption into an electromechanical device, used by German forces during the Second World War. Rotating wheels, called rotors, changed their positions as keys were pressed. The changing positions altered the substitution during the message. Many possible settings created a much larger problem than a few Caesar shifts. Ordinary whole-message letter counts could not simply reveal one fixed replacement alphabet. The system nevertheless followed defined mechanisms and settings, rather than generate inherently random substitutions. Its states could eventually repeat, and complexity did not make it automatically unbreakable. Effective analysis required additional information and methods, rather than the simple manual frequency approach used for earlier examples.
Wartime Codebreaking
Mathematics, Engineering, Intelligence, and Teamwork Combined
The source highlights mathematical teams and codebreaking work at Britain’s Bletchley Park. Earlier Polish breakthroughs and later Allied efforts were also central to the achievement. Mathematical insight identified structure and constrained the settings that needed examination. Message information and procedural weaknesses provided clues beyond ordinary letter counts. Purpose-built electromechanical machines accelerated the evaluation of candidate settings. Engineers, operators, and analysts built the machines, checked results, and supported a continuing intelligence operation. The machines did not replace human reasoning; the achievement combined people, information, mathematics, and engineered computation. It also matters for computing history: teams organized computational machinery at scale to solve a demanding information problem.
Electronic Computing
Faster Computation Expanded Both Design and Analysis
Electronic computers expanded the operations that cryptographic systems could carry out quickly. Designs could move beyond pencil-and-paper shifts and the constraints of mechanical rotor devices. Mathematical analysis could assess the effort needed to attack a system. Some methods rely on particular difficult computational problems, while symmetric ciphers use other structured constructions. Computers also accelerated analysis, so their arrival helped both design and codebreaking. Merely running an algorithm on a computer does not establish that it is secure. Design, parameters, keys, implementation, and the assumed threats all influence the result. The tools and pace changed, but protection of the relevant secret values remained an essential practical requirement.
The Shared-Secret Problem
Public-Key Methods Reduce Advance Secret Distribution
The earlier examples required sender and receiver to possess compatible secret settings before communicating. Safely delivering that shared information across distance remained a practical problem. Public-key cryptography offered a major change during the nineteen seventies. In the public-key encryption model, the recipient has mathematically linked public and private keys. Others can use the public encryption key, while the matching private key remains secret for decryption. The private key does not need to be sent to the other person. Secure schemes make recovering that private value from public information computationally impractical. Other public-key methods establish shared keys, rather than directly encrypt every message. The public key must also be authenticated as belonging to the intended recipient. An attacker’s substituted key would undermine that identity connection, even though the participants were still using public-key mathematics.
Key Terms and Modern Use
Public Keys Support Secure Communication Within Larger Protocols
The key terms connect historical mechanisms with the modern distribution problem. Substitution replaces message symbols, and Vigenere changes shifts using a repeating keyword. Enigma uses rotor-based electromechanical encryption; codebreaking seeks content without already possessing the required secret. Public-key cryptography uses linked public and private values for suitable cryptographic functions. These functions can include encryption, key establishment, or digital signatures, depending on the scheme. Modern web and messaging protocols can combine public-key methods with efficient shared-key encryption. Protecting the private values and verifying identities remain part of the wider system. A key pair alone does not guarantee security; it must be used through appropriate algorithms, protocols, and implementations.
Review and Apply
Explain the Pattern, the Improvement, and the Remaining Requirement
Fixed substitution exposes language patterns, and Caesar also leaves very few possible shifts. Vigenere changes shifts, obscuring simple whole-message counts while still revealing structure through keyword repetition. Enigma’s rotor movement creates changing mappings and a larger setting problem. Breaking it required mathematical insight, information, engineering, machines, and coordinated teams. Electronic computing expanded the complexity and speed available for both design and analysis. Public-key methods reduced the requirement to distribute the same secret before protected communication could begin. They still require suitable schemes, protected private values, and authenticated connections between public keys and intended identities. Explain the mechanism, exposed structure, and required trust together; complexity of appearance alone is not a reliable measure of security.
About Ethics in Technology at UPI Study
Ethics in Technology (Computer Science 195) is a self-paced online course of 116 video lessons in 15 chapters, from cybersecurity basics, privacy and surveillance to big data, hacking, malware, network defense, intellectual property, cybercrime, encryption, emerging technology and digital citizenship. It carries a NCCRS credit recommendation for 3 semester credits.
Every lesson transcript is free on pages like this one, and the videos are free with a free UPI Study account. Enrolling adds a practice quiz after each lesson, the graded work and final exam that earn the credit, lifetime access, and an official transcript on completion. UPI Study has helped over 130,000 students with college credits. ACE and NCCRS have over 2,100 cooperating colleges that will consider accepting credits; the final decision is with the universities.
Enroll now → Course details Download the syllabus All Computer Science courses
Compare: Cybersecurity vs Ethics in Technology · Which ethics course?
Why take it here
Why students take Ethics in Technology with UPI Study
Where the credit goes
Universities that work with NCCRS
Ethics in Technology carries a NCCRS credit recommendation. These universities work with NCCRS; some are UPI Study's signed partners. ACE and NCCRS have over 2,100 cooperating colleges that will consider accepting credits; the final decision is with the universities.
Thomas Edison State UniversitySigned partner
University of the PeopleSigned partner
Charter Oak State CollegeSigned partner
Strayer UniversitySigned partner
Columbia Southern UniversitySigned partner
Indiana TechSigned partner
Penn StateWorks with NCCRS
Southern New Hampshire UniversityWorks with NCCRS
SUNYWorks with NCCRS
+many more cooperating universitiesFind my college →Find my college → Not listed? Ask Athena in the corner of this page, or book a 15-minute call.
FAQ
Questions students ask us
About From Ancient Ciphers to Modern Algorithms: How the Art of Secret Writing Has Evolved
How does a Caesar cipher work, and why is it easy to break?
How was the Vigenère cipher broken?
How was the Enigma machine broken?
What problem did public-key cryptography solve?
About the Ethics in Technology course
How many college credits is Ethics in Technology?
How much does Ethics in Technology cost and what is included?
Which universities accept UPI Study credits?
How long does Ethics in Technology take?
How are the exams done?
How do my credits reach my college?
Ready for the full course? Earn 3 credits in Ethics in Technology.
116 video lessons, a quiz after each one, and the graded work that earns the credit. Recommended for credit by NCCRS.
3 credits · NCCRSEnroll →