Behrang Noohi. 22 July Behrang Noohi (QMUL) 1 / 18
|
|
- Bartholomew Mathews
- 5 years ago
- Views:
Transcription
1 Behrang Noohi School of Mathematical Sciences Queen Mary University of London 22 July 2014 Behrang Noohi (QMUL) 1 / 18
2 Introduction Secure Communication How can one send a secret message? Steganography vs. Cryptography; Kerckhoff Principle Cryptography, before Diffie-Hellman (1976): substitution, transposition, polyalphabetic substitution (eg, Vigenere, Enigma),...; Problem: communicating the key More Public-key cryptography; Diffie-Hellman idea More More Behrang Noohi (QMUL) 2 / 18
3 Steganography Steganography: the art of hiding the message Behrang Noohi (QMUL) 3 / 18
4 Steganography The Ambassadors, by Hans Holbein the Younger (1533). The National Gallery. Modern methods Invisible ink, hidden words, microdots, DNA, watermarks... Return Behrang Noohi (QMUL) 4 / 18
5 Steganography The Ambassadors, by Hans Holbein the Younger (1533). The National Gallery. Modern methods Invisible ink, hidden words, microdots, DNA, watermarks... Return Behrang Noohi (QMUL) 4 / 18
6 Cryptography The model Alice and Bob share a secret key, unknown to Eve "Eavesdropper" Alice encrypts the plaintext message with the key, forming a ciphertext. Bob decrypts the ciphertext with the key, obtaining the original plaintext. Eve also receives the ciphertext, but cannot understand it. Kerckhoffs Principle Eve sees the communication AND knows the system. Only the key is secret. Encryption/decryption methods Substitution, transposition, codebook, stream ciphers,... Behrang Noohi (QMUL) 5 / 18
7 Cryptography The model Alice and Bob share a secret key, unknown to Eve "Eavesdropper" Alice encrypts the plaintext message with the key, forming a ciphertext. Bob decrypts the ciphertext with the key, obtaining the original plaintext. Eve also receives the ciphertext, but cannot understand it. Kerckhoffs Principle Eve sees the communication AND knows the system. Only the key is secret. Encryption/decryption methods Substitution, transposition, codebook, stream ciphers,... Behrang Noohi (QMUL) 5 / 18
8 Cryptography The model Alice and Bob share a secret key, unknown to Eve "Eavesdropper" Alice encrypts the plaintext message with the key, forming a ciphertext. Bob decrypts the ciphertext with the key, obtaining the original plaintext. Eve also receives the ciphertext, but cannot understand it. Kerckhoffs Principle Eve sees the communication AND knows the system. Only the key is secret. Encryption/decryption methods Substitution, transposition, codebook, stream ciphers,... Behrang Noohi (QMUL) 5 / 18
9 Substitution ciphers Monoalphabetic substitution Each letter is consistently replaced by another. Example Reversed alphabet: A Z, B Y, C X,... HELLO SVOOL. Permutations The key is a permutation of the alphabet: a bijective map σ : {A,..., Z} {A,..., Z}. Encryption: apply σ to each letter. Decryption: apply the inverse permutation σ 1 to each letter (σ(x) = y σ 1 (y) = x). Behrang Noohi (QMUL) 6 / 18
10 Substitution ciphers Monoalphabetic substitution Each letter is consistently replaced by another. Example Reversed alphabet: A Z, B Y, C X,... HELLO SVOOL. Permutations The key is a permutation of the alphabet: a bijective map σ : {A,..., Z} {A,..., Z}. Encryption: apply σ to each letter. Decryption: apply the inverse permutation σ 1 to each letter (σ(x) = y σ 1 (y) = x). Behrang Noohi (QMUL) 6 / 18
11 Substitution ciphers Monoalphabetic substitution Each letter is consistently replaced by another. Example Reversed alphabet: A Z, B Y, C X,... HELLO SVOOL. Permutations The key is a permutation of the alphabet: a bijective map σ : {A,..., Z} {A,..., Z}. Encryption: apply σ to each letter. Decryption: apply the inverse permutation σ 1 to each letter (σ(x) = y σ 1 (y) = x). Behrang Noohi (QMUL) 6 / 18
12 Cryptanalysis: breaking a cipher The security of a cipher How easy/hard is it to break? (Understand message / obtain key). Brute force Any cipher can be broken by trying all possible keys. How long will it take? Number of substitution cipher keys 26! = = = age of universe in nanoseconds! Computational feasibility Security is relative to our powers of computation. Behrang Noohi (QMUL) 7 / 18
13 Cryptanalysis: breaking a cipher The security of a cipher How easy/hard is it to break? (Understand message / obtain key). Brute force Any cipher can be broken by trying all possible keys. How long will it take? Number of substitution cipher keys 26! = = = age of universe in nanoseconds! Computational feasibility Security is relative to our powers of computation. Behrang Noohi (QMUL) 7 / 18
14 Cryptanalysis: breaking a cipher The security of a cipher How easy/hard is it to break? (Understand message / obtain key). Brute force Any cipher can be broken by trying all possible keys. How long will it take? Number of substitution cipher keys 26! = = = age of universe in nanoseconds! Computational feasibility Security is relative to our powers of computation. Behrang Noohi (QMUL) 7 / 18
15 Cryptanalysis: breaking a cipher The security of a cipher How easy/hard is it to break? (Understand message / obtain key). Brute force Any cipher can be broken by trying all possible keys. How long will it take? Number of substitution cipher keys 26! = = = age of universe in nanoseconds! Computational feasibility Security is relative to our powers of computation. Behrang Noohi (QMUL) 7 / 18
16 Statistical analysis Letter frequencies Some letters are more common than others. The most common letters in English writing are E, T, A, O, I/N, H/S/R,... Frequency analysis Count letter frequencies in the ciphertext; replace the most common ones by E, T, A, etc.; try to guess the others. ZH GRQW JHW SHDU WDUWV IURP SHDFK WUHHV Ze GRQt Jet SeaU tautv IURP SeaFK tueev Ze GRQt Jet Sear tarts IrRP SeaFK trees Ze GoQt Jet Sear tarts IroP SeaFK trees we dont get pear tarts from peach trees Behrang Noohi (QMUL) 8 / 18
17 Statistical analysis Letter frequencies Some letters are more common than others. The most common letters in English writing are E, T, A, O, I/N, H/S/R,... Frequency analysis Count letter frequencies in the ciphertext; replace the most common ones by E, T, A, etc.; try to guess the others. ZH GRQW JHW SHDU WDUWV IURP SHDFK WUHHV Ze GRQt Jet SeaU tautv IURP SeaFK tueev Ze GRQt Jet Sear tarts IrRP SeaFK trees Ze GoQt Jet Sear tarts IroP SeaFK trees we dont get pear tarts from peach trees Behrang Noohi (QMUL) 8 / 18
18 Statistical analysis Letter frequencies Some letters are more common than others. The most common letters in English writing are E, T, A, O, I/N, H/S/R,... Frequency analysis Count letter frequencies in the ciphertext; replace the most common ones by E, T, A, etc.; try to guess the others. ZH GRQW JHW SHDU WDUWV IURP SHDFK WUHHV Ze GRQt Jet SeaU tautv IURP SeaFK tueev Ze GRQt Jet Sear tarts IrRP SeaFK trees Ze GoQt Jet Sear tarts IroP SeaFK trees we dont get pear tarts from peach trees Behrang Noohi (QMUL) 8 / 18
19 Statistical analysis Letter frequencies Some letters are more common than others. The most common letters in English writing are E, T, A, O, I/N, H/S/R,... Frequency analysis Count letter frequencies in the ciphertext; replace the most common ones by E, T, A, etc.; try to guess the others. ZH GRQW JHW SHDU WDUWV IURP SHDFK WUHHV Ze GRQt Jet SeaU tautv IURP SeaFK tueev Ze GRQt Jet Sear tarts IrRP SeaFK trees Ze GoQt Jet Sear tarts IroP SeaFK trees we dont get pear tarts from peach trees Behrang Noohi (QMUL) 8 / 18
20 Statistical analysis Letter frequencies Some letters are more common than others. The most common letters in English writing are E, T, A, O, I/N, H/S/R,... Frequency analysis Count letter frequencies in the ciphertext; replace the most common ones by E, T, A, etc.; try to guess the others. ZH GRQW JHW SHDU WDUWV IURP SHDFK WUHHV Ze GRQt Jet SeaU tautv IURP SeaFK tueev Ze GRQt Jet Sear tarts IrRP SeaFK trees Ze GoQt Jet Sear tarts IroP SeaFK trees we dont get pear tarts from peach trees Behrang Noohi (QMUL) 8 / 18
21 Statistical analysis Letter frequencies Some letters are more common than others. The most common letters in English writing are E, T, A, O, I/N, H/S/R,... Frequency analysis Count letter frequencies in the ciphertext; replace the most common ones by E, T, A, etc.; try to guess the others. ZH GRQW JHW SHDU WDUWV IURP SHDFK WUHHV Ze GRQt Jet SeaU tautv IURP SeaFK tueev Ze GRQt Jet Sear tarts IrRP SeaFK trees Ze GoQt Jet Sear tarts IroP SeaFK trees we dont get pear tarts from peach trees Behrang Noohi (QMUL) 8 / 18
22 Statistical analysis Letter frequencies Some letters are more common than others. The most common letters in English writing are E, T, A, O, I/N, H/S/R,... Frequency analysis Count letter frequencies in the ciphertext; replace the most common ones by E, T, A, etc.; try to guess the others. ZH GRQW JHW SHDU WDUWV IURP SHDFK WUHHV Ze GRQt Jet SeaU tautv IURP SeaFK tueev Ze GRQt Jet Sear tarts IrRP SeaFK trees Ze GoQt Jet Sear tarts IroP SeaFK trees we dont get pear tarts from peach trees Behrang Noohi (QMUL) 8 / 18
23 Modular arithmetic Caesar cipher Previous example used shift by 3: A D, B E, C F,..., Z C. A numerical interpretation Identify A,..., Z with 0,..., 25. Encode e(x) = x + 3 mod 26. Decode d(x) = x 3 mod 26. General shifts Suppose we use an m-letter alphabet, identified with 0,..., m 1. Encode e n (x) = x + n mod m. Decode d n (x) = x n mod m. Behrang Noohi (QMUL) 9 / 18
24 Modular arithmetic Caesar cipher Previous example used shift by 3: A D, B E, C F,..., Z C. A numerical interpretation Identify A,..., Z with 0,..., 25. Encode e(x) = x + 3 mod 26. Decode d(x) = x 3 mod 26. General shifts Suppose we use an m-letter alphabet, identified with 0,..., m 1. Encode e n (x) = x + n mod m. Decode d n (x) = x n mod m. Behrang Noohi (QMUL) 9 / 18
25 Modular arithmetic Caesar cipher Previous example used shift by 3: A D, B E, C F,..., Z C. A numerical interpretation Identify A,..., Z with 0,..., 25. Encode e(x) = x + 3 mod 26. Decode d(x) = x 3 mod 26. General shifts Suppose we use an m-letter alphabet, identified with 0,..., m 1. Encode e n (x) = x + n mod m. Decode d n (x) = x n mod m. Behrang Noohi (QMUL) 9 / 18
26 Caesar s revenge: polyalphabetic ciphers Examples: one-time pad, Vigenere, Enigma Machine,... The one-time pad Keep changing amount we shift by! Let s use binary alphabet {0, 1}. The secret key is a random binary string, say k = Encryption, decryption both m m + k (bitwise addition mod 2): e.g. e( ) = = , d( ) = = Pro: Unbreakable! If k is random then so is m + k: it contains no information about m. (Shannon s Theorem) Con: Inefficient! k is as long as m: it begs the question of how Alice and Bob managed to agree on k. More efficient: short k and long m, break m into blocks b 1, b 2,, encode as b 1 + k, b 2 + k,.... (But this is breakable.) Behrang Noohi (QMUL) 10 / 18
27 Caesar s revenge: polyalphabetic ciphers Examples: one-time pad, Vigenere, Enigma Machine,... The one-time pad Keep changing amount we shift by! Let s use binary alphabet {0, 1}. The secret key is a random binary string, say k = Encryption, decryption both m m + k (bitwise addition mod 2): e.g. e( ) = = , d( ) = = Pro: Unbreakable! If k is random then so is m + k: it contains no information about m. (Shannon s Theorem) Con: Inefficient! k is as long as m: it begs the question of how Alice and Bob managed to agree on k. More efficient: short k and long m, break m into blocks b 1, b 2,, encode as b 1 + k, b 2 + k,.... (But this is breakable.) Behrang Noohi (QMUL) 10 / 18
28 Caesar s revenge: polyalphabetic ciphers Examples: one-time pad, Vigenere, Enigma Machine,... The one-time pad Keep changing amount we shift by! Let s use binary alphabet {0, 1}. The secret key is a random binary string, say k = Encryption, decryption both m m + k (bitwise addition mod 2): e.g. e( ) = = , d( ) = = Pro: Unbreakable! If k is random then so is m + k: it contains no information about m. (Shannon s Theorem) Con: Inefficient! k is as long as m: it begs the question of how Alice and Bob managed to agree on k. More efficient: short k and long m, break m into blocks b 1, b 2,, encode as b 1 + k, b 2 + k,.... (But this is breakable.) Behrang Noohi (QMUL) 10 / 18
29 Caesar s revenge: polyalphabetic ciphers Examples: one-time pad, Vigenere, Enigma Machine,... The one-time pad Keep changing amount we shift by! Let s use binary alphabet {0, 1}. The secret key is a random binary string, say k = Encryption, decryption both m m + k (bitwise addition mod 2): e.g. e( ) = = , d( ) = = Pro: Unbreakable! If k is random then so is m + k: it contains no information about m. (Shannon s Theorem) Con: Inefficient! k is as long as m: it begs the question of how Alice and Bob managed to agree on k. More efficient: short k and long m, break m into blocks b 1, b 2,, encode as b 1 + k, b 2 + k,.... (But this is breakable.) Behrang Noohi (QMUL) 10 / 18
30 The Vigenere cipher We don t communicate in binary! Cipher easier to remember if we use A..Z. The secret key is a word; each letter represents the shift from A to that letter; e.g. CAESAR +2,+0,+4,+18,+0,+17. Example: The rain in Spain falls mainly on the plain. Confusion is created since at different times (i) the same letter may be encoded differently, and (ii) different letters may be encoded identically! Behrang Noohi (QMUL) 11 / 18
31 The Vigenere cipher We don t communicate in binary! Cipher easier to remember if we use A..Z. The secret key is a word; each letter represents the shift from A to that letter; e.g. CAESAR +2,+0,+4,+18,+0,+17. Example: The rain in Spain falls mainly on the plain. Confusion is created since at different times (i) the same letter may be encoded differently, and (ii) different letters may be encoded identically! Behrang Noohi (QMUL) 11 / 18
32 The Vigenere cipher We don t communicate in binary! Cipher easier to remember if we use A..Z. The secret key is a word; each letter represents the shift from A to that letter; e.g. CAESAR +2,+0,+4,+18,+0,+17. Example: The rain in Spain falls mainly on the plain. Confusion is created since at different times (i) the same letter may be encoded differently, and (ii) different letters may be encoded identically! Behrang Noohi (QMUL) 11 / 18
33 The Vigenere cipher We don t communicate in binary! Cipher easier to remember if we use A..Z. The secret key is a word; each letter represents the shift from A to that letter; e.g. CAESAR +2,+0,+4,+18,+0,+17. Example: The rain in Spain falls mainly on the plain. Confusion is created since at different times (i) the same letter may be encoded differently, and (ii) different letters may be encoded identically! Behrang Noohi (QMUL) 11 / 18
34 Breaking the Vigenere cipher Much harder than a substitution, but it has weaknesses... Suppose we know the key length, say it is 6. Just look at the letters in positions 6,12,18,... they are encoded by the same shift: can use frequency analysis! Repeat for other remainders mod 6. How to get the key length? Could guess. Or use more sophisticated statistics... Kasiski method: Look for repeated consecutive pairs (digrams) or triples (trigrams). The key length probably divides the distance between them. Behrang Noohi (QMUL) 12 / 18
35 Breaking the Vigenere cipher Much harder than a substitution, but it has weaknesses... Suppose we know the key length, say it is 6. Just look at the letters in positions 6,12,18,... they are encoded by the same shift: can use frequency analysis! Repeat for other remainders mod 6. How to get the key length? Could guess. Or use more sophisticated statistics... Kasiski method: Look for repeated consecutive pairs (digrams) or triples (trigrams). The key length probably divides the distance between them. Behrang Noohi (QMUL) 12 / 18
36 Breaking the Vigenere cipher Much harder than a substitution, but it has weaknesses... Suppose we know the key length, say it is 6. Just look at the letters in positions 6,12,18,... they are encoded by the same shift: can use frequency analysis! Repeat for other remainders mod 6. How to get the key length? Could guess. Or use more sophisticated statistics... Kasiski method: Look for repeated consecutive pairs (digrams) or triples (trigrams). The key length probably divides the distance between them. Behrang Noohi (QMUL) 12 / 18
37 Breaking the Vigenere cipher Much harder than a substitution, but it has weaknesses... Suppose we know the key length, say it is 6. Just look at the letters in positions 6,12,18,... they are encoded by the same shift: can use frequency analysis! Repeat for other remainders mod 6. How to get the key length? Could guess. Or use more sophisticated statistics... Kasiski method: Look for repeated consecutive pairs (digrams) or triples (trigrams). The key length probably divides the distance between them. Behrang Noohi (QMUL) 12 / 18
38 Enigma Machine A polyalphabetic substitution cipher used by Germans in WWII. (Broken by Polish and British cryptologists.) Permutation of alphabet implemented by a set of rotors (and a plugboard) The permutation changes with each keystroke (ie, rotors turn). German procedural flaws, operator mistakes, laziness, failure to systematically introduce changes in encipherment procedures, and Allied capture of key tables and hardware that, during the war, enabled Allied cryptologists to succeed. Behrang Noohi (QMUL) 13 / 18
39 Enigma Machine A polyalphabetic substitution cipher used by Germans in WWII. (Broken by Polish and British cryptologists.) Permutation of alphabet implemented by a set of rotors (and a plugboard) The permutation changes with each keystroke (ie, rotors turn). German procedural flaws, operator mistakes, laziness, failure to systematically introduce changes in encipherment procedures, and Allied capture of key tables and hardware that, during the war, enabled Allied cryptologists to succeed. Behrang Noohi (QMUL) 13 / 18
40 Enigma Machine A polyalphabetic substitution cipher used by Germans in WWII. (Broken by Polish and British cryptologists.) Permutation of alphabet implemented by a set of rotors (and a plugboard) The permutation changes with each keystroke (ie, rotors turn). German procedural flaws, operator mistakes, laziness, failure to systematically introduce changes in encipherment procedures, and Allied capture of key tables and hardware that, during the war, enabled Allied cryptologists to succeed. Behrang Noohi (QMUL) 13 / 18
41 Enigma Machine A polyalphabetic substitution cipher used by Germans in WWII. (Broken by Polish and British cryptologists.) Permutation of alphabet implemented by a set of rotors (and a plugboard) The permutation changes with each keystroke (ie, rotors turn). German procedural flaws, operator mistakes, laziness, failure to systematically introduce changes in encipherment procedures, and Allied capture of key tables and hardware that, during the war, enabled Allied cryptologists to succeed. Behrang Noohi (QMUL) 13 / 18
42 Enigma Machine A polyalphabetic substitution cipher used by Germans in WWII. (Broken by Polish and British cryptologists.) Permutation of alphabet implemented by a set of rotors (and a plugboard) The permutation changes with each keystroke (ie, rotors turn). German procedural flaws, operator mistakes, laziness, failure to systematically introduce changes in encipherment procedures, and Allied capture of key tables and hardware that, during the war, enabled Allied cryptologists to succeed. Behrang Noohi (QMUL) 13 / 18
43 Key exchange A one-time pad attempt: Alice Eve Bob p m = p + k 1 m 1 A m 2 m2 = m + k 1 B m = m + k 3 2 A m 3 m = m + k = p 4 3 B Return Problem! m 1 + m 2 + m 3 = p. Behrang Noohi (QMUL) 14 / 18
44 Public key cryptography Diffie-Hellman idea: method where key is public knowledge?! How could this possibly work? One-way function e: computing e(x) easy; computing d(y) = e 1 (y) hard. RSA cryptosystem: power map e(x) = x l mod n; l, n public. Inverse problem given y, find x with x l = y mod n believed hard. Trapdoor function: n = pq with p, q large primes, secret key k with kl = 1 mod (p 1)(q 1), d(y) = y k mod n. Behrang Noohi (QMUL) 15 / 18
45 Public key cryptography Diffie-Hellman idea: method where key is public knowledge?! How could this possibly work? One-way function e: computing e(x) easy; computing d(y) = e 1 (y) hard. RSA cryptosystem: power map e(x) = x l mod n; l, n public. Inverse problem given y, find x with x l = y mod n believed hard. Trapdoor function: n = pq with p, q large primes, secret key k with kl = 1 mod (p 1)(q 1), d(y) = y k mod n. Behrang Noohi (QMUL) 15 / 18
46 Public key cryptography Diffie-Hellman idea: method where key is public knowledge?! How could this possibly work? One-way function e: computing e(x) easy; computing d(y) = e 1 (y) hard. RSA cryptosystem: power map e(x) = x l mod n; l, n public. Inverse problem given y, find x with x l = y mod n believed hard. Trapdoor function: n = pq with p, q large primes, secret key k with kl = 1 mod (p 1)(q 1), d(y) = y k mod n. Behrang Noohi (QMUL) 15 / 18
47 Public key cryptography Diffie-Hellman idea: method where key is public knowledge?! How could this possibly work? One-way function e: computing e(x) easy; computing d(y) = e 1 (y) hard. RSA cryptosystem: power map e(x) = x l mod n; l, n public. Inverse problem given y, find x with x l = y mod n believed hard. Trapdoor function: n = pq with p, q large primes, secret key k with kl = 1 mod (p 1)(q 1), d(y) = y k mod n. Behrang Noohi (QMUL) 15 / 18
48 Public key cryptography Diffie-Hellman idea: method where key is public knowledge?! How could this possibly work? One-way function e: computing e(x) easy; computing d(y) = e 1 (y) hard. RSA cryptosystem: power map e(x) = x l mod n; l, n public. Inverse problem given y, find x with x l = y mod n believed hard. Trapdoor function: n = pq with p, q large primes, secret key k with kl = 1 mod (p 1)(q 1), d(y) = y k mod n. Behrang Noohi (QMUL) 15 / 18
49 Issues in modern cryptography Message Integrity: Can Eve crucially change the meaning of a message she cannot entirely read (e.g. the amount in a bank transaction)? Digital Signatures: Eve sees some signed messages, can she forge a signature? Communication protocols: Zero-knowledge proof, Multiparty secrets, Elections, Digital cash... Behrang Noohi (QMUL) 16 / 18
50 Issues in modern cryptography Message Integrity: Can Eve crucially change the meaning of a message she cannot entirely read (e.g. the amount in a bank transaction)? Digital Signatures: Eve sees some signed messages, can she forge a signature? Communication protocols: Zero-knowledge proof, Multiparty secrets, Elections, Digital cash... Behrang Noohi (QMUL) 16 / 18
51 Issues in modern cryptography Message Integrity: Can Eve crucially change the meaning of a message she cannot entirely read (e.g. the amount in a bank transaction)? Digital Signatures: Eve sees some signed messages, can she forge a signature? Communication protocols: Zero-knowledge proof, Multiparty secrets, Elections, Digital cash... Behrang Noohi (QMUL) 16 / 18
52 Conclusion Cryptography concerns secure communication. Unlike steganography (making the message obscure), the assumption (Kerckhoffs Principle) is Eve knows the system; only the key is secret. Ciphers are various methods of using the secret key to encrypt/decrypt a message, e.g. Substitution, Vigenere, Permutation,... Security is always relative to computational power, and in fear of an ingenious unforseen attack. Public Key Cryptography provides great flexibility, but its security is only empirical. Modern cryptography has evolved into a diverse field of theoretical and practical research. Behrang Noohi (QMUL) 17 / 18
53 Conclusion Cryptography concerns secure communication. Unlike steganography (making the message obscure), the assumption (Kerckhoffs Principle) is Eve knows the system; only the key is secret. Ciphers are various methods of using the secret key to encrypt/decrypt a message, e.g. Substitution, Vigenere, Permutation,... Security is always relative to computational power, and in fear of an ingenious unforseen attack. Public Key Cryptography provides great flexibility, but its security is only empirical. Modern cryptography has evolved into a diverse field of theoretical and practical research. Behrang Noohi (QMUL) 17 / 18
54 Conclusion Cryptography concerns secure communication. Unlike steganography (making the message obscure), the assumption (Kerckhoffs Principle) is Eve knows the system; only the key is secret. Ciphers are various methods of using the secret key to encrypt/decrypt a message, e.g. Substitution, Vigenere, Permutation,... Security is always relative to computational power, and in fear of an ingenious unforseen attack. Public Key Cryptography provides great flexibility, but its security is only empirical. Modern cryptography has evolved into a diverse field of theoretical and practical research. Behrang Noohi (QMUL) 17 / 18
55 Conclusion Cryptography concerns secure communication. Unlike steganography (making the message obscure), the assumption (Kerckhoffs Principle) is Eve knows the system; only the key is secret. Ciphers are various methods of using the secret key to encrypt/decrypt a message, e.g. Substitution, Vigenere, Permutation,... Security is always relative to computational power, and in fear of an ingenious unforseen attack. Public Key Cryptography provides great flexibility, but its security is only empirical. Modern cryptography has evolved into a diverse field of theoretical and practical research. Behrang Noohi (QMUL) 17 / 18
56 Conclusion Cryptography concerns secure communication. Unlike steganography (making the message obscure), the assumption (Kerckhoffs Principle) is Eve knows the system; only the key is secret. Ciphers are various methods of using the secret key to encrypt/decrypt a message, e.g. Substitution, Vigenere, Permutation,... Security is always relative to computational power, and in fear of an ingenious unforseen attack. Public Key Cryptography provides great flexibility, but its security is only empirical. Modern cryptography has evolved into a diverse field of theoretical and practical research. Behrang Noohi (QMUL) 17 / 18
57 Thank you! I thank Peter Keevash for letting me use a modified version of his slides. Behrang Noohi (QMUL) 18 / 18
Traditional Symmetric-Key Ciphers. A Biswas, IT, BESU Shibpur
Traditional Symmetric-Key Ciphers A Biswas, IT, BESU Shibpur General idea of symmetric-key cipher The original message from Alice to Bob is called plaintext; the message that is sent through the channel
More informationChapter 3 Traditional Symmetric-Key Ciphers 3.1
Chapter 3 Traditional Symmetric-Key Ciphers 3.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 3 Objectives To define the terms and the concepts of symmetric
More informationL2. An Introduction to Classical Cryptosystems. Rocky K. C. Chang, 23 January 2015
L2. An Introduction to Classical Cryptosystems Rocky K. C. Chang, 23 January 2015 This and the next set of slides 2 Outline Components of a cryptosystem Some modular arithmetic Some classical ciphers Shift
More informationClassical Encryption Techniques. CSS 322 Security and Cryptography
Classical Encryption Techniques CSS 322 Security and Cryptography Contents Terminology and Models Requirements, Services and Attacks Substitution Ciphers Caesar, Monoalphabetic, Polyalphabetic, One-time
More informationCryptography and Network Security 2. Symmetric Ciphers. Lectured by Nguyễn Đức Thái
Cryptography and Network Security 2. Symmetric Ciphers Lectured by Nguyễn Đức Thái Outline Symmetric Encryption Substitution Techniques Transposition Techniques Steganography 2 Symmetric Encryption There
More informationCryptography Introduction to Computer Security. Chapter 8
Cryptography Introduction to Computer Security Chapter 8 Introduction Cryptology: science of encryption; combines cryptography and cryptanalysis Cryptography: process of making and using codes to secure
More informationClassical Encryption Techniques
Encryption CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L02, Steve/Courses/2011/S2/CSS322/Lectures/classical.tex,
More informationSome Stuff About Crypto
Some Stuff About Crypto Adrian Frith Laboratory of Foundational Aspects of Computer Science Department of Mathematics and Applied Mathematics University of Cape Town This work is licensed under a Creative
More informationClassical Cryptography
Classical Cryptography Chester Rebeiro IIT Madras STINSON : chapter 1 Ciphers Symmetric Algorithms Encryption and Decryption use the same key i.e. K E = K D Examples: Block Ciphers : DES, AES, PRESENT,
More informationChapter 2: Classical Encryption Techniques
CPE 542: CRYPTOGRAPHY & NETWORK SECURITY Chapter 2: Classical Encryption Techniques Dr. Lo ai Tawalbeh Computer Engineering Department Jordan University of Science and Technology Jordan Introduction Basic
More informationPART I Symmetric Ciphers
PART I Symmetric Ciphers CHAPTER 2 Classical Encryption Techniques Cryptography, Cryptanalysis Caesar cipher, Monoalphabetic ciphers Playfair cipher, Hill cipher Polyalphabetic ciphers One-time Pad 2.3
More informationA Tour of Classical and Modern Cryptography
A Tour of Classical and Modern Cryptography Evan P. Dummit University of Rochester May 25, 2016 Outline Contents of this talk: Overview of cryptography (what cryptography is) Historical cryptography (how
More informationIntroduction to Cryptography CS 136 Computer Security Peter Reiher October 9, 2014
Introduction to Cryptography CS 136 Computer Security Peter Reiher October 9, 2014 Page 1 Outline What is data encryption? Cryptanalysis Basic encryption methods Substitution ciphers Permutation ciphers
More informationCSCI 454/554 Computer and Network Security. Topic 2. Introduction to Cryptography
CSCI 454/554 Computer and Network Security Topic 2. Introduction to Cryptography Outline Basic Crypto Concepts and Definitions Some Early (Breakable) Cryptosystems Key Issues 2 Basic Concepts and Definitions
More informationCRYPTOLOGY KEY MANAGEMENT CRYPTOGRAPHY CRYPTANALYSIS. Cryptanalytic. Brute-Force. Ciphertext-only Known-plaintext Chosen-plaintext Chosen-ciphertext
CRYPTOLOGY CRYPTOGRAPHY KEY MANAGEMENT CRYPTANALYSIS Cryptanalytic Brute-Force Ciphertext-only Known-plaintext Chosen-plaintext Chosen-ciphertext 58 Types of Cryptographic Private key (Symmetric) Public
More informationOutline Basics of Data Encryption CS 239 Computer Security January 24, 2005
Outline Basics of Data Encryption CS 239 Computer Security January 24, 2005 What is data encryption? Basic encryption mechanisms Stream and block ciphers Characteristics of good ciphers Page 1 Page 2 Data
More informationBasic Concepts and Definitions. CSC/ECE 574 Computer and Network Security. Outline
CSC/ECE 574 Computer and Network Security Topic 2. Introduction to Cryptography 1 Outline Basic Crypto Concepts and Definitions Some Early (Breakable) Cryptosystems Key Issues 2 Basic Concepts and Definitions
More informationSubstitution Ciphers, continued. 3. Polyalphabetic: Use multiple maps from the plaintext alphabet to the ciphertext alphabet.
Substitution Ciphers, continued 3. Polyalphabetic: Use multiple maps from the plaintext alphabet to the ciphertext alphabet. Non-periodic case: Running key substitution ciphers use a known text (in a standard
More informationCryptography Symmetric Cryptography Asymmetric Cryptography Internet Communication. Telling Secrets. Secret Writing Through the Ages.
Telling Secrets Secret Writing Through the Ages William Turner Department of Mathematics & Computer Science Wabash College Crawfordsville, IN 47933 Tuesday 4 February 2014 W. J. Turner Telling Secrets
More informationOutline. Cryptography. Encryption/Decryption. Basic Concepts and Definitions. Cryptography vs. Steganography. Cryptography: the art of secret writing
Outline CSCI 454/554 Computer and Network Security Basic Crypto Concepts and Definitions Some Early (Breakable) Cryptosystems Key Issues Topic 2. Introduction to Cryptography 2 Cryptography Basic Concepts
More informationENGR/CS 101 CS Session Lecture 5
ENGR/CS 101 CS Session Lecture 5 No programming today Submission system will be demonstrated at the end of class. Lecture 5 ENGR/CS 101 Computer Science Session 1 Outline Problem: How to send a secret
More informationUNIT - II Traditional Symmetric-Key Ciphers. Cryptography & Network Security - Behrouz A. Forouzan
UNIT - II Traditional Symmetric-Key Ciphers 1 Objectives To define the terms and the concepts of symmetric key ciphers To emphasize the two categories of traditional ciphers: substitution and transposition
More informationClassical Encryption Techniques
Classical Encryption Techniques Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse571-14/
More informationNature Sunday Academy Lesson Plan
Title Computer Security Description: Nature Sunday Academy Lesson Plan 2013-14 The objective of the lesson plan aims to help students to understand the general goals of security, the essential concerns
More informationStudy Guide to Mideterm Exam
YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467b: Cryptography and Computer Security Handout #7 Professor M. J. Fischer February 20, 2012 Study Guide to Mideterm Exam For the exam, you are responsible
More informationClassical Cryptography. Thierry Sans
Classical Cryptography Thierry Sans Example and definitions of a cryptosystem Caesar Cipher - the oldest cryptosystem A shift cipher attributed to Julius Caesar (100-44 BC) MEET ME AFTER THE TOGA PARTY
More informationCSC 580 Cryptography and Computer Security
CSC 580 Cryptography and Computer Security Encryption Concepts, Classical Crypto, and Binary Operations January 30, 2018 Overview Today: Cryptography concepts and classical crypto Textbook sections 3.1,
More informationPublic Key Cryptography
graphy CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L07, Steve/Courses/2011/S2/CSS322/Lectures/rsa.tex,
More information2
1 2 3 4 5 Basic Terminology plaintext - the original message ciphertext - the coded message cipher - algorithm for transforming plaintext to ciphertext key - info used in cipher known only to sender/receiver
More informationGreat Theoretical Ideas in Computer Science. Lecture 27: Cryptography
15-251 Great Theoretical Ideas in Computer Science Lecture 27: Cryptography What is cryptography about? Adversary Eavesdropper I will cut his throat I will cut his throat What is cryptography about? loru23n8uladjkfb!#@
More informationCSCE 715: Network Systems Security
CSCE 715: Network Systems Security Chin-Tser Huang huangct@cse.sc.edu University of South Carolina 01/20/2015 2 Cryptography Study of schemes used for encryption Can be characterized by type of encryption
More informationICT 6541 Applied Cryptography. Hossen Asiful Mustafa
ICT 6541 Applied Cryptography Hossen Asiful Mustafa Basic Communication Alice talking to Bob Alice Bob 2 Eavesdropping Eve listening the conversation Alice Bob 3 Secure Communication Eve listening the
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Lecture 6 Michael J. Fischer Department of Computer Science Yale University January 27, 2010 Michael J. Fischer CPSC 467b, Lecture 6 1/36 1 Using block ciphers
More informationT H E U N I V E R S I T Y O F B R I T I S H C O L U M B I A. Introduction to Cryptography
T H E U N I V E R S I T Y O F B R I T I S H C O L U M B I A Introduction to Cryptography 1 Module Outline Historical background Classic ciphers One-time pad The Random Oracle model Random functions: Hash
More informationCryptography and Network Security
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown Basic Terminology plaintext - the original message ciphertext - the coded message cipher - algorithm
More informationCLASSICAL CRYPTOGRAPHY. A Brief Reference for Self Build Crypto assignment
CLASSICAL CRYPTOGRAPHY A Brief Reference for Self Build Crypto assignment CLASSICAL CRYPTOGRAPHY Cryptography is the study of secret (crypto-) writing (-graphy) Concerned with developing algorithms which
More informationUNIT 2 CLASSICAL ENCRYPTION TECHNIQUES
CRYPTOGRAPHY AND NETWORK SECURITY UNIT 2 UNIT 2 CLASSICAL ENCRYPTION TECHNIQUES SYMMETRIC ENCRYPTION SOME BASIC TERMINOLOGY or conventional / private-key / single-key sender and recipient share a common
More informationCryptography. Intercepting Information Scenario 1. Tuesday, December 9, December 9, Wireless broadcasts information using radio signals
Cryptography December 9, 2008 1 Intercepting Information Scenario 1 Wireless broadcasts information using radio signals Any computer on a wireless network CAN listen to any network traffic http://www.geeksquad.com/
More informationCryptography MIS
Cryptography MIS-5903 http://community.mis.temple.edu/mis5903sec011s17/ Cryptography History Substitution Monoalphabetic Polyalphabetic (uses multiple alphabets) uses Vigenere Table Scytale cipher (message
More informationLecture IV : Cryptography, Fundamentals
Lecture IV : Cryptography, Fundamentals Internet Security: Principles & Practices John K. Zao, PhD (Harvard) SMIEEE Computer Science Department, National Chiao Tung University Spring 2012 Basic Principles
More informationIntroduction to Cryptography
Introduction to Cryptography Jiyou Li lijiyou at sjtu.edu.cn Department of Mathematics, Shanghai Jiao Tong University Sep. 17th, 2013 Cryptography Cryptography: the art and science of keeping message secure.
More informationCSCE 813 Internet Security Symmetric Cryptography
CSCE 813 Internet Security Symmetric Cryptography Professor Lisa Luo Fall 2017 Previous Class Essential Internet Security Requirements Confidentiality Integrity Authenticity Availability Accountability
More informationCryptography. Submitted to:- Ms Poonam Sharma Faculty, ABS,Manesar. Submitted by:- Hardeep Gaurav Jain
Cryptography Submitted to:- Ms Poonam Sharma Faculty, ABS,Manesar Submitted by:- Hardeep Gaurav Jain Cryptography Cryptography, a word with Greek origins, means "secret writing." However, we use the term
More informationCryptography Symmetric Encryption Class 2
Cryptography Symmetric Encryption Class 2 Stallings: Ch 3 & 6 Stallings: Ch 4 CEN-5079: 18.January.2018 1 Symmetric Cryptosystems Encryption Key Decryption Key Plaintext Plaintext Encryption Algorithm
More informationComputer Security. 08r. Pre-exam 2 Last-minute Review Cryptography. Paul Krzyzanowski. Rutgers University. Spring 2018
Computer Security 08r. Pre-exam 2 Last-minute Review Cryptography Paul Krzyzanowski Rutgers University Spring 2018 March 26, 2018 CS 419 2018 Paul Krzyzanowski 1 Cryptographic Systems March 26, 2018 CS
More informationOverview of Conventional Encryption Techniques
Overview of Conventional Encryption Techniques Shadab Pasha CDGI,Indore shadabpasha@gmail.com Abstract: Symmetric Encryption or Single-key Encryption or Conventional Encryption was only the type of encryption
More informationCryptography and Network Security
Cryptography and Network Security Spring 2012 http://users.abo.fi/ipetre/crypto/ Lecture 14: Folklore, Course summary, Exam requirements Ion Petre Department of IT, Åbo Akademi University 1 Folklore on
More informationCSEC 507: APPLIED CRYPTOLOGY Historical Introduction to Cryptology
CSEC 507: APPLIED CRYPTOLOGY Middle East Technical University Ankara, Turkey Last Modified: December 9, 2015 Created: August 5, 2015 What is Cryptology, Cryptography, and Cryptanalysis? (A Short) Definition
More informationCryptography and Network Security Chapter 2
Cryptography and Network Security Chapter 2 Fourth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 2 Classical Encryption Techniques Many savages at the present day regard their names
More informationIntroduction to Network Security Missouri S&T University CPE 5420 Cryptology Overview
Introduction to Network Security Missouri S&T University CPE 5420 Cryptology Overview Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science
More information10/3/2017. Cryptography and Network Security. Sixth Edition by William Stallings
Cryptography and Network Security Sixth Edition by William Stallings 1 Chapter 2 Classical Encryption Techniques "I am fairly familiar with all the forms of secret writings, and am myself the author of
More informationA different kind of Crypto
A different kind of Crypto Parker Schmitt November 16, 2014 1 Contents 1 Introduction 3 2 A brief discussion of modern crypto 3 2.1 How modern (non-payload) crypto works............. 4 2.2 Known Plaintext
More informationTextbook: Ahmet Burak Can Hacettepe University. Supplementary books:
Basic Ciphers Ahmet Burak Can Hacettepe University abc@hacettepe.edu.tr Books Textbook: Network Security: Private Communication in a Public World, 2nd Edition. C. Kaufman, R. Perlman, and M. Speciner,
More informationIntroduction to Cryptography. Lecture 1. Benny Pinkas. Administrative Details. Bibliography. In the Library
Administrative Details Introduction to Cryptography Lecture 1 Benny Pinkas Grade Exam 75% Homework 25% (might include programming) Office hours: Wednesday, 12-13. Email: benny@cs.haifa.ac.il Web page:
More informationIntroduction to Cryptography. Lecture 1
Introduction to Cryptography Lecture 1 Benny Pinkas page 1 1 Administrative Details Grade Exam 75% Homework 25% (might include programming) Office hours: Wednesday, 12-13. Email: benny@cs.haifa.ac.il Web
More informationSecurity: Cryptography
Security: Cryptography Computer Science and Engineering College of Engineering The Ohio State University Lecture 38 Some High-Level Goals Confidentiality Non-authorized users have limited access Integrity
More informationEEC-484/584 Computer Networks
EEC-484/584 Computer Networks Lecture 23 wenbing@ieee.org (Lecture notes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of last lecture Introduction to
More informationMaking and Breaking Ciphers
Making and Breaking Ciphers Ralph Morelli Trinity College, Hartford (ralph.morelli@trincoll.edu) Smithsonian Institute October 31, 2009 2009 Ralph Morelli You are free to reuse and remix this presentation
More informationChapter 3. Cryptography. Information Security/System Security p. 33/617
Chapter 3 Cryptography Information Security/System Security p. 33/617 Introduction A very important tool for security is cryptography Cryptography is the (art and) science of keeping information secure
More informationCS61A Lecture #39: Cryptography
Announcements: CS61A Lecture #39: Cryptography Homework 13 is up: due Monday. Homework 14 will be judging the contest. HKN surveys on Friday: 7.5 bonus points for filling out their survey on Friday (yes,
More information2/7/2013. CS 472 Network and System Security. Mohammad Almalag Lecture 2 January 22, Introduction To Cryptography
CS 472 Network and System Security Mohammad Almalag malmalag@cs.odu.edu Lecture 2 January 22, 2013 Introduction To Cryptography 1 Definitions Cryptography = the science (art) of encryption Cryptanalysis
More informationJNTU World JNTU World. JNTU World. Cryptography and Network Security. Downloaded From JNTU World (http://(http:// )(http:// )JNTU World
Cryptography and Network Security )(http:// ) Downloaded From (http://(http:// )(http:// ) Downloaded From (http://(http:// Introduction The art of war teaches us not on the likelihood of the enemy s not
More informationCryptography and Network Security. Lecture 02 Symmetric Encryption. Ediz ŞAYKOL
Cryptography and Network Security Lecture 02 Symmetric Encryption Ediz ŞAYKOL Symmetric Encryption or conventional / private-key / single-key sender and recipient share a common key all classical encryption
More informationCryptographic Techniques. Information Technologies for IPR Protections 2003/11/12 R107, CSIE Building
Cryptographic Techniques Information Technologies for IPR Protections 2003/11/12 R107, CSIE Building Outline Data security Cryptography basics Cryptographic systems DES RSA C. H. HUANG IN CML 2 Cryptography
More informationIntroduction to Cryptography. Vasil Slavov William Jewell College
Introduction to Cryptography Vasil Slavov William Jewell College Crypto definitions Cryptography studies how to keep messages secure Cryptanalysis studies how to break ciphertext Cryptology branch of mathematics,
More informationRSA. Public Key CryptoSystem
RSA Public Key CryptoSystem DIFFIE AND HELLMAN (76) NEW DIRECTIONS IN CRYPTOGRAPHY Split the Bob s secret key K to two parts: K E, to be used for encrypting messages to Bob. K D, to be used for decrypting
More informationCSC 474/574 Information Systems Security
CSC 474/574 Information Systems Security Topic 2.1 Introduction to Cryptography CSC 474/574 By Dr. Peng Ning 1 Cryptography Cryptography Original meaning: The art of secret writing Becoming a science that
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 3 January 13, 2012 CPSC 467b, Lecture 3 1/36 Perfect secrecy Caesar cipher Loss of perfection Classical ciphers One-time pad Affine
More informationComputer Security. 08. Cryptography Part II. Paul Krzyzanowski. Rutgers University. Spring 2018
Computer Security 08. Cryptography Part II Paul Krzyzanowski Rutgers University Spring 2018 March 23, 2018 CS 419 2018 Paul Krzyzanowski 1 Block ciphers Block ciphers encrypt a block of plaintext at a
More informationCryptography Basics. IT443 Network Security Administration Slides courtesy of Bo Sheng
Cryptography Basics IT443 Network Security Administration Slides courtesy of Bo Sheng 1 Outline Basic concepts in cryptography systems Secret key cryptography Public key cryptography Hash functions 2 Encryption/Decryption
More informationCryptosystems. Truong Tuan Anh CSE-HCMUT
Cryptosystems Truong Tuan Anh CSE-HCMUT anhtt@hcmut.edu.vn 2 In This Lecture Cryptography Cryptosystem: Definition Simple Cryptosystem Shift cipher Substitution cipher Affine cipher Cryptanalysis Cryptography
More informationModule 13 Network Security. Version 1 ECE, IIT Kharagpur
Module 13 Network Security Lesson 40 Network Security 13.1.1 INTRODUCTION Network Security assumes a great importance in the current age. In this chapter we shall look at some of the security measures
More informationSecrets & Lies, Knowledge & Trust. (Modern Cryptography) COS 116 4/20/2006 Instructor: Sanjeev Arora
Secrets & Lies, Knowledge & Trust. (Modern Cryptography) COS 116 4/20/2006 Instructor: Sanjeev Arora Cryptography: 1 :secret writing 2:the enciphering and deciphering of messages in secret code or cipher
More information9/30/2016. Cryptography Basics. Outline. Encryption/Decryption. Cryptanalysis. Caesar Cipher. Mono-Alphabetic Ciphers
Cryptography Basics IT443 Network Security Administration Slides courtesy of Bo Sheng Basic concepts in cryptography systems Secret cryptography Public cryptography 1 2 Encryption/Decryption Cryptanalysis
More informationDr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010
CS 494/594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2010 1 Public Key Cryptography Modular Arithmetic RSA
More informationLecture 02: Historical Encryption Schemes. Lecture 02: Historical Encryption Schemes
What is Encryption Parties involved: Alice: The Sender Bob: The Receiver Eve: The Eavesdropper Aim of Encryption Alice wants to send a message to Bob The message should remain hidden from Eve What distinguishes
More information2.1 Basic Cryptography Concepts
ENEE739B Fall 2005 Part 2 Secure Media Communications 2.1 Basic Cryptography Concepts Min Wu Electrical and Computer Engineering University of Maryland, College Park Outline: Basic Security/Crypto Concepts
More informationCryptography BITS F463 S.K. Sahay
Cryptography BITS F463 S.K. Sahay BITS-Pilani, K.K. Birla Goa Campus, Goa S.K. Sahay Cryptography 1 Terminology Cryptography: science of secret writing with the goal of hiding the meaning of a message.
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 6 January 25, 2012 CPSC 467b, Lecture 6 1/46 Byte padding Chaining modes Stream ciphers Symmetric cryptosystem families Stream ciphers
More informationAPNIC elearning: Cryptography Basics
APNIC elearning: Cryptography Basics 27 MAY 2015 03:00 PM AEST Brisbane (UTC+10) Issue Date: Revision: Introduction Presenter Sheryl Hermoso Training Officer sheryl@apnic.net Specialties: Network Security
More informationPolyalphabetic cyphers
Unit 7 January 26, 2011 1 Polyalphabetic cyphers Let E 1, E 2,..., E n be distinct substitution cyphers. To encrypt a plaintext message P = p 1 p 2 p 3... apply the E i (i = 1,..., n) cyclically to the
More informationMath236 Discrete Maths with Applications
Math236 Discrete Maths with Applications P. Ittmann UKZN, Pietermaritzburg Semester 1, 2012 Ittmann (UKZN PMB) Math236 2012 1 / 1 Block Ciphers A block cipher is an encryption scheme in which the plaintext
More informationCryptography Worksheet
Cryptography Worksheet People have always been interested in writing secret messages. In ancient times, people had to write secret messages to keep messengers and interceptors from reading their private
More informationIntroduction to Cryptography. In the News: Hacker exposes embassies'
T H E U N I V E R S I T Y O F B R I T I S H C O L U M B I A Introduction to Cryptography EECE 412 Copyright 2004-2007 Konstantin Beznosov In the News: Hacker exposes embassies' e-mail A Swedish security
More informationModule 1: Classical Symmetric Ciphers
Module 1: Classical Symmetric Ciphers Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University E-mail: natarajan.meghanathan@jsums.edu Introduction to Cryptography Terms and Concepts
More informationExploring Cryptography Using CrypTool
NEMATYC 2018 Exploring Cryptography Using CrypTool Valeria D Orazio Massachusetts Maritime Academy Importance of Cryptography 1998 Project start Originated as an internal business application for information
More informationOVE EDFORS ELECTRICAL AND INFORMATION TECHNOLOGY
1 Information Transmission Chapter 6 Cryptology OVE EDFORS ELECTRICAL AND INFORMATION TECHNOLOGY Learning outcomes After this lecture the student should undertand what cryptology is and how it is used,
More informationCHAPTER 1 INTRODUCTION TO CRYPTOGRAPHY. Badran Awad Computer Department Palestine Technical college
CHAPTER 1 INTRODUCTION TO CRYPTOGRAPHY Badran Awad Computer Department Palestine Technical college CHAPTER 1 Introduction Historical ciphers Information theoretic security Computational security Cryptanalysis
More informationLecture 1: Perfect Security
CS 290G (Fall 2014) Introduction to Cryptography Oct 2nd, 2014 Instructor: Rachel Lin 1 Recap Lecture 1: Perfect Security Scribe: John Retterer-Moore Last class, we introduced modern cryptography and gave
More informationLecture 2. Cryptography: History + Simple Encryption,Methods & Preliminaries. Cryptography can be used at different levels
Lecture 2 Cryptography: History + Simple Encryption,Methods & Preliminaries 1 Cryptography can be used at different levels algorithms: encryption, signatures, hashing, RNG protocols (2 or more parties):
More informationCS 4770: Cryptography. CS 6750: Cryptography and Communication Security. Alina Oprea Associate Professor, CCIS Northeastern University
CS 4770: Cryptography CS 6750: Cryptography and Communication Security Alina Oprea Associate Professor, CCIS Northeastern University January 8 2018 Introductions NEU, CCIS Since 2016 Carnegie Mellon University
More information7. Symmetric encryption. symmetric cryptography 1
CIS 5371 Cryptography 7. Symmetric encryption symmetric cryptography 1 Cryptographic systems Cryptosystem: t (MCKK GED) (M,C,K,K,G,E,D) M, plaintext message space C, ciphertext message space K, K, encryption
More informationUzzah and the Ark of the Covenant
Uzzah and the Ark of the Covenant And when they came to the threshing floor of Chidon, Uzzah put out his hand to take hold of the ark, for the oxen stumbled. 10 And the anger of the LORD was kindled against
More informationCryptography Intro and RSA
Cryptography Intro and RSA Well, a gentle intro to cryptography, followed by a description of public key crypto and RSA. 1 Definition Cryptology is the study of secret writing Concerned with developing
More informationIntroduction to Software Security Crypto Basics (Chapter 2)
Introduction to Software Security Crypto Basics (Chapter 2) Seong-je Cho Spring 2018 Computer Security & Operating Systems Lab, DKU Textbook Sources / References M. T. Goodrich and R. Tamassia, Introduction
More informationCryptography Part II Introduction to Computer Security. Chapter 8
Cryptography Part II Introduction to Computer Security Chapter 8 Vigènere Cipher Like Cæsar cipher, but use phrase Example Message: THE BOY HAS THE BALL Key: VIG Encipher using Cæsar cipher for each letter:
More informationIntroduction to Cryptology. Lecture 2
Introduction to Cryptology Lecture 2 Announcements Access to Canvas? 2 nd Edition vs. 1 st Edition HW1 due on Tuesday, 2/7 Discrete Math Readings/Quizzes on Canvas due on Tuesday, 2/14 Agenda Last time:
More informationA (Brief) History of Cryptography
Caesar Cipher A (Brief) History of Cryptography Ozalp Babaoglu A substitution cipher Each letter of the plaintext is replaced by a unique letter in the ciphertext Which letter? In the case of Caesar Cipher,
More informationIntroduction. CSE 5351: Introduction to cryptography Reading assignment: Chapter 1 of Katz & Lindell
Introduction CSE 5351: Introduction to cryptography Reading assignment: Chapter 1 of Katz & Lindell 1 Cryptography Merriam-Webster Online Dictionary: 1. secret writing 2. the enciphering and deciphering
More informationPublic Key Cryptography and RSA
Public Key Cryptography and RSA Major topics Principles of public key cryptosystems The RSA algorithm The Security of RSA Motivations A public key system is asymmetric, there does not have to be an exchange
More information