To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

World War I cryptography

From Wikipedia, the free encyclopedia

Codes and ciphers were used extensively in World War I. The decoding by British Naval intelligence of the Zimmermann telegram helped bring the United States into the war.

Trench codes were used by field armies of most of the combatants (Americans, British, French, German) in World War I.[1]

The most commonly used codes were simple substitution codes. More important messages generally used mathematical encryption for extra security, though. The use of these codes required the distribution of codebooks to military personnel, which proved to be a security liability since these books could be stolen by enemy forces.[2]

YouTube Encyclopedic

  • 1/5
    Views:
    224 092
    817 933
    18 293
    49 336
    431
  • ✪ Cryptography: Crash Course Computer Science #33
  • ✪ Cryptography: The Science of Making and Breaking Codes
  • ✪ WWII Codebreaking and the First Computers, Malcolm A.H. MacCallum
  • ✪ (1/6) World War II Code Breakers
  • ✪ World War II cryptography

Transcription

Hi, I’m Carrie Anne, and welcome to CrashCourse Computer Science! Over the past two episodes, we’ve talked a lot about computer security. But the fact is, there’s no such thing as a perfectly, 100% secure, computer system. There will always be bugs and security experts know that. So system architects employ a strategy called defence in depth, which uses many layers of varying security mechanisms to frustrate attackers. It’s a bit like how castles are designed – first you’ve got to dodge the archers, then cross the moat, scale the walls, avoid the hot oil, get over the ramparts, and defeat the guards before you get to the throne room, but in this case we’re talking about one of the most common forms of computer security - Cryptography. INTRO The word cryptography comes from the roots ‘crypto’ and ‘graphy’, roughly translating to “secret writing”. In order to make information secret, you use a cipher – an algorithm that converts plain text into ciphertext, which is gibberish unless you have a key that lets you undo the cipher. The process of making text secret is called encryption, and the reverse process is called decryption. Ciphers have been used long before computers showed up. Julius Caesar used what’s now called a Caesar cipher, to encrypt private correspondence. He would shift the letters in a message forward by three places. So, A became D, and the word "brutus" became this: "euxwxv". To decipher the message, recipients had to know both the algorithm and the number to shift by, which acted as the key. The Caesar cipher is one example of a larger class of techniques called substitution ciphers. These replace every letter in a message with something else according to a translation. A big drawback of basic substitution ciphers is that letter frequencies are preserved. For example, E is the most common letter in English, so if your cipher translates E to an X, then X will show up the most frequently in the ciphertext. A skilled cryptanalyst can work backwards from these kinds of statistics to figure out the message. Indeed, it was the breaking of a substitution cipher that led to the execution of Mary, Queen of Scots, in 1587 for plotting to kill Queen Elizabeth. Another fundamental class of techniques are permutation ciphers. Let’s look at a simple example, called a columnar transposition cipher. Here, we take a message, and fill the letters into a grid. In this case, we’ve chosen 5 by 5. To encrypt our message, we read out the characters in a different order, let’s say from the bottom left, working upwards, one column at a time. The new letter ordering, what’s called a permutation, is the encrypted message. The ordering direction, as well as the 5 by 5 grid size, serves as the key. Like before, if the cipher and key are known, a recipient can reverse the process to reveal the original message. By the 1900s, cryptography was mechanized in the form of encryption machines. The most famous was the German Enigma, used by the Nazis to encrypt their wartime communications. As we discussed back in Episode 15, the Enigma was a typewriter-like machine, with a keyboard and lampboard, both showing the full alphabet. Above that, there was a series of configurable rotors that were the key to the Enigma’s encryption capability. First, let’s look at just one rotor. One side had electrical contacts for all 26 letters. These connected to the other side of the rotor using cross-crossing wires that swapped one letter for another. If ‘H’ went in, ‘K’ might come out the other side. If “K’ went in, ‘F’ might come out, and so on. This letter swapping behavior should sound familiar: it’s a substitution cipher! But, the Enigma was more sophisticated because it used three or more rotors in a row, each feeding into the next. Rotors could also be rotated to one of 26 possible starting positions, and they could be inserted in different orders, providing a lot of different substitution mappings. Following the rotors was a special circuit called a reflector. Instead of passing the signal on to another rotor, it connected every pin to another, and sent the electrical signal back through the rotors. Finally, there was a plugboard at the front of the machine that allowed letters coming from the keyboard to be optionally swapped, adding another level of complexity. With our simplified circuit, let’s encrypt a letter on this example enigma configuration. If we press the ‘H’ key, electricity flows through the plugboard, then the rotors, hits the reflector, comes back through the rotors and plugboard, and illuminates the letter ‘L’ on the lampboard. So H is encrypted to L. Note that the circuit can flow both ways – so if we typed the letter ‘L’, ‘H’ would light up. In other words, it’s the same process for encrypting and decrypting; you just have to make sure the sending and receiving machines have the same initial configuration. If you look carefully at this circuit, you’ll notice it’s impossible for a letter to be encrypted as itself, which turned out to be a fatal cryptographic weakness. Finally, to prevent the Enigma from being a simple substitution cipher, every single time a letter was entered, the rotors advanced by one spot, sort of like an odometer in a car. So if you entered the text A-A-A, it might come out as B-D-K, where the substitution mapping changed with every key press. The Enigma was a tough cookie to crack, for sure. But as we discussed in Episode 15, Alan Turing and his colleagues at Bletchley Park were able to break Enigma codes and largely automate the process. But with the advent of computers, cryptography moved from hardware into software. One of the earliest software ciphers to become widespread was the Data Encryption Standard developed by IBM and the NSA in 1977. DES, as it was known, originally used binary keys that were 56 bits long, which means that there are 2 to the 56, or about 72 quadrillion different keys. Back in 1977, that meant that nobody – except perhaps the NSA – had enough computing power to brute-force all possible keys. But, by 1999, a quarter-million dollar computer could try every possible DES key in just two days, rendering the cipher insecure. So, in 2001, the Advanced Encryption Standard (AES) was finalized and published. AES is designed to use much bigger keys – 128, 192 or 256 bits in size – making brute force attacks much, much harder. For a 128-bit keys, you'd need trillions of years to try every combination, even if you used every single computer on the planet today. So you better get started! AES chops data up into 16-byte blocks, and then applies a series of substitutions and permutations, based on the key value, plus some other operations to obscure the message, and this process is repeated ten or more times for each block. You might be wondering: why only ten rounds? Or why only 128 bit keys, and not ten thousand bit keys? Well, it’s a performance tradeoff. If it took hours to encrypt and send an email, or minutes to connect to a secure website, people wouldn't use it. AES balances performance and security to provide practical cryptography. Today, AES is used everywhere, from encrypting files on iPhones and transmitting data over WiFi with WPA2, to accessing websites using HTTPS. So far, the cryptographic techniques we’ve discussed rely on keys that are known by both sender and recipient. The sender encrypts a message using a key, and the recipient decrypts it using the same key. In the old days, keys would be shared by voice, or physically; for example, the Germans distributed codebooks with daily settings for their Enigma machines. But this strategy could never work in the internet era. Imagine having to crack open a codebook to connect to youtube! What’s needed is a way for a server to send a secret key over the public internet to a user wishing to connect securely. It seems like that wouldn’t be secure, because if the key is sent in the open and intercepted by a hacker, couldn’t they use that to decrypt all communication between the two? The solution is key exchange! – An algorithm that lets two computers agree on a key without ever sending one. We can do this with one-way functions – mathematical operations that are very easy to do in one direction, but hard to reverse. To show you how one-way functions work, let’s use paint colors as an analogy. It’s easy to mix paint colors together, but it’s not so easy to figure out the constituent colors that were used to make a mixed paint color. You’d have to test a lot of possibilities to figure it out. In this metaphor, our secret key is a unique shade of paint. First, there’s a public paint color that everyone can see. Then, John and I each pick a secret paint color. To exchange keys, I mix my secret paint color with the public paint color. Then, I send that mixed color to John by any means – mail, carrier pigeon, whatever. John does the same – mixing his secret paint color with the public color, then sending that to me. When I receive John’s color, I simply add my private color to create a blend of all three paints. John does the same with my mixed color. And Voila! We both end up with the same paint color! We can use this as a shared secret, even though we never sent each other our individual secret colors. A snooping outside observer would know partial information, but they’d find it very difficult to figure out our shared secret color. Of course, sending and mixing paint colors isn’t going to work well for transmitting computer data. But luckily, mathematical one-way functions are perfect, and this is what Diffie-Hellman Key Exchange uses. In Diffie-Hellman, the one-way function is modular exponentiation. This means taking one number, the base, to the power of another number, the exponent, and taking the remainder when dividing by a third number, the modulus. So, for example, if we wanted to calculate 3 to the 5th power, modulo 31, we would calculate 3 to the 5th, which is 243, then take the remainder when divided by 31, which is 26. The hard part is figuring out the exponent given only the result and the base. If I tell you I raised 3 to some secret number, modulo 31, and got 7 as the remainder, you'd have to test a lot of exponents to know which one I picked. If we make these numbers big, say hundreds of digits long, then finding the secret exponent is nearly impossible. Now let’s talk about how Diffie-Hellman uses modular exponentiation to calculate a shared key. First, there's a set of public values – the base and the modulus, that, like our public paint color, everyone gets to know... even the bad guys! To send a message securely to John, I would pick a secret exponent: X. Then, I’d calculate B to the power of X, modulo M. I send this big number over to John. John does the same, picking a secret exponent Y, and sending me B to the Y modulo M. To create a shared secret key, I take what John sent me, and take it to the power of X, my secret exponent. This is mathematically equivalent to B to the XY modulus M. John does the same, taking what I sent to him to the power of Y, and we both end up with the exact same number! It’s a secret shared key, even though we never sent each other our secret number. We can use this big number as a shared key for encrypted communication, using something like AES for encryption. Diffie-Hellman key exchange is one method for establishing a shared key. These keys that can be used by both sender and receiver, to encrypt and decrypt messages, are called symmetric keys because the key is the same on both sides. The Caesar Cipher, Enigma and AES are all symmetric encryption. There’s also asymmetric encryption, where there are two different keys, most often one that’s public and another that’s private. So, people can encrypt a message using a public key that only the recipient, with their private key, can decrypt. In other words, knowing the public key only lets you encrypt, but not decrypt – it’s asymmetric! So, think about boxes with padlocks that you can open with a key. To receive a secure message, I can give a sender a box and padlock. They put their message in it and lock it shut. Now, they can send that box back to me and only I can open it, with my private key. After locking the box, neither the sender, nor anyone else who finds the box, can open it without brute force. In the same way, a digital public key can encrypt something that can only be decrypted with a private key. The reverse is possible too: encrypting something with a private key that can be decrypted with a public key. This is used for signing, where a server encrypts data using their private key. Anyone can decrypt it using the server's public key. This acts like an unforgeable signature, as only the owner, using their private key, can encrypt. It proves that you're getting data from the right server or person, and not an imposter. The most popular asymmetric encryption technique used today is RSA, named after its inventors: Rivest, Shamir and Adleman. So, now you know all the “key” parts of modern cryptography: symmetric encryption, key exchange and public-key cryptography. When you connect to a secure website, like your bank, that little padlock icon means that your computer has used public key cryptography to verify the server, key exchange to establish a secret temporary key, and symmetric encryption to protect all the back-and-forth communication from prying eyes. Whether you're buying something online, sending emails to BFFs, or just browsing cat videos, cryptography keeps all that safe, private and secure. Thanks cryptography!

Contents

Britain

Zimmermann telegram as decoded by Room 40
Zimmermann telegram as decoded by Room 40

British decrypting was carried out in Room 40 by the Royal Navy and in MI1 by British Military (Army) Intelligence.

Russia

  • Ernst Fetterlein was in the Tsarist Russian Ministry of Foreign Affairs from 1896 and solved (among others) German, Austrian and British codes. He was eventually made chief cryptographer with the rank of admiral. With the Russian Revolution in 1917 he fled to Britain and was recruited to Room 40 in June 1918 to work on Austrian, Bolshevik and Georgian codes.
  • The Russians used an overcomplicated version of the Vigenère Cipher. It was broken within three days by Austro-Hungarian cryptanalyst Hermann Pokorny.

France

The French Army employed Georges Painvin, and Étienne Bazeries who came out of retirement, on German ciphers. Due to their prewar activities, the French were more prepared than any other nation involved in the war to decode German radiograms. At the beginning of the war, France had eight intercept stations: Maubeuge, Verdun, Toul, Epinal, Belfort, Lille, Rheims, and Besançon. During the war, they set up many more stations, including one in the Eiffel Tower. According to Colonel Cartier of the War Ministry, France intercepted over 100,000,000 words from German radiograms during the course of the war.[3]

Germany and Austria

Germany and Austria intercepted Russian radio traffic, although German success at the Battle of Tannenberg (1914) was due to interception of messages between the Russian commanders in clear.

The German Abhorchdienst, a code-breaking bureau composed mainly of mathematicians, was established in 1916.

The Germans had specific regulations regarding which kinds of codes and ciphers could be used under given circumstances. Within three kilometers of the front lines, known as the danger zone, all communications were required to be in a code known as the three-number code. This was the only code or cipher permitted. Behind this danger zone, another code known as the three-letter code was allowed to be used. Communications between divisions, corps, and army headquarters were done with the ADFGVX cipher.[4]

The ADFGX and ADFGVX field ciphers were a modified polybius system with single order double columnar transposition and frequent key change, with letters optimized for Morse. It was later broken by the famous French cryptanalyst Georges Painvin. The breaking of the ADFGX cipher by Painvin was the second time during the war that cryptanalysis played a major role in shaping events (the first being the interception and cracking of the Zimmerman Telegram). By breaking the cipher, the French were able to decode an intercepted message about the forwarding of munitions for a German offensive, letting the French know where and when the offensive would occur, and thus allowing them to stop it. This message became known as "The Radiogram of Victory."[5]

United States

Herbert Yardley began as a code clerk in the State Department. After the outbreak of war he became the head of the cryptographic section of Military Intelligence Section (MI-8)[6] and was with the American Expeditionary Force in World War I as a Signals Corps cryptologic officer in France. He later headed the Cipher Bureau, a new cryptanalysis group started in 1919, immediately after World War I, and funded jointly by the State Department and the US Army.

Some American cryptography in World War I was done at the Riverbank Laboratory where Elizebeth Friedman, William F. Friedman and Agnes Meyer Driscoll worked. The Riverbank Laboratory, Chicago was privately owned by Colonel George Fabyan.

The US Navy used the cryptographic code A-1. The US Navy cryptanalysis group, OP-20-G, was also started after World War I (in 1922).

The US also started employing Indian code talkers in World War I, initially with members of the Cherokee and Choctaw tribes.

See also

References

  1. ^ Walker, Julian (2014-07-23). "Trench talk: a guide to first world war slang". The Guardian. ISSN 0261-3077. Retrieved 2019-04-17.
  2. ^ Lerner, Adrienne. "World War I". Espionage Information: Encyclopedia of Espionage, Intelligence, and Security. Advameg, Inc. Retrieved 27 March 2015.
  3. ^ Kahn, David (1967). The Codebreakers. Scribner.
  4. ^ Friedman, William (1977). Solving German Codes in World War I. Aegean Park Press.
  5. ^ Kahn, David. "In Memoriam: Georges-Jean Painvain". Cryptologia. 6 (2): 120–127.
  6. ^ Kahn, David (1996). The Codebreakers: the Story of Secret Writing. New York: Scribner. p. 352. ISBN 0-684-83130-9.

External links

This page was last edited on 17 April 2019, at 10:56
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.