COMP 4109 Applied Cryptography
|
|
- Eustace Hardy
- 6 years ago
- Views:
Transcription
1 COMP 4109 Applied Cryptography Cryptosystems (P,C,K,E,D) 1. P is the finite set of possible plaintexts 2. C is a finite set of possible ciphertexts 3. K is the keyspace, a finite set of possible keys 4. For each 1. There exists an encryption rule and; 2. A corresponding decryption rule 5. and 6. Secured Communications Cipher rules previously agreed upon. A and B agree on a random key over a secure channel. A wants to send to B A encrypts each of and computes and the encrypted message is Y is sent over the unsecured channel. B receives Y B applies to each of in order to obtain The encryption function must be 1-to-1 such that: The Shift Cipher Suppose a and b are integers, and m is a positive integer. We write if The phrase is called a congruence where a is congruent to b modulo m. This cipher uses an offset for encrypting a message. It has a small key space due to the size of m value chosen, such as the size of the alphabet that the P is written in. Suppose and where and where. 1 P a g e
2 Abelian Group Suppose the binary operation * is defined for elements of the set G. Then G is a group with respect to * provided: 1. G is closed under *, for each 2. * is commutative such that 3. * is associative such that 4. G has an identity element e. There is an e in G such that 5. G contains inverses. A field has two operations A group has a single operation Substitution Cipher o K =26! * Repetition of values since each letter is merely substituted is the inverse permutation to. Vulnerability: measurement of the frequencies of most occurring characters Example: plaintext=shesellsseashellsbytheseashore Break plaintext into groups of m. shesel lsseas hellsb ythese ashore Arrange each group of six letters according to the permutation ELSEHS SSLASE LBHSEL HEYSTE HEARSO The ciphertext could be decrypted using the inverse function Affine Cipher Uses a shift-rotate or rotate-shift When then the cipher is a simple Shift-Cipher 2 P a g e
3 Example Substitute: Vigenère Cipher This cipher uses different values for the same character, but is exploitable when trying to determine the size of m. A key space of size m is chosen and the plaintext is broken up into chunks of size m and plaintext letters are switched to cipher text., and the size of m can be figured out. However, there are non-unique mappings such that the same character is can be mapped to a different character For a key The same character can be mapped to different values. Example Suppose and the keyword is CIPHER. This has the numerical equivalent Vulnerability Cryptanalysis Kasiski Test 2 Identical segments of plaintext will be encrypted to the same ciphertext whenever their occurrence in plaintext is positions apart such that. Scan the ciphertext to seach for pairs of identical segments of and record the distances between string positions of the 2 segments. Several distances will be obtained that satisfy the GCD between all of them,. There may be instances such that two string may occur as the splits between different m blocks where x may be the end of the last block, and ab the beginning of the new block, mimicking the xab string, but it s really not what you re looking for. 3 P a g e
4 Hill Cipher This cryptosystem uses invertible matrices in order to encrypt and decrypt a message. If, K= the set of all invertible matrices. Let, define, and. Example: Stream Ciphers (P,C,K,L,E,D) Generates a keystream and use it to encrypt a plaintext string according to the encryption rule: where each character of ciphertext is encrypted with a character from the keystream alphabet. 1. L is the keystream alphabet 2. g is the keystream generator that takes K as an input, and generates the infinite string called the keystream alphabet. Example: Let and Let for, and Let m = 4 Depends on a combination of some previous 2 keys. The keystream, z, is independent of plaintext. Synchronous keystreams Asynchronous keystreams depend upon plaintext. 4 P a g e
5 Cryptanalysis Can an attacker determine k between 2 parties? Assume the attacker knows which cryptosystem is being used. Ciphertext Only Attacks Attacker can only see Known Plaintext Attacks posess plaintext and corresponding ciphertext Chosen Plaintext Attacks Attacker has temporary access to encryption machinery, and has the ability to choose and generate. Chosen Ciphertext Attacks Attacker has temporary access to encryption machinery, and can choose and obtain. Consider Affine Ciphers Suppose an attacker has obtained the ciphertext of 57 characters long. Using an english alphabet, plot the frequencies of each letter. The are determined as follows: R=8 D=7 E,H,K = 5 F,S,V = 4 From this data, we hypothesize that R is an encryption of E, and D is an encryption of T since they are the two most commonly used language. Numerically, it is expressed as, and. Cryptanalysis of the Vigenère Cipher For a key, To Find m? Use the Kasiski test to determine the key length, m. An observation is made that two identical segments of plaintext will be encrypted to the same ciphertext, each of length of at least 3, a good chance exists such that they correspond to identical segments of plaintext. 1. Search the ciphertext for pairs of idential segments of at least 3 2. Record the distances between the starting positions of the 2 segments a. Segment distances denoted by b. Assume 3. is a string of n alphabetic characters a. Suppose x is a string of text where the probabilities for each letter are denoted by: We would expect the probability of two random elements of the alphabet are equal is: 5 P a g e
6 Denote the frequencies of occurrences for each letter as. We can choose 2 elements of x in ways, and for each there are ways of choosing both elements to be i. Suppose substrings denoted by has been constructed as ciphertext using the Vigenère Cipher, with m, we can write the ciphertext out in columns: If this matrix is constructed, and m is the keyword length, then each value roughly equal to If m is not the correct keyword length, the substrings of more random and even less meaningful. should be will look Cryptanalysis of the Hill Cipher Succumbs easily to a plaintext attack. Plaintext Attack The attacker knows m pairs of, and also knows that If X is invertible, then they can easily determine K by. If X is not invertible, then the attacker would keep trying until they acquire an invertible matrix, X. Chapter 2 : Shannon s Theory Computational Security: How much computational effor is needed to break the system. Provable Security: A given computational security is secure if a given integer cannot be factored. Unconditional Security: No bounds are required. Elementary Probability Theory Let X be a discrete random variable where the probability that a random variable X takes on the value x is denoted by, or if the random variable is fixed. Joint Probability Conditional Probability Indepenent Random Variables 6 P a g e
7 Bayes Theorem If Perfect Secrecy (P,C,K,E,D) Assume there is a probability distribution on P. Let X be the Random Variable with the above probability distribution Let be chosen with the help of some probability distribution is known We can assume that k and X are independent random variables. For a key, For all, we have: Example ENC a b Perfect Secrecy The attacker can not get any information about the plaintext by observing the ciphertext. Computational Security, has a perfect secrecy if Suppose that 26 keys in the shift cipher are used with equal probability =, then for any plaintext probability distribution, the shift cipher has perfect secrecy. That is, each character is shifted by a random key. 7 P a g e
8 Recall that, and for,, so let s compute the probability distribution on C with then Theroem 2.4 Suppose is Computationally Secure where then perfect secrecy exists if and only if are used with equal probability. Proof:, but from assumption No two distinctly different keys can map a plaintext character to the same ciphertect character. Let and the plaintext, and fix a ciphertext element and set, using Bayes Theorem: One-Time Pad Let, for, define and Each key can only be used once Easy to attack due to the use of XOR New keys need to be generated and communicated over a secure channel. 2.7 Product Ciphers Assume that (endomorphic). Let and A key, will be a pair and, 8 P a g e
9 Prove Multiplicative Cipher Let and let For define: Let M be a multiplicative cipher where, and, Let S be a shift cipher. Key in affine cipher is equivalent to key in. 3.1 Block Ciphers Product block cipher which is iterated, i. Round function Key Schedule Encryption of plaintext will go through rounds denoted by Nr. Key Schedule Keys:, and random key: 6. Round Function: Encryption Decryption 3.3 Substitution-Permutation Networks (SPN) This is a special type of iterated cipher with small changes that include breaking the blocks up into m blocks of l size, where lm is the block length of the cipher. It uses two components, and where s is the substitution function using S-Boxes, and p is a permutation. 9 P a g e
10 Given an lm-bit binary string represented by, where x is the concatenation of m substrings, each l-bits long, denoted as. For : The SPN will go through Nr rounds, and on each iteration will perform m substitutions using followed by a permutation. Before each substitution, the round key bits are used via XOR operation. 7. is the input to the S-Boxes in round r. 8. is the ouput of the S-Boxes in round r. 9. is obtained from by applying 10. is constructed from by XOR ing the roung with the key ; round key mixing 11. In the last round, is not applied, allowing the encryption algorithm to be used for decryption as well. 12. The very last operations in SPN are XOR s with subkeys, a process called whitening. 1. Prevent an attacker from beginning to carry out an encryption or decryption even if the key is not known. Algorithm 3.1: return y; 10 P a g e
11 is defined to be 16 consecutive bits starting at is the first S-Box is the result of is the application of is the application of is the 2 nd round of using an S-Box is the result of after 4 rounds of substitution, permuation and XOR The decryption function is merely the inverse of the encryption function There are always a fixed number of rounds, in the example above, there are 5, The substitution and permutation functions must be invertible S-Boxes must have a fixed size, in this case 4-bits with 4 S-Boxes Linear Cryptanalysis It is possible to find a probabilistic linear relationship between a subset of plaintext bits and a subset of state bits immediately preceding the substitutions performed in the last round. Have a look at all possible keys. 1. Feed a plaintext X into some key and look for a relationship to Y with said key. Suppose are 0-1 Independent Random Variables. Let be real number such that for all i. Suppose that, and the independence of and implies that: And for the XOR conditions: Definition of Bias which is a probability distribution of a random variable which could take on the values of 0 and 1, where the bias of is: Let denote the bias of the random variable Consider an S-Box with an m-tuple S-Box with input which is a random bit string. is a 0-1 random variable with bias 11 P a g e
12 is the ciphertext output o is a random variable that is dependent on! To compute the bias of The Random Variables defined by an S-Box If we analyze the random variable: Bias: We can compute the bias for all possible combinations of s and y s. There are a total of 256 possible random variables of this form. In compact form, this can be written as: Where,, and we treat each of the binary vectors and as a hexadecimal digit for input and output. Have a look at the individual S-Boxes 1. Random Variable has a bias 2. - Random Variable has a bias 3. - Random Variable has a bias 4. - Random Variable has a bias Assuming that are independent random variables, then the bias of input bits(x), output bits(y) and key bits.. We need to express the XOR of in terms of Computing the XOR of the above on the right sides, we see that some V s cancel out: Input bits, Intermediate bits, 12 P a g e
13 It is best to think about the key bits as fixed, and we want to figure out the values : 1. and 2. There are possibilities for these bit sequences We construct plaintext-ciphertext pairs, and for each pair obtain the value for and, then compute the value, and maintain counters indexed by the possible 256 bit sequences (keys). At the end of the counting process, we expect that most counters will have a value close to, but the entry with the correct subkey should have a value that converges upon. If the bias is, you will need about pairs. Data Encryption Standard (DES) Uses a Feistel Cipher Each stage is divided into halves 1. Round function: 16 rounds of Feistel Cipher with block length of 64 bits Keys are 56-bits long 64 bits includes parity bits. Cipher text y will be 64-bits long, Prior to beginning the 16 rounds, an initial permutation is applied to the plaintext: After the 16 rounds of encryption, an inverse permutation is applied to the bitstring, yielding the cipher text y: Each and are 32 bits in length, so the function bit strings that are chosen from K,. consists of substitution (s-boxes) followed by a permutation. is implemented as follows: A is expanded to a 48-bit string by an expansion function. E(A) consists of a permutation of 32 bits of A and some bits are repeated. Evaluate which is 48 bits 8 S-Boxes are used, each box maps 6 bits to 4 bits Compute for j=1,,8 Let which is a 32-bit string Permute 32 bits of C with a permutation P. Choose a 56-bit key and determine 13 P a g e
14 An example of a DES S-Box: Each S-box is a matrix, rows numbered 0,1,2,3 and columns 0,,15. Given works as the stored reference location in the S-Box determine the row number determine the column number And note that: Fermat s Little Theorem For any integer a, will be evenly divisible by p: If p is prime, and a is an integer coprime to p, then will be evenly divisible by p: 4. Hash Functions Message = x, hash of message = h(x)=y, which is known. 1. If a user receives x and computes f(x) AND f(x) = h(x) then the message has data integrity 2. Otherwise the message has been changed since h(x) was computed 3. Collisions may also occur Keyed Hash Functions Message authentication Hash Family(x,y,K,H) Alice and Bob know K x - plaintext Alice sends a pair y - ciphertext is hash function k on x. K keyspace, An unkeyed hash function has only 1 key such that Let h be an unkeyed hash function. A hash function is desirable if it is difficult to solve. There are 3 ways that must be made difficult in order to make such a hash function desirable: is known and is known. Given a message digest y, can x be determined such that is known and is known Given a message x, if such that and is known Find such that 14 P a g e
15 If ; how many possible functions from X to Y? Consider an ideal hash function then the only way to determine for x is to evaluate an ideal function from the set of all possible functions from x to y. Let be chosen randomly. Let and the value of h is known for each element of. Then Find-Preimage(h, y, Q) Find-Preimage2(h, x, Q) Choose any for each do choose if for each do return(x) if return(fail); return( return(fail); Proof: Let y be fixed, and Let, and all s are all independent events: To find Collision Find-Collision(h,Q) Example Choose Say 80-bit keys are used then for each do Using a birthday attack, if for some return ; else return(fail); end for Proof Let where, and Let be the event that: By Induction the probability of finding no collisions: 15 P a g e
16 With the above estimate, the probability of finding no collisions is approximately: The probability of finding at least one collision: But if we want this probability to exceed then Consider a 40-bit digest, then y is expressed as 40 bits as well. For, choosing a subset of x of sufficent size should warrant a collision to. In this mentioned case,. To ensure that you get a collision, it s best to user a very large subset of about 128 bits, 256 bits, or eve 512 bits. This increases your chances of obtaining a collision. When designing a good hash function, it is important to make it very difficult to find a collision between different hash functions. 4.3 Iterated Hash Functions These are used on very long strings that could be of infinite length, which are broken up into blocks using a compression function. Suppose a long finite string exists with a function to break it up into blocks: Preprocessing Given an input string x where, construct a string where for. Processing Let IV be the initiation vector of length m. Postprocessing Output: 16 P a g e
17 Merkle-Dangard Construction A particular method of constructing a hash function from a compression function. Collision resistance due to compression function being collision resistant. Compress: Iterated hash function: Claim: If compress: is collision resistant then constructed by the the Merkle- Damgard construction is collision resistant. Proof: Suppose we can find in polynomial time. where Let x and be padded with d and 0 s. Let g values be computed by the algorithm as: Case 1: If and we have: since, but their compression values are the same. 4.4 Message Authentication Codes (MACs) Keyed Hash Functions Placement of a key in the initialization vector is insufficient (IV key) An attacker can request up to Q valid MAC s for well-known messages o Attacker can generate pairs of such that because the attacker knows which creates an authentication problem. The attacker can generate a message without knowing the actual key! is a forgery 17 P a g e
18 Cipher Block Chaining CBC-MAC(x,k) On a very long string, encrypt each block from the output of the previous block IV = 0; and return when complete. Birthday Collision Attack The attacker can request MACs for a large # of messages. Let,, Choose q distinct bit strings of length t: Choose q random bit strings of length t: o Define 1. The attacker requests MAC s for each 2. Due to birthday problem, 3. Define for The attacker can compute the MAC of w without knowledge of key k. key. The request. without RSA 1., where p and q are primes: 2. and 3. Bob-Public =, Bob-Private = are private keys of Bob. 1. Bob selects 2 distinct large prime numbers p and q. Computes and. 2. Bob selects an odd integer b that will be his private key such that. 3. Bob publishes the public key, where. 4. Alice wants to send the message to Bob. using Bob s public key. 5. When bob receives y, he applies using his private key a. Example 1. p = 23, q = 41, n = 943, Public:, a= Alice sends 5. Bob computes mod 943=35. Prove that. 18 P a g e
19 Requirements: Easy to generate p,q,a,b Easy to generate ciphertext Easy to decrypt Computationally infeasible to decrypt without knowing a Proof of correctness: 1. If ; Fermat 2. If ; Euler 3. Let p,q be 2 numbers where If To prove then Note that ; If If : x is a multiple of p. In both cases, Proof of if and p is prime then Let. Multiply them all by a and take mod p =. No two values in Modular Exponentiation n = pq where p and q are large primes of 1024 bits each. The number of primes. The probability that p is prime is:. If 1024 odd numbers with generator numbers with greater values of c, we get a greater chance of finding a large prime. Let n be a number, is n prime? If n is not prime then and If its factors are 512 bits long then or q We can find if n is prime by exploring numbers using the Miller-Rabin Method. Let be an odd number then is even, or or for. Let 19 P a g e
20 . If p s prime and then and since. Let p be a prime number greater than 2. is odd. Let then either: Miller-Rabin Test 1. Find where 2. Select a random number. 3. If then return n may be prime. 4. For to do If return n is prime; Else return n is composite; Given an odd number n, what is the probability that a randomly chosen returns inconclusive provided that the number is composite is. test RSA: Why factoring is hard? Is factoring hard? How fast can factoring work? Sieve of Erastothenes: Iteratively divide by prime numbers from lower order By testing numbers up to 2048 bits, we can deduce factors of n. Pollard-P Heuristic While TRUE do Example n = 1387 i = i+1; = d = if and print(d); if i = k y = k = 2k; This loop does not stop, and runs forever. We only need to maintain, k, so the memory requirement is very low. When, then i is some power of 2. If d is printed, it is a nontrivial factor of n. This algorithm does not go through all possible values of because there exists a cycle that it will loop through. If n is composite, this procedure typically finds its factors. 20 P a g e
21 We can mathematically describe how long it takes before a cycle is observed by focusing on the line in the algorithm which produces random numbers in the range When, The value is from the birthday attack, and it will takes us steps to discover the cycle. Let p be an non-trivial factor of n where steps. Continuing Example:. Due to the birthday attack, we will get a collision in Let p be a non-trivial factor of n,,,, Let be the sequence corresponding to n. Let be the sequence such that We have that, and remember that, so we have that We know that there is a collision in values in steps. Since then there exists a collision in steps, or a cycle appears after that many steps. Complexity : Standard Sieve Method: Pollard-P: where number of bits needed to represent n. In the large cycle of n, there exists a cycle within the factorizations in n that can be solved in the number of steps in complexity above. Discrete Log 1: If then. If, then satisfies (1) What is the least positive integer m for which (1) holds. This value of m is called order of a, or the value to the power of a is equal to 1. It is the length of period generated by a,. is the least value of m, and m exists such that. Example 21 P a g e
22 After we know the exponentiation finally equals 1, we will see that the numbers will continue to cycle from this point on. The length of these sequences always divide which has elements. Important ones are whose length is,. These values for a are called primitive roots. Any of these values can generate the whole set. Not all n s have primitive roots. Where a is a primitive root of p., where, so for what value of i which will satisfy the condition. The i value is called the discreet log problem. The discreet log problem: Given b, a, p, finding i is hard. Example: finding b is easy. ; p = 19. But given a, i, p then Diffie Helman key exchange algorithm: Public elements: Remember that given, finding the exponent is difficult. Alice: Selects a random positive integer, and computes where is private and is public. Bob selects a random integer and computes where is private and Alice computes the key. Bob computes the key. Claim : Example q = 353 Alice chooses, computes Missed example, see textbook Susceptible to man-in-the-middle attack. 1. Oscar generates two random private keys 2. Alice transmits to Bob 3. Oscar intercepts, and transmits to Bob. 22 P a g e
23 4. Bob receives computes. 5. Bob transmits to Alice 6. Oscar intercepts and computes. 7. Oscar transmits to Alice. 8. Alice receives and computes Bob and Alice are not aware that they have been duped by Oscar who has tricked them into sharing a secret key, but Oscar has shared two different keys. One with Alice ( and another with Bob. ElGammal 1984 Public Elements Alice: Selects a random integer and computes where is private. Bob: encrypts a message M as follows:, otherwise chop into those sized blocks. Bob chooses a random digit k,. Computes one time key, and encrypts M as a pair where: Alice recovers M as follows: Key K is recovered by computing: computing: and the message M is recovered by If you know the inverse of K, you can recover the message. Example Elliptic Curve Encryption Abelian Groups o Associative o o o Inverse exsits o 23 P a g e
24 Consider a cubic equation Plot which is symmetric about the x-axis. Let and add a point at. Fix parameters. We will define a group on elements of The group operator is denoted as a +. We need to make sure that the point is on the curve. The operator is defined as follows: Point at is the identity For a point its negative is the image below the x-axis, which is the negation of the y coordinate. Application of the + operator of two point are defined as follows: If then where R is the point where the line through P and Q intersects. If P is a tangent to this line then R=P, and if Q is tangent to this line, then R=Q. The line intersects one of the points, and is tangent to the other, if. If then. Algebraically, we need to compute the slope of the line passing through P and Q, Let s say that R is the intersection of the line through P,Q with the curve. Defined elliptic curve Defined the element of infinity We need to show that is on the curve using the elliptic curve equation. It can be shown that points on with the + operator form an abelian group. We will restrict ourselves to mod p or in in software or hardware respectively. Example With we get, so. Rules for the + are still the same: P a g e
25 3. If One can show that points in with + forms an abelian group. Similarily, it also holds for. Multiplication is Hard, unlike in the discrete log problem before. Let where k is some constant. Multiplication is repeated addition. It is easy given k,p to compute Q. The hard part is given Q,P We need to find Hard Problem: Easy Problem: Example Assume,, which are both points on the curve. Given P, Q, determine k where : Key Exchange 1. Choose parameters P, a, b and define. 2. Pick a point such that the smallest value of n satisfies, which is very large. 3. Alice selects where is Alice s private key. where is public. 4. Bob selects where is Bob s private key. where is public. 5. Alice Generates key 6. Bob Generates key Claim: : - the key is an x-coordinate of. 25 P a g e
26 Example How Encryption/Decryption is done in Elliptic Curve Cryptography 1. Encode the plain text message, m to be sent as a point on. 2. Choose such that and is large (n is order of G). 3. Each user A chooses a private key and generates which is public. Suppose Alice wants to send a message m to Bob, Alice chooses a random integer k and computes where is the public key of Bob, and m is the message. On receiving C, Bob needs to figure out m. Bob uses his private key and multiplies where is the 1 st parameter and subtracts this value from the 2 nd are all points on the elliptic curve. It is equal to m since. Alice has included a clue, the 1 st coordinate, so that anybody who knows can find out m. Example Alice wants to send, so Alice chooses. The public key of Bob is. Alice s cipher text: How to compute In general, SBR is in non-adjacent format (NAF) if no two consecutive values are non-zeros. Example. If we look at the binary representation of an arbitrary number, the number of 0 s should be equal to the number of 1 s, but in SBR-NAT, the number of 0 s is 66%. Signed Binary Representation: Non-Adjacent Form: no two consecutive bits are non-zero. Compute cp, assume that c is in SBR-NAF Q = 0; for i = (l-1) down to 0: Q = 2Q; If If Return Q; 26 P a g e
27 The standard efficiency is due to the doubling, the efficiency of SBR-NAF is due to the fact that 66% of the bits are zeros. Digital Signatures Message authentication used to verify that a message was sent from a particular entity. Bit pattern that is dependent on the message o Prevents impersonation Uses information from the sender Easy to compute the signature Easy to verify Computationally infeasible to tamper with. Should be short El-Gammal Dss Alice: generates public/private keys as follows: Random. Private Key:, public key: To sign a message M, Alice does the following:, where H is the hash function Choose a random integer k where, and the. Compute. Compute as well using the Extended Euclidean Algorithm. Compute Signature Any user Bob, can verify the signature by computing: Signature is valid if. Public Elements p : a prime number, l-bits long, and a multiple of P a g e
28 where h is any integer in. The global public elements. For a user, the private key is x where. The public key of this user. For each message, the user chooses a random key k, where, Signing:,, and the signature becomes. Verification: Suppose verifier received Verifier Computes: Test: Is? If yes, then the signature is verified. 28 P a g e
This chapter continues our overview of public-key cryptography systems (PKCSs), and begins with a description of one of the earliest and simplest
1 2 3 This chapter continues our overview of public-key cryptography systems (PKCSs), and begins with a description of one of the earliest and simplest PKCS, Diffie- Hellman key exchange. This first published
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 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 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 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 informationElements of Cryptography and Computer and Networking Security Computer Science 134 (COMPSCI 134) Fall 2016 Instructor: Karim ElDefrawy
Elements of Cryptography and Computer and Networking Security Computer Science 134 (COMPSCI 134) Fall 2016 Instructor: Karim ElDefrawy Homework 2 Due: Friday, 10/28/2016 at 11:55pm PT Will be posted on
More informationTraditional 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 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 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 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 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 informationPublic 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 informationCryptography and Network Security
Cryptography and Network Security CRYPTOGRAPHY AND NETWORK SECURITY PRAKASH C. GUPTA Former Head Department of Information Technology Maharashtra Institute of Technology Pune Delhi-110092 2015 CRYPTOGRAPHY
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 informationKey Management and Distribution
CPE 542: CRYPTOGRAPHY & NETWORK SECURITY Chapter 10 Key Management; Other Public Key Cryptosystems Dr. Lo ai Tawalbeh Computer Engineering Department Jordan University of Science and Technology Jordan
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 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 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 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 informationCryptography and Network Security
Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown Chapter 10 Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would
More informationCryptography and Network Security Chapter 10. Fourth Edition by William Stallings
Cryptography and Network Security Chapter 10 Fourth Edition by William Stallings Chapter 10 Key Management; Other Public Key Cryptosystems No Singhalese, whether man or woman, would venture out of the
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 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 informationPublic Key Algorithms
CSE597B: Special Topics in Network and Systems Security Public Key Cryptography Instructor: Sencun Zhu The Pennsylvania State University Public Key Algorithms Public key algorithms RSA: encryption and
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 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 informationL13. Reviews. Rocky K. C. Chang, April 10, 2015
L13. Reviews Rocky K. C. Chang, April 10, 2015 1 Foci of this course Understand the 3 fundamental cryptographic functions and how they are used in network security. Understand the main elements in securing
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 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 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 Encryption. Modified by: Dr. Ramzi Saifan
Public Key Encryption Modified by: Dr. Ramzi Saifan Prime Numbers Prime numbers only have divisors of 1 and itself They cannot be written as a product of other numbers Prime numbers are central to number
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 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 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 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 informationLecture 2 Applied Cryptography (Part 2)
Lecture 2 Applied Cryptography (Part 2) Patrick P. C. Lee Tsinghua Summer Course 2010 2-1 Roadmap Number theory Public key cryptography RSA Diffie-Hellman DSA Certificates Tsinghua Summer Course 2010 2-2
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 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 informationCSE 127: Computer Security Cryptography. Kirill Levchenko
CSE 127: Computer Security Cryptography Kirill Levchenko October 24, 2017 Motivation Two parties want to communicate securely Secrecy: No one else can read messages Integrity: messages cannot be modified
More informationPublic Key Cryptography
Public Key Cryptography Giuseppe F. Italiano Universita` di Roma Tor Vergata italiano@disp.uniroma2.it Motivation Until early 70s, cryptography was mostly owned by government and military Symmetric cryptography
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 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 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 informationCS Network Security. Nasir Memon Polytechnic University Module 7 Public Key Cryptography. RSA.
CS 393 - Network Security Nasir Memon Polytechnic University Module 7 Public Key Cryptography. RSA. Course Logistics Homework 2 revised. Due next Tuesday midnight. 2/26,28/02 Module 7 - Pubic Key Crypto
More informationCS 161 Computer Security
Paxson Spring 2013 CS 161 Computer Security 3/14 Asymmetric cryptography Previously we saw symmetric-key cryptography, where Alice and Bob share a secret key K. However, symmetric-key cryptography can
More informationAssignment 9 / Cryptography
Assignment 9 / Cryptography Michael Hauser March 2002 Tutor: Mr. Schmidt Course: M.Sc Distributed Systems Engineering Lecturer: Mr. Owens CONTENTS Contents 1 Introduction 3 2 Simple Ciphers 3 2.1 Vignère
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 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 informationCryptographic Hash Functions
ECE458 Winter 2013 Cryptographic Hash Functions Dan Boneh (Mods by Vijay Ganesh) Previous Lectures: What we have covered so far in cryptography! One-time Pad! Definition of perfect security! Block and
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 informationA SIGNATURE ALGORITHM BASED ON DLP AND COMPUTING SQUARE ROOTS
A SIGNATURE ALGORITHM BASED ON DLP AND COMPUTING SQUARE ROOTS Ounasser Abid 1 and Omar Khadir 2 1, 2 Laboratory of Mathematics, Cryptography and Mechanics, FSTM University Hassan II of Casablanca, Morocco
More informationAlgorithms (III) Yijia Chen Shanghai Jiaotong University
Algorithms (III) Yijia Chen Shanghai Jiaotong University Review of the Previous Lecture Factoring: Given a number N, express it as a product of its prime factors. Many security protocols are based on the
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 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 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 informationAlgorithms (III) Yu Yu. Shanghai Jiaotong University
Algorithms (III) Yu Yu Shanghai Jiaotong University Review of the Previous Lecture Factoring: Given a number N, express it as a product of its prime factors. Many security protocols are based on the assumed
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 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 informationIntroduction to Cryptography Lecture 7
Introduction to Cryptography Lecture 7 Public-Key Encryption: El-Gamal, RSA Benny Pinkas page 1 1 Public key encryption Alice publishes a public key PK Alice. Alice has a secret key SK Alice. Anyone knowing
More informationChapter 7 Public Key Cryptography and Digital Signatures
Chapter 7 Public Key Cryptography and Digital Signatures Every Egyptian received two names, which were known respectively as the true name and the good name, or the great name and the little name; and
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 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 informationIntro to Public Key Cryptography Diffie & Hellman Key Exchange
Intro to Public Key Cryptography Diffie & Hellman Key Exchange Course Summary Introduction Stream & Block Ciphers Block Ciphers Modes (ECB,CBC,OFB) Advanced Encryption Standard (AES) Message Authentication
More informationAppendix A: Introduction to cryptographic algorithms and protocols
Security and Cooperation in Wireless Networks http://secowinet.epfl.ch/ Appendix A: Introduction to cryptographic algorithms and protocols 2007 Levente Buttyán and Jean-Pierre Hubaux symmetric and asymmetric
More informationENGI 8868/9877 Computer and Communications Security III. BLOCK CIPHERS. Symmetric Key Cryptography. insecure channel
(a) Introduction - recall symmetric key cipher: III. BLOCK CIPHERS k Symmetric Key Cryptography k x e k y yʹ d k xʹ insecure channel Symmetric Key Ciphers same key used for encryption and decryption two
More informationIntroduction to Modern Cryptography. Lecture 2. Symmetric Encryption: Stream & Block Ciphers
Introduction to Modern Cryptography Lecture 2 Symmetric Encryption: Stream & Block Ciphers Stream Ciphers Start with a secret key ( seed ) Generate a keying stream i-th bit/byte of keying stream is a function
More informationP2_L6 Symmetric Encryption Page 1
P2_L6 Symmetric Encryption Page 1 Reference: Computer Security by Stallings and Brown, Chapter 20 Symmetric encryption algorithms are typically block ciphers that take thick size input. In this lesson,
More informationCPSC 467: Cryptography and Computer Security
CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 8 September 28, 2015 CPSC 467, Lecture 8 1/44 Chaining Modes Block chaining modes Extending chaining modes to bytes Public-key Cryptography
More informationLecturers: Mark D. Ryan and David Galindo. Cryptography Slide: 24
Assume encryption and decryption use the same key. Will discuss how to distribute key to all parties later Symmetric ciphers unusable for authentication of sender Lecturers: Mark D. Ryan and David Galindo.
More informationCryptographic Hash Functions. Rocky K. C. Chang, February 5, 2015
Cryptographic Hash Functions Rocky K. C. Chang, February 5, 2015 1 This set of slides addresses 2 Outline Cryptographic hash functions Unkeyed and keyed hash functions Security of cryptographic hash functions
More informationCIS 3362 Final Exam. Date: 12/9/2015. Name:
CIS 3362 Final Exam Date: 12/9/2015 Name: 1) (7 pts) Consider an adjusted shift cipher on an alphabet with 36 characters, the letters 'A' through 'Z', followed by the digits '0' through '9', where the
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 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 informationPublic-Key Cryptography. Professor Yanmin Gong Week 3: Sep. 7
Public-Key Cryptography Professor Yanmin Gong Week 3: Sep. 7 Outline Key exchange and Diffie-Hellman protocol Mathematical backgrounds for modular arithmetic RSA Digital Signatures Key management Problem:
More informationEE 595 (PMP) Introduction to Security and Privacy Homework 1 Solutions
EE 595 (PMP) Introduction to Security and Privacy Homework 1 Solutions Assigned: Tuesday, January 17, 2017, Due: Sunday, January 28, 2017 Instructor: Tamara Bonaci Department of Electrical Engineering
More informationLecture 3 Algorithms with numbers (cont.)
Advanced Algorithms Floriano Zini Free University of Bozen-Bolzano Faculty of Computer Science Academic Year 2013-2014 Lecture 3 Algorithms with numbers (cont.) 1 Modular arithmetic For cryptography it
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 informationOther Topics in Cryptography. Truong Tuan Anh
Other Topics in Cryptography Truong Tuan Anh 2 Outline Public-key cryptosystem Cryptographic hash functions Signature schemes Public-Key Cryptography Truong Tuan Anh CSE-HCMUT 4 Outline Public-key cryptosystem
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 informationCryptography and Network Security. Sixth Edition by William Stallings
Cryptography and Network Security Sixth Edition by William Stallings Chapter 9 Public Key Cryptography and RSA Misconceptions Concerning Public-Key Encryption Public-key encryption is more secure from
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 informationPart VI. Public-key cryptography
Part VI Public-key cryptography Drawbacks with symmetric-key cryptography Symmetric-key cryptography: Communicating parties a priori share some secret information. Secure Channel Alice Unsecured Channel
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 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 informationECE 646 Fall 2009 Final Exam December 15, Multiple-choice test
ECE 646 Fall 2009 Final Exam December 15, 2009 Multiple-choice test 1. (1 pt) Parallel processing can be used to speed up the following cryptographic transformations (please note that multiple answers
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 informationTuesday, January 17, 17. Crypto - mini lecture 1
Crypto - mini lecture 1 Cryptography Symmetric key cryptography (secret key crypto): sender and receiver keys identical Asymmetric key cryptography (public key crypto): encryption key public, decryption
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 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 informationAlgorithms (III) Yijia Chen Shanghai Jiaotong University
Algorithms (III) Yijia Chen Shanghai Jiaotong University Review of the Previous Lecture Factoring: Given a number N, express it as a product of its prime factors. Many security protocols are based on the
More informationData Encryption Standard (DES)
Data Encryption Standard (DES) Best-known symmetric cryptography method: DES 1973: Call for a public cryptographic algorithm standard for commercial purposes by the National Bureau of Standards Goals:
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 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 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 informationCrypto Basics. Recent block cipher: AES Public Key Cryptography Public key exchange: Diffie-Hellmann Homework suggestion
Crypto Basics Recent block cipher: AES Public Key Cryptography Public key exchange: Diffie-Hellmann Homework suggestion 1 What is a cryptosystem? K = {0,1} l P = {0,1} m C = {0,1} n, C C E: P K C D: C
More informationCPSC 467: Cryptography and Computer Security
CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 8 September 22, 2014 CPSC 467, Lecture 8 1/59 Chaining Modes Block chaining modes Extending chaining modes to bytes Public-key Cryptography
More informationLecture 1 Applied Cryptography (Part 1)
Lecture 1 Applied Cryptography (Part 1) Patrick P. C. Lee Tsinghua Summer Course 2010 1-1 Roadmap Introduction to Security Introduction to Cryptography Symmetric key cryptography Hash and message authentication
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 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 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 information