Assignment 9 / Cryptography
|
|
- Warren Barber
- 5 years ago
- Views:
Transcription
1 Assignment 9 / Cryptography Michael Hauser March 2002 Tutor: Mr. Schmidt Course: M.Sc Distributed Systems Engineering Lecturer: Mr. Owens
2 CONTENTS Contents 1 Introduction 3 2 Simple Ciphers Vignère encryption The meaning of the index of coincidence The minimum value of the index of coincidence Why is this value useful for a code breaker A strategic way for a ciphertext only attack Symmetric-Key Encryption DES encryption Time needed for a brute force attack on DES Feistel ladder Feistel ladders / encryption and decryption IDEA Time needed for a brute force attack on IDEA Public-Key Encryption RSA RSA key generation RSA mathematical RSA block size Calculating a secret key value Encrypting Why not all values for p work RSA Cracking RSA Mathematical hard problem Public-Key based Protocols Shamir s No-Key Protocol Maths for Shamir s No-Key Protocol Message Authentication Message authentication as digital signature Demands for message authentication Steganography Hiding a message in an audio file Other applications for steganography Securing steganography Conclusion 15 A Source code for the RSA crack 16 2
3 1 Introduction 1 Introduction This assignment will treat different cryptographic methods. With the aid of a visual programming tool called Cantata the encryption methods and protocols can be build without writing code. The results of the experiments will be presented here. 2 Simple Ciphers 2.1 Vignère encryption This section is about the Vignère cipher. The Vignère cipher is a polyalphabetic cipher which uses a key word to select from a set of alphabets. Figure 1 shows the Cantata-model of a Vignère encryption, decryption and a crack. The two reader-glyphs on the left are used to read the message and the secret key from a text file. The inputs are feed into a encryption glyph that implements Vignère encryption. The encrypted message can be shown with a viewer-glyph. It is also the input of the decrypt-glyph and the crack-glyph. The decryption-glyph forwards it output to a viewer where it can be compared to the message that has been encrypted. As a second input the crack-glyph takes file statistics about the message. The Kasiski test guesses a key-length from the encrypted text which is needed to crack the cipher. Figure 1: Vignère encryption with Cantata The meaning of the index of coincidence The index of coincidence is calculated by adding the squares of the probabilities of the symbols of a given alphabet according to the following formula: 3
4 2.1 Vignère encryption I c = n p(α) 2 i=1 n is the number of symbols in the alphabet and α is the probability of a symbol. The result I c is called index of coincidence. It is a measurement for the evenness of the distribution of the characters where lower values indicate a more even distribution The minimum value of the index of coincidence The index of coincidence of an alphabet with n symbols can reach from 1/n to 1, where a result of 1/n means an absolute even distribution of all symbols and a value of 1 means a completely skewed distribution, where only one of the n possible symbols occurs Why is this value useful for a code breaker The value of I c is the probability that two characters are the same if they are chosen at random according to the distribution [1]. By further consideration of the message statistics it is possible to use this value to obtain the period (length of the keyword) which is essential for breaking polyalphabetic ciphers like this A strategic way for a ciphertext only attack To break this cipher with a cipher text only attack the Kasiski test can be used to guess the period which is the length of the key. With this knowledge of the key the encrypted text can be written in a two-dimensional array with l columns, where l is the length of the key. Now each column contains a string of symbols which was encrypted by a mono alphabetic cipher and can be decrypted accordingly. 4
5 3 Symmetric-Key Encryption 3 Symmetric-Key Encryption 3.1 DES encryption Figure 2 shows usage of DES modeled with Cantata. A reader-glyph is used to read a text file. This data plus the key is forwarded to the DES encryption-glyph of Cantata. The encrypted message can be viewed using a viewer-glyph. To decrypt the message the encryption-glyph uses the generated key plus the encrypted data. Figure 2: DES encryption with Cantata Time needed for a brute force attack on DES There are 2 56 possible keys in DES 1, so it would take: s = s That is approximately 2.3 years to test all possible keys (worst case) if every nanosecond one key can be tested Feistel ladder Figure 3 shows one round of a DES Feistel ladder. The E-Box expands its 32 bit input to 48 bits by permuting the bits and repeating some of them. The main purpose of this is to ensure that each input bit can affect the result of more than one S-Box [1]. This ensures that after a few rounds each output bit depends on every input bit. An additional purpose of the E-Box is to make the output the same size as the key for the XOR-operation. The resulting 48 bit-string can easily be compressed again by the S-Box. The S-Box 2 performs some nonlinear transformations on its input. Within the S-Box the 48 bit input is split up into 8 blocks of 6 bit. Each 6 bit 1 The key itself is 56 bits long, to achieve the block-size of 64 bits parity bits are added every 7 bits 2 Substitution Box 5
6 3.1 DES encryption block is mapped to a 4 bit result. Thus the output is 32 bit again. The S-box is the most important element of the DES-Cipher, most effort in designing DES was spent in designing the S-Boxes. Finally the P-Box 3 permutes the result. Figure 3: One step of a DES Feistel ladder Feistel ladders / encryption and decryption The input bits are divided into blocks of 2 n bits. These blocks are again divided into 2 n 1 bit blocks. On the second block (Rn) the function f S,i (Rn) and the XOR operation with L n is performed which results in R n+1. Additionally this block is copied to L n+1. This shows that the information of the first block L n is encrypted using the operation f S,i performed on R n. For the encryption the following formulas are applied: L i+1 = R i R i+1 = L i f S,i (R i ) The decryption uses the following formulas: R i = L i+1 L i = L i f S,i (R i ) = R i+1 f S,i (R i ) 3 Permutation Box 6
7 3.2 IDEA 3.2 IDEA IDEA 4 is a block oriented method which uses 128 bit keys and text blocks of 64 bits. It uses a Feistel ladder which is executed in eight rounds. At the end of the eighth round a transformation is done so that the same algorithm can be used for the decryption. Figure 4 shows the Cantata model of an IDEA encryption and decryption. The reader-glyph is used to read data from a text file and the BigConstglyph is used for the key. Figure 4: IDEA with Cantata Time needed for a brute force attack on IDEA IDEA uses keys with a length of 128 bit, so a brute force attack would have to check keys in the worst case. The same calculation as with DES can be applied: s = s This is approximately years to check all possible keys assuming it takes one nanosecond to check one key. 4 International Data Encryption Algorithm 7
8 4 Public-Key Encryption 4 Public-Key Encryption This section treats public key crypt algorithms which are asymmetric crypt-algorithms that are used to enable authentication and message exchange without the exchange of the secret key. 4.1 RSA 1 In figure 5 the Cantata model of RSA 5 encryption and decryption is shown. The Generate RSA-Key -glyph generates three numbers p, s and n where < p, n > is the public key and < s, n > is the private (secret) key. < p, n > is used for encryption and < s, n > for the decryption. Figure 5: RSA with Cantata RSA key generation 1. Randomly select two large primes q and r. Each approximately 512 bits long for a 1024 bit key. 2. Let n = q r. 3. Randomly choose an integer number p which is coprime to φ(n), where φ(n) = (q 1)(r 1). 4. Compute s such that ps mod φ(n) = 1. Publish < p, n > as public key and save < s, n > as your private key. The two primes q and r have to be deleted since with them it s easier for someone else to calculate the key pairs. 5 RSA Rivest, Shamir and Adleman developed a public key crypt algorithm which is used for digital data exchange and authentication. 8
9 4.1 RSA RSA mathematical If RSA is working correctly it will fulfill the following equation which says that the decrypted message m has to be equal to the original message m. m = (m p mod n) s mod n = m ps mod n using the Euler equation: p s = 1 + νφ(n), ν I m = m ps mod n m = m 1+νφ(n) mod n m = m (m φ(n) ) ν mod n At this point two different cases have to be looked at: 1. The two numbers m and n have no common factors. Assuming m < n. In this case the Euler equation can be used. m = m mod n (m φ(n) ) ν mod n m = m 1 ν m = m 2. If the numbers m and n have common factors. Either m is a multiple of p or it is a multiple of q. If m is a multiple of p (m = t p) and t < q Using Fermat s Theorem: and: t q 1 mod q = 1 p p q mod q = 1 (t p 1 ) ν(q 1) mod q = 1 (p q 1 ) ν(p 1) mod q = 1 After multiplying both equations the result is: (t (p 1) ν (q 1) mod q) (p (q 1) ν (p 1) mod q = 1 This proofs that RSA works. (tp) (p 1) ν (q 1) mod q = 1 t t (p 1) ν (q 1) mod q = t pt (t (p 1) ) ν (q 1) mod (pq) = pt (tp) 1+ν (p 1) (q 1) mod (pq) = pt (tp) 1+ν φ(n) mod n = pt m ps mod n = pt = m 9
10 4.1 RSA RSA block size The block size l for RSA encryption can be calculated with the following formula: since K l < n has to be true, so l = log(n) log(k) where n is the module and K is the size of the plaintext alphabet. So with a given K of 256 (assuming ASCII encoding) and a module n of the block-size has to equal to or less than 128 symbols Calculating a secret key value The following values are known: q = 8101 r = 7951 p = 2047 Using the method described in subsection the secret key can be calculated. s has to be chosen so that ps mod φ(n) = 1. First φ(n) is calculated. φ(n) = (q 1) (r 1) = (8101 1) (7951 1) = Using a Java program which allows calculations with big numbers the value of s can be calculated. The program delivers s = Encrypting 1234 To encrypt data the following formula is used: c = m p mod n = mod ( ) = Again this is done with a Java program that uses BigInteger Why not all values for p work p has to be coprime to to φ(n). But 2048 is not coprime to n since is has common factors with φ(n). So it can not be used as a part of the public key. 10
11 4.2 RSA RSA 2 Figure 6 shows the Cantata model of RSA encryption and decryption. The glyphs that Cantata provides are not used. All calculations are done with normal mathematical functions. Figure 6: RSA by hand with Cantata Cracking RSA What is difficult about cracking RSA is the factoring of n. If n is big enough this takes a very long time since there exists no method besides a brute force attack. The Java program that was written to crack the relatively small keys from question 5 of the assignment can be found in the appendix Mathematical hard problem Calculating the secret key is a mathematical hard problem, because there is no know way to do an inverse operation on the known encrypted message text to generate the secret key or the source message. So the only way to find the key is by testing values in useful range. 5 Public-Key based Protocols 5.1 Shamir s No-Key Protocol In figure 7 the Cantata model of Shamir s no-key protocol which is based on a public key system can be seen. It works as follows: 1. The two parties (Bob and Alice) agree on a large prime p, which is used as the modul for encryption/decryption. 11
12 5.1 Shamir s No-Key Protocol 2. Both parties chose two numbers which have the property: ea da mod φ(p) = 1 eb db mod φ(p) = 1 Where φ(p) is the Euler function. The two numbers have to be kept secret. 3. Alice encrypts a message using c = m ea mod p and sends the encrypted message to Bob 4. Bob encrypts the received message again using c = c eb mod p and sends c back to Alice 5. Alice decrypts the received message using m = (c ) da mod p and sends the result back to Bob 6. Bob decrypts the received message using m = (m ) d B mod p Now Bob can read the message. The part of figure 7 which has a light green background encrypts and decrypts the messages. Figure 7: Shamir s No-Key Protocol with Cantata Maths for Shamir s No-Key Protocol To show that Shamir s no-key protocol works the Euler-formula can be used: (e d) mod φ(p) = 1 e d = 1 + ν φ(p) m e d mod p = m ν φ(p) mod p m e d mod p = (m mod p) (m ν φ(p) mod p) m e d mod p = m (m φ(p) ) ν mod p m e d mod p = m (1) ν mod p m e d mod p = m 12
13 6 Message Authentication 6 Message Authentication In figure 8 the Cantata model of message authentication based on the RSA algorithm can be seen. With the Hash-glyph a MD5 check sum is calculated over the message m. The generated check sum is encrypted with the private key and sent to the receiver. The receiver then has to decrypt the transmitted check sum using the sender s public key. If the decrypted check sum is equal to the check sum calculated over the received message it is sure that the message was not changed during transmission. Figure 8: Message authentication with Cantata Message authentication as digital signature The protocol can be used for a digital signature. The hash sum that is calculated is encrypted with the sender s private key and attached to the message. Then the message is encrypted with the receiver s public key. The receiver decrypts the message using his private key and calculates the same check sum of the message and compares it to the check sum that was transmitted by decrypting it with the sender s public key. One thing that has to be sure is that only the sender has his secret key Demands for message authentication Message authentication methods have to ensure two things: First that the receiver can verify that it really was the sender he thinks and second that the content of a message can not be changed after signing. This can be realized using the procedure described above. 7 Steganography 7.1 Hiding a message in an audio file Figure 9 shows the Cantata model that reads a message, hides it in a wave file and extracts the message again. The wave file with the hidden message in it can be played to check if the changes to the sound are 13
14 7.2 Other applications for steganography audible. The message has to be hidden in the least significant bits so the only thing someone who doesn t know about the secret message may hear a slight noise. Figure 9: Steganography with Cantata 7.2 Other applications for steganography Steganography is not limited to audio files. Also images or video files can be used. Besides transferring messages without other listeners even knowing that an important message is transfered steganography can be used to watermark digital content. If this is done in a way that is not recognized by the normal user of the data in a possible later law-suit it can be proven with the help of steganography that someone is the owner of a picture or piece of music. 7.3 Securing steganography Steganography can be secured further by encrypting the message before inserting it into a picture, sound or video file, because it s easy with todays search engines in the Internet to search for an original file and calculate the difference. If the message is equally distributed over the whole content of the host file it can not be differentiated from noise, but if only for example the first half of an image is different from the original file it is very likely that something is hidden in the image. Another point is to really transfer the hole message to the receiver, because depending on the method maybe not a single bit may be altered to not loose the hole message. So ways to ensure correct transfer have to be found, else steganography is worthless. 14
15 8 Conclusion 8 Conclusion This assignment and the related exercises showed different cryptographic methods and their usage. It gave a good overview over historical methods of which the polyalphabetic cipher was cracked with relatively small effort. This is astonishing because at the first sight it seems that the Vignère encryption removes the probabilities of natural text. DES, IDEA and RSA provide sufficient security since the amount of time that is needed to crack those systems is to high. That doesn t mean that this will remain like this forever. The main difference between the public and secret key protocols is the practicability of the key exchange. A public key protocol is much more convenient since the key can be sent by to the communicating parties. With Shamir s no-key protocol exchange of data is possible without first exchanging keys. This is a good possibility if only a small amount of data has to be transfered between parties that do not communicate regularly and therefore don t want to exchange keys. The transmission of a credit card number over the Internet is an example where this protocol could be used. Message authentication has a growing importance since replaces the fax. The digital signature can provide a high level of security if it s used correctly. The idea of steganography is interesting, but if only the content and not the flow of information has to be hidden from the third persons the prior methods are better because they don t have to transport so much overhead. 15
16 A Source code for the RSA crack A Source code for the RSA crack public class CrackRSA { public static void main (String args[]) { System.out.println ("CrackRSA by mh"); if (args.length!= 2) { System.out.println ("Usage: java CrackRSA <n> <pub>"); System.exit (0); } long n = Long.parseLong (args[0]); long pub = Long.parseLong (args[1]); if (n < pub) { System.out.println ("n has to be smaller than pub"); System.exit (0); } System.out.println ("n = " + n + " pub = " + pub); // square root of n as a start point for searching the factors long start = (long) java.lang.math.sqrt (n) + 1; // only odds can be primes if ( start % 2 == 0) { start += 1; } for (long i = start ; i > 0; i = 2) { if ((n % i) == 0) { long q = n / i; long r = i; System.out.println ("q = " + q + "\nr = " + r); long phi = (q 1) (r 1); } // calculation of secret key; long s = 0; int j = 0; // find while (true) { long rest = (j pub) % phi; //public key part 2; if ( rest == 1) { s = j; break; } j++; } System.out.println ("s = " + s); return; } } System.out.println ("Failed!??\n"); 16
17 A Source code for the RSA crack } 17
18 REFERENCES References [1] Thomas Owens (Script) Coding for Compression and Data Security 18
Public Key Algorithms
Public Key Algorithms CS 472 Spring 13 Lecture 6 Mohammad Almalag 2/19/2013 Public Key Algorithms - Introduction Public key algorithms are a motley crew, how? All hash algorithms do the same thing: Take
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 information1.264 Lecture 28. Cryptography: Asymmetric keys
1.264 Lecture 28 Cryptography: Asymmetric keys Next class: Anderson chapters 20. Exercise due before class (Reading doesn t cover same topics as lecture) 1 Asymmetric or public key encryption Receiver
More informationCryptography (DES+RSA) by Amit Konar Dept. of Math and CS, UMSL
Cryptography (DES+RSA) by Amit Konar Dept. of Math and CS, UMSL Transpositional Ciphers-A Review Decryption 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 Encryption 1 2 3 4 5 6 7 8 A G O O D F R I E N D I S A T R E
More informationCSCI 454/554 Computer and Network Security. Topic 5.2 Public Key Cryptography
CSCI 454/554 Computer and Network Security Topic 5.2 Public Key Cryptography Outline 1. Introduction 2. RSA 3. Diffie-Hellman Key Exchange 4. Digital Signature Standard 2 Introduction Public Key Cryptography
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 informationChapter 9 Public Key Cryptography. WANG YANG
Chapter 9 Public Key Cryptography WANG YANG wyang@njnet.edu.cn Content Introduction RSA Diffie-Hellman Key Exchange Introduction Public Key Cryptography plaintext encryption ciphertext decryption plaintext
More informationOutline. CSCI 454/554 Computer and Network Security. Introduction. Topic 5.2 Public Key Cryptography. 1. Introduction 2. RSA
CSCI 454/554 Computer and Network Security Topic 5.2 Public Key Cryptography 1. Introduction 2. RSA Outline 3. Diffie-Hellman Key Exchange 4. Digital Signature Standard 2 Introduction Public Key Cryptography
More informationPublic Key Algorithms
Public Key Algorithms 1 Public Key Algorithms It is necessary to know some number theory to really understand how and why public key algorithms work Most of the public key algorithms are based on modular
More informationOutline. Public Key Cryptography. Applications of Public Key Crypto. Applications (Cont d)
Outline AIT 682: Network and Systems Security 1. Introduction 2. RSA 3. Diffie-Hellman Key Exchange 4. Digital Signature Standard Topic 5.2 Public Key Cryptography Instructor: Dr. Kun Sun 2 Public Key
More informationIntroduction to Cryptography and Security Mechanisms. Abdul Hameed
Introduction to Cryptography and Security Mechanisms Abdul Hameed http://informationtechnology.pk Before we start 3 Quiz 1 From a security perspective, rather than an efficiency perspective, which of the
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 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 informationRef:
Cryptography & digital signature Dec. 2013 Ref: http://cis.poly.edu/~ross/ 2 Cryptography Overview Symmetric Key Cryptography Public Key Cryptography Message integrity and digital signatures References:
More informationCSC 474/574 Information Systems Security
CSC 474/574 Information Systems Security Topic 2.5 Public Key Algorithms CSC 474/574 Dr. Peng Ning 1 Public Key Algorithms Public key algorithms covered in this class RSA: encryption and digital signature
More informationASYMMETRIC CRYPTOGRAPHY
ASYMMETRIC CRYPTOGRAPHY CONTENT: 1. Number Theory 2. One Way Function 3. Hash Function 4. Digital Signature 5. RSA (Rivest-Shamir Adleman) References: 1. Applied Cryptography, Bruce Schneier 2. Cryptography
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 informationEncryption Details COMP620
Encryption Details COMP620 Encryption is a powerful defensive weapon for free people. It offers a technical guarantee of privacy, regardless of who is running the government It s hard to think of a more
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 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 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 informationA nice outline of the RSA algorithm and implementation can be found at:
Cryptography Lab: RSA Encryption and Decryption Lab Objectives: After this lab, the students should be able to Explain the simple concepts of encryption and decryption to protect information in transmission.
More informationCryptography Functions
Cryptography Functions Lecture 3 1/29/2013 References: Chapter 2-3 Network Security: Private Communication in a Public World, Kaufman, Perlman, Speciner Types of Cryptographic Functions Secret (Symmetric)
More informationMath From Scratch Lesson 22: The RSA Encryption Algorithm
Math From Scratch Lesson 22: The RSA Encryption Algorithm W. Blaine Dowler January 2, 2012 Contents 1 What Is Encryption? 1 2 What Is RSA Encryption? 2 2.1 Key Generation............................ 2
More informationActivity Guide - Public Key Cryptography
Unit 2 Lesson 19 Name(s) Period Date Activity Guide - Public Key Cryptography Introduction This activity is similar to the cups and beans encryption we did in a previous lesson. However, instead of using
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 informationLecture 6: Overview of Public-Key Cryptography and RSA
1 Lecture 6: Overview of Public-Key Cryptography and RSA Yuan Xue In this lecture, we give an overview to the public-key cryptography, which is also referred to as asymmetric cryptography. We will first
More informationChannel Coding and Cryptography Part II: Introduction to Cryptography
Channel Coding and Cryptography Part II: Introduction to Cryptography Prof. Dr.-Ing. habil. Andreas Ahrens Communications Signal Processing Group, University of Technology, Business and Design Email: andreas.ahrens@hs-wismar.de
More informationEncryption. INST 346, Section 0201 April 3, 2018
Encryption INST 346, Section 0201 April 3, 2018 Goals for Today Symmetric Key Encryption Public Key Encryption Certificate Authorities Secure Sockets Layer Simple encryption scheme substitution cipher:
More informationChapter 8 Security. Computer Networking: A Top Down Approach. 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012
Chapter 8 Security A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you see the animations; and can add,
More informationEncryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls
Security Outline Encryption Algorithms Authentication Protocols Message Integrity Protocols Key Distribution Firewalls Overview Cryptography functions Secret key (e.g., DES) Public key (e.g., RSA) Message
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 informationWhat did we talk about last time? Public key cryptography A little number theory
Week 4 - Friday What did we talk about last time? Public key cryptography A little number theory If p is prime and a is a positive integer not divisible by p, then: a p 1 1 (mod p) Assume a is positive
More informationRSA (material drawn from Avi Kak Lecture 12, Lecture Notes on "Computer and Network Security" Used in asymmetric crypto.
RSA (material drawn from Avi Kak (kak@purdue.edu) Lecture 12, Lecture Notes on "Computer and Network Security" Used in asymmetric crypto. protocols The RSA algorithm is based on the following property
More informationKurose & Ross, Chapters (5 th ed.)
Kurose & Ross, Chapters 8.2-8.3 (5 th ed.) Slides adapted from: J. Kurose & K. Ross \ Computer Networking: A Top Down Approach (5 th ed.) Addison-Wesley, April 2009. Copyright 1996-2010, J.F Kurose and
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 informationPublic Key Cryptography and the RSA Cryptosystem
Public Key Cryptography and the RSA Cryptosystem Two people, say Alice and Bob, would like to exchange secret messages; however, Eve is eavesdropping: One technique would be to use an encryption technique
More informationCryptography (Overview)
Cryptography (Overview) Some history Caesar cipher, rot13 substitution ciphers, etc. Enigma (Turing) Modern secret key cryptography DES, AES Public key cryptography RSA, digital signatures Cryptography
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 informationCS669 Network Security
UNIT II PUBLIC KEY ENCRYPTION Uniqueness Number Theory concepts Primality Modular Arithmetic Fermet & Euler Theorem Euclid Algorithm RSA Elliptic Curve Cryptography Diffie Hellman Key Exchange Uniqueness
More informationChapter 9. Public Key Cryptography, RSA And Key Management
Chapter 9 Public Key Cryptography, RSA And Key Management RSA by Rivest, Shamir & Adleman of MIT in 1977 The most widely used public-key cryptosystem is RSA. The difficulty of attacking RSA is based on
More informationOutline. Data Encryption Standard. Symmetric-Key Algorithms. Lecture 4
EEC 693/793 Special Topics in Electrical Engineering Secure and Dependable Computing Lecture 4 Department of Electrical and Computer Engineering Cleveland State University wenbing@ieee.org Outline Review
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 informationCryptographic Concepts
Outline Identify the different types of cryptography Learn about current cryptographic methods Chapter #23: Cryptography Understand how cryptography is applied for security Given a scenario, utilize general
More informationComputer Networks. Network Security and Ethics. Week 14. College of Information Science and Engineering Ritsumeikan University
Computer Networks Network Security and Ethics Week 14 College of Information Science and Engineering Ritsumeikan University Security Intro for Admins l Network administrators can break security into two
More informationKey Exchange. References: Applied Cryptography, Bruce Schneier Cryptography and Network Securiy, Willian Stallings
Key Exchange References: Applied Cryptography, Bruce Schneier Cryptography and Network Securiy, Willian Stallings Outlines Primitives Root Discrete Logarithm Diffie-Hellman ElGamal Shamir s Three Pass
More informationComputer Security 3/23/18
s s encrypt a block of plaintext at a time and produce ciphertext Computer Security 08. Cryptography Part II Paul Krzyzanowski DES & AES are two popular block ciphers DES: 64 bit blocks AES: 128 bit blocks
More informationLecture 9a: Secure Sockets Layer (SSL) March, 2004
Internet and Intranet Protocols and Applications Lecture 9a: Secure Sockets Layer (SSL) March, 2004 Arthur Goldberg Computer Science Department New York University artg@cs.nyu.edu Security Achieved by
More informationח'/סיון/תשע "א. RSA: getting ready. Public Key Cryptography. Public key cryptography. Public key encryption algorithms
Public Key Cryptography Kurose & Ross, Chapters 8.28.3 (5 th ed.) Slides adapted from: J. Kurose & K. Ross \ Computer Networking: A Top Down Approach (5 th ed.) AddisonWesley, April 2009. Copyright 19962010,
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 information1 Extended Euclidean Algorithm
CS 124 Section #8 RSA, Random Walks, Linear Programming 3/27/17 1 Extended Euclidean Algorithm Given a, b, find x, y such that ax + by = d where d is the GCD of a, b. This will be necessary in implementing
More information1 Extended Euclidean Algorithm
CS 124 Section #8 RSA, Random Walks, Linear Programming 3/27/17 1 Extended Euclidean Algorithm Given a, b, find x, y such that ax + by = d where d is the GCD of a, b. This will be necessary in implementing
More informationIntroduction to Cryptography and Security Mechanisms: Unit 5. Public-Key Encryption
Introduction to Cryptography and Security Mechanisms: Unit 5 Public-Key Encryption Learning Outcomes Explain the basic principles behind public-key cryptography Recognise the fundamental problems that
More informationPublic-key encipherment concept
Date: onday, October 21, 2002 Prof.: Dr Jean-Yves Chouinard Design of Secure Computer Systems CSI4138/CEG4394 Notes on Public Key Cryptography Public-key encipherment concept Each user in a secure communication
More information06/02/ Local & Metropolitan Area Networks. 0. Overview. Terminology ACOE322. Lecture 8 Network Security
1 Local & Metropolitan Area Networks ACOE322 Lecture 8 Network Security Dr. L. Christofi 1 0. Overview As the knowledge of computer networking and protocols has become more widespread, so the threat of
More informationASYMMETRIC (PUBLIC-KEY) ENCRYPTION. Mihir Bellare UCSD 1
ASYMMETRIC (PUBLIC-KEY) ENCRYPTION Mihir Bellare UCSD 1 Recommended Book Steven Levy. Crypto. Penguin books. 2001. A non-technical account of the history of public-key cryptography and the colorful characters
More informationDavenport University ITS Lunch and Learn February 2, 2012 Sneden Center Meeting Hall Presented by: Scott Radtke
Davenport University ITS Lunch and Learn February 2, 2012 Sneden Center Meeting Hall Presented by: Scott Radtke A discussion on the mathematics behind coding and decoding using RSA Public-Key Cryptography.
More informationLecture 15: Cryptographic algorithms
06-06798 Distributed Systems Lecture 15: Cryptographic algorithms 22 March, 2002 1 Overview Cryptographic algorithms symmetric: TEA asymmetric: RSA Digital signatures digital signatures with public key
More informationApplied Cryptography and Computer Security CSE 664 Spring 2018
Applied Cryptography and Computer Security Lecture 13: Public-Key Cryptography and RSA Department of Computer Science and Engineering University at Buffalo 1 Public-Key Cryptography What we already know
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 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 informationPractical Aspects of Modern Cryptography
Practical Aspects of Modern Cryptography Lecture 3: Symmetric s and Hash Functions Josh Benaloh & Brian LaMacchia Meet Alice and Bob Alice Bob Message Modern Symmetric s Setup: Alice wants to send a private
More informationApplied Cryptography and Network Security
Applied Cryptography and Network Security William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #8: RSA Didn t we learn about RSA last time? During the last lecture, we saw what RSA does and learned
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 informationLECTURE 4: Cryptography
CSC 519 Information Security LECTURE 4: Cryptography Dr. Esam A. Alwagait alwagait@ksu.edu.sa Recap form previous Lecture We discussed more symmetric encryption. Books? Security Engineering, Ross Anderson
More informationOverview. Public Key Algorithms I
Public Key Algorithms I Dr. Arjan Durresi Louisiana State University Baton Rouge, LA 70810 Durresi@csc.lsu.Edu These slides are available at: http://www.csc.lsu.edu/~durresi/csc4601-04/ Louisiana State
More informationCIS 3362 Final Exam 12/4/2013. Name:
CIS 3362 Final Exam 12/4/2013 Name: 1) (10 pts) Since the use of letter frequencies was known to aid in breaking substitution ciphers, code makers in the Renaissance added "twists" to the standard substitution
More informationLecture 19: cryptographic algorithms
Lecture 19: cryptographic algorithms Operating Systems and Networks Behzad Bordbar School of Computer Science, University of Birmingham, UK 179 Overview Cryptographic algorithms symmetric: TEA asymmetric:
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 informationChapter 3 Public Key Cryptography
Cryptography and Network Security Chapter 3 Public Key Cryptography Lectured by Nguyễn Đức Thái Outline Number theory overview Public key cryptography RSA algorithm 2 Prime Numbers A prime number is an
More informationOther Uses of Cryptography. Cryptography Goals. Basic Problem and Terminology. Other Uses of Cryptography. What Can Go Wrong? Why Do We Need a Key?
ryptography Goals Protect private communication in the public world and are shouting messages over a crowded room no one can understand what they are saying 1 Other Uses of ryptography Authentication should
More informationDistributed Systems. 26. Cryptographic Systems: An Introduction. Paul Krzyzanowski. Rutgers University. Fall 2015
Distributed Systems 26. Cryptographic Systems: An Introduction Paul Krzyzanowski Rutgers University Fall 2015 1 Cryptography Security Cryptography may be a component of a secure system Adding cryptography
More informationMore on Cryptography CS 136 Computer Security Peter Reiher January 19, 2017
More on Cryptography CS 136 Computer Security Peter Reiher January 19, 2017 Page 1 Outline Desirable characteristics of ciphers Stream and block ciphers Cryptographic modes Uses of cryptography Symmetric
More informationRSA (algorithm) History
RSA (algorithm) RSA is an algorithm for public-key cryptography that is based on the presumed difficulty of factoring large integers, the factoring problem. RSA stands for Ron Rivest, Adi Shamir and Leonard
More informationSecurity. Communication security. System Security
Security Communication security security of data channel typical assumption: adversary has access to the physical link over which data is transmitted cryptographic separation is necessary System Security
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 informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 7 January 30, 2012 CPSC 467b, Lecture 7 1/44 Public-key cryptography RSA Factoring Assumption Computing with Big Numbers Fast Exponentiation
More informationNumber Theory and RSA Public-Key Encryption
Number Theory and RSA Public-Key Encryption Dr. Natarajan Meghanathan Associate Professor of Computer Science Jackson State University E-mail: natarajan.meghanathan@jsums.edu CIA Triad: Three Fundamental
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 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 informationCryptography. How to Protect Your Data
Cryptography How to Protect Your Data Encryption is the act of changing information in such a way that only people who should be allowed to see the data are able to understand what the information is.
More informationCryptography in Lotus Notes/Domino Pragmatic Introduction for Administrators
Cryptography in Lotus Notes/Domino Pragmatic Introduction for Administrators Belfast, 11-Nov-2010 Innovative Software Solutions. Thomas Bahn - graduated in mathematics, University of Hannover - developing
More informationCS 332 Computer Networks Security
CS 332 Computer Networks Security Professor Szajda Last Time We talked about mobility as a matter of context: How is mobility handled as you move around a room? Between rooms in the same building? As your
More information10.1 Introduction 10.2 Asymmetric-Key Cryptography Asymmetric-Key Cryptography 10.3 RSA Cryptosystem
[Part 2] Asymmetric-Key Encipherment Asymmetric-Key Cryptography To distinguish between two cryptosystems: symmetric-key and asymmetric-key; To discuss the RSA cryptosystem; To introduce the usage of asymmetric-key
More informationComputers and Security
The contents of this Supporting Material document have been prepared from the Eight units of study texts for the course M150: Date, Computing and Information, produced by The Open University, UK. Copyright
More informationRSA Public Key Encryption 1. Ivor Page 2
RSA Public Key Encryption 1 RSA Public Key Encryption 1 Ivor Page 2 One of the most important methods of providing secrecy and authentication is encryption. Secrecy means the secure transmission of data
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 informationA New Symmetric Key Algorithm for Modern Cryptography Rupesh Kumar 1 Sanjay Patel 2 Purushottam Patel 3 Rakesh Patel 4
IJSRD - International Journal for Scientific Research & Development Vol. 2, Issue 08, 2014 ISSN (online): 2321-0613 A New Symmetric Key Algorithm for Modern Cryptography Rupesh Kumar 1 Sanjay Patel 2 Purushottam
More informationSecurity+ Guide to Network Security Fundamentals, Third Edition. Chapter 11 Basic Cryptography
Security+ Guide to Network Security Fundamentals, Third Edition Chapter 11 Basic Cryptography Objectives Define cryptography Describe hashing List the basic symmetric cryptographic algorithms 2 Objectives
More informationNetwork Security. Chapter 4 Public Key Cryptography. Public Key Cryptography (4) Public Key Cryptography
Chair for Network Architectures and Services Department of Informatics TU München Prof. Carle Encryption/Decryption using Public Key Cryptography Network Security Chapter 4 Public Key Cryptography However,
More informationISA 662 Internet Security Protocols. Outline. Prime Numbers (I) Beauty of Mathematics. Division (II) Division (I)
Outline ISA 662 Internet Security Protocols Some Math Essentials & History Asymmetric signatures and key exchange Asymmetric encryption Symmetric MACs Lecture 2 ISA 662 1 2 Beauty of Mathematics Demonstration
More informationComputational Security, Stream and Block Cipher Functions
Computational Security, Stream and Block Cipher Functions 18 March 2019 Lecture 3 Most Slides Credits: Steve Zdancewic (UPenn) 18 March 2019 SE 425: Communication and Information Security 1 Topics for
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 informationSymmetric Key Algorithms. Definition. A symmetric key algorithm is an encryption algorithm where the same key is used for encrypting and decrypting.
Symmetric Key Algorithms Definition A symmetric key algorithm is an encryption algorithm where the same key is used for encrypting and decrypting. 1 Block cipher and stream cipher There are two main families
More informationShared Secret = Trust
Trust The fabric of life! Holds civilizations together Develops by a natural process Advancement of technology results in faster evolution of societies Weakening the natural bonds of trust From time to
More informationCryptography. Cryptography is much more than. What is Cryptography, exactly? Why Cryptography? (cont d) Straight encoding and decoding
Copyright 2000-2001, University of Washington Cryptography is much more than Cryptography Cryptography systems allow 2 parties to communicate securely. The intent is to give privacy, integrity and security
More informationSecret Key Algorithms (DES)
Secret Key Algorithms (DES) G. Bertoni L. Breveglieri Foundations of Cryptography - Secret Key pp. 1 / 34 Definition a symmetric key cryptographic algorithm is characterized by having the same key used
More informationLecture 30. Cryptography. Symmetric Key Cryptography. Key Exchange. Advanced Encryption Standard (AES) DES. Security April 11, 2005
Lecture 30 Security April 11, 2005 Cryptography K A ciphertext Figure 7.3 goes here K B symmetric-key crypto: sender, receiver keys identical public-key crypto: encrypt key public, decrypt key secret Symmetric
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 informationThe Network Security Model. What can an adversary do? Who might Bob and Alice be? Computer Networks 12/2/2009. CSC 257/457 - Fall
The Network Security Model Bob and lice want to communicate securely. Trudy (the adversary) has access to the channel. Kai Shen lice data channel secure sender data, control s secure receiver Bob data
More information