CODING AND CRYPTOLOGY III CRYPTOLOGY EXERCISES. The questions with a * are extension questions, and will not be included in the assignment.
|
|
- Antonia Warner
- 5 years ago
- Views:
Transcription
1 CODING AND CRYPTOLOGY III CRYPTOLOGY EXERCISES A selection of the following questions will be chosen by the lecturer to form the Cryptology Assignment. The Cryptology Assignment is due by 5pm Sunday 1 June The questions with a * are extension questions, and will not be included in the assignment. Questions: 1. The following messsage has been sent using the affine cipher with encryption rule e k (x) = 9x BWVYRWLGGBVPVVA Decipher the message. 2. The following messsage has been sent using the affine cipher with encryption rule e k (x) = 3x 8. Decipher the message. XNEHIREYSUXQUVSB 3. You receive the message ZBBAKLBTWEHCGGCB Decipher the message, given that it has been encrypted using an Autokey cipher with key k in the range 15 to You receive the message DQIXFQETXPPZZR Decipher the message, given that it has been encrypted using an Autokey cipher with key k in the range 12 to Stream ciphers are often used with binary alphabets; i.e., P = C = Z 2 = {0, 1} under addition and multiplication mod 2. The encryption and decryption functions are just addition mod 2: e z (x) = x + z and d z (y) = y z = y + z (mod 2). The key stream is given by a linear recurrence relation, such as z i+3 = z i + z i+1 + z i+2 (mod 2). Given that the above relation holds for i > 0 and that z 1 = 1, z 2 = 0, z 3 = 1, successively compute the keys z 4,..., z 16 and find the ciphertext y 1 y 2... y 15 for the plaintext Is the keystream periodic? If so, what is the period?
2 6. Suppose you intercept a ciphertext and the first 12 letters are: ALMZRPIAFOMY You know that it was encrypted with a Hill cipher with key A a 2 2 matrix, and that the plaintext starts with the word WHEN. Find the corresponding plaintext. (NOTE: You will need to solve linear equations in Z 26. When calculating with large numbers 25, 24, 23,... it may be easier to use 1, 2, 3,... respectively (as 25 1 (mod 26), etc.).) 7. The following ciphertext is intercepted: MLGAPOXUJLVSIO You know that it was encrypted with a Hill cipher with key A a 2 2 matrix, and that the plaintext starts with the word JAMES. Find the plaintext. 8. Give a reason why the matrix ( ) 0 4 cannot be used as the key for a Hill cipher operating on Z An Affine Hill Cipher is the following modification of the Hill Cipher: Let m be a positive integer and let P = C = Z m 26. A key K consists of an m m invertible matrix A over Z 26 and a vector b Z m 26. For a plaintext string of length m, (x 1, x 2,..., x m ) P and a key K = (A, b) K, we have (y 1, y 2,..., y m ) = e K ((x 1, x 2,..., x m )) = (x 1, x 2,..., x m )A + b a 11 a a 1m a 21 a a 2m = (x 1, x 2,..., x m )... + (b 1, b 2,..., b m ). a m1 a m2... a mm Suppose that Oscar has learned that m = 3 and that the plaintext string is encrypted to the ciphertext string Compute the key that was used. ADA YAT ABE ACH AND AGA MEO FVO LLE YBA LLZ HDQ UVN RFO KJZ SQU NGF FGX GEE WEM BDG LZC 10. (a) The permutation cipher is defined as follows. Fix a natural number m. The key space consists of all permutations on m symbols, and both the plaintext and ciphertext spaces consist of sequences of m letters in the English alphabet. To encrypt a message, it is broken into blocks of length m, each of which is permuted according to the chosen permutation. The permuted blocks are put together and sent as the ciphertext. (The final block may be padded out if necessary with random letters.) For example, suppose m = 3 and the key is π = ( ) (that is, 1 maps to 3; 2 maps to 1 and maps to 2). Then message is encrypted by m e s s a g e e t e s m a g s e t e and the ciphertext is ESMAGSETE. (Two random letters e and t have been added.) Decipher the following message, given that it was encrypted with a permutation cipher with m = 5.
3 HITEHRYSOTODOCFNDEASEBCDOKIRAEESNTG (b) A special case of the permutation cipher is as follows. Let m and n be positive integers. Write out the plaintext, by rows, in m n rectangles. Then form the ciphertext by taking the columns of these rectangles. For example, with m = 3 and n = 4 we would encrypt the plaintext cryptography by forming the following rectangle: c r y p t o g r a p h y The cipher text would then be CTAROPYGHPRY. (i) Describe how Bob would decrypt a ciphertext (given values for m and n). (ii) Decrypt the following ciphertext, which was obtained using this method of encryption: AYSLSUWAMASETORHSKACNTAOWEOSARTLIHGTHUMUYSOE 11. It is sometimes convenient to use the same encryption and decryption key. In the case of the Hill cipher, this means that the key A would be a matrix that satisfies A = A 1, i.e., A 2 = I. Such a matrix is called involutory. Determine all involutory 2 2 matrices with entries in Z 26. (Hint: what is the determinant of an involutory matrix?) 12. Let P = C = Z 2 and recall the stream cipher described in Question 5 above. More generally, we can generate a keystream using a linear recurrence relation of degree m as follows: we choose initial keys k = (k 1,..., k m ), c = (c 0,..., c m 1 ) Z m 2 and generate a keystream z 1z 2... by letting z i = k i, i = 1,..., m and using the linear recurrence relation z i+m = c 0 z i + c 1 z i c m 1 z i+m 1 (mod 2) to generate z i, i > m. If c 0,..., c m are chosen carefully, then any initial vector k will give rise to a keystream with a period 2 m 1. (So a short key can give rise to a keystream having a long period which makes it harder to break using a ciphertext only attack.) Another appealing aspect of this method of keystream generation is that thekeystream can be produced efficiently in hardware using a linear feedback shift register with m stages (see Stinson for more information). This cryptosystem is vulnerable to known plaintext attack. Suppose Oscar knows a plaintext string and the corresponding cipher text x 1 x 2... x 15 = y 1 y 2... y 15 = To make our calculations for this question easier, we also suppose that Oscar knows that m = 5. (a) Find the corresponding keystream bits z 1 z 2... z 15. (b) Explain why Oscar needs to solve the matrix equation z 1 z 2... z m z 2 z 3... z m+1 (z m+1, z m+2,..., z 2m ) = (c 0, c 1,..., c m 1 )... z m z m+1... z 2m 1 and write down the relevant matrix equation for this example. (c) Verify that = [Recall: A matrix A has inverse B if and only if AB = I where I is the identity matrix.]
4 (d) Hence find the values c 0,..., c 4 and determine the linear recurrence relation used. 13. A block of ciphertext from a Vignére cipher is recieved, and the trigram AZQ is observed to occur at places 3, 21 and 45. Use the Kasiski test to find possible lengths of the codeword. 14. (i) A piece of English text has been encrypted using both the Substitution and Vignére ciphers. The two ciphertexts are given below. Compute the index of coincidence for both and use it to show that (a) is the Vigenere cipher and (b) is the Substitution cipher. (i) VBPUSYNGABTPUSDVZHPWLUSNGVEFGWLGPUSGRMEFOINHNVL (ii) NZXLIKDVIQHXLILNOOKNSLITXLNVVDAVXLICIANVDPDXTNR (a) Letter Freq Letter Freq A 1 N 4 B 2 O 1 C 0 P 4 D 1 Q 0 E 2 R 1 F 2 S 4 G 5 T 1 H 2 U 4 I 1 V 4 J 0 W 2 K 0 X 0 L 3 Y 1 M 1 Z 1 (b) Letter Freq Letter Freq A 2 N 6 B 0 O 2 C 1 P 1 D 4 Q 1 E 0 R 1 F 0 S 1 G 0 T 2 H 1 U 0 I 6 V 5 J 0 W 0 K 2 X 5 L 6 Y 0 M 0 Z 1 (iii) Decrypt the Vigenere cipher given in the above question. (Hint: look for a common trigram and use the Kasiski test to determine the length of the codeword. Guess the plaintext corresponding to the trigram and hence find the codeword.) 15. Prove the second half of Theorem 3.5 from lectures. That is, suppose that (K, C, P, E, D) is a cryptosystem with K = P = C. Show that if (i) every key k is used with equal probability 1/ K ; (ii) for every x P and y C there is a unique key k such that e k (x) = y then the cryptosystem provides perfect secrecy. 16. Consider a cryptosystem with plaintext space P = {A, B, C}, ciphertext space C = {a, b, c, d} and keyspace K = {k 1, k 2, k 3, k 4 }. Suppose that the probability distributions p P on P and p K on K are given by p P (A) = 3 8, p P(B) = 1 2, p P(C) = 1 8, p K (k 1 ) = 1 4, p K(k 2 ) = 1 4, p K(k 3 ) = 1 8, p K(k 4 ) = 3 8. Suppose that the encryption functions are given by the table A B C e k1 a b c e k2 a c d e k3 b c a e k4 d a b
5 (i) Find p C (c). (ii) Find p C (c B). (iii) Find p P (B c). (iv) Does the system have perfect secrecy? 17. Consider a cryptosystem (P, C, K, E, D) with plaintext space P = {A, B, C}, keyspace K = {k 1, k 2, k 3 } and ciphertext space C = {a, b, c, d}. Suppose that the encryption functions are: A B C e k1 a b c e k2 d a b e k3 c d b The probability distribution on P is p P and the probability distribution on K is p K, where p P (A) = 1/2, p P (B) = p P (C) = 1/4 and p K (k 1 ) = p K (k 2 ) = p K (k 3 ) = 1/3. Find (a) p C (c); (b) p C (c A); (c) p P (A c). Does this system have perfect secrecy? Explain your answer. 18. (a) Find all positive integer solutions to 14x + 8y = 64. (b) Find all integer solutions to 91x + 357y = (a) Find all integer solutions to 6x+21y = 27. Hence find all positive integer solutions to this equation. (b) Find all integer solutions to 115x + 395y = (c) Find all integer solutions to 131x + 288y = 1. Hence solve the congruence 131x 1 (mod 288). 20. (a) Solve the congruence 21x 14 (mod 35) (that is, find all solutions mod 35). (b) Find (mod 1024). 21. (a) Solve the congruence 25x 10 (mod 35) (that is, find all solutions mod 35). (b) Find (mod 841). 22. Find, if possible, (mod 1023) and 36 1 (mod 1023). 23. Let n be a positive integer. A Latin square of order n is an n n array L of the integers 1, 2,..., n such that each integer appears exactly once in each row and column. For any Latin square L, we can form a cryptosystem with K = P = C = {1, 2,..., n} and for each key k the encryption rule e k (j) = L(k, j). Under what conditions does this system give perfect secrecy? Prove your assertion. 24. Use Fermat s Theorem to compute the following by hand (a) (mod 29); (b) (mod 17); (c) 2 60 (mod 29); (d) (mod 23).
6 25. One very useful test to determine if the odd integer n is prime is to use Fermat s Theorem. Namely, if we can find an integer a such that a n 1 1 (mod n), then we know that n is not a prime number. But the converse is not true. Suppose that n = pq, where p and q are distinct (odd) primes. (a) Show that if and only if (Hint: consider a pq (mod pq), etc.) (b) Use this fact to construct examples in which (i) a n 1 1 (mod n) but n is not prime; a n 1 = a pq 1 1 (mod n) a p 1 1 (mod q) and a q 1 1 (mod p). (ii) a n 1 1 (mod n). Make sure that your examples are not trivial: in other words, n > 1 and a ±1 (mod n). 26. Consider RSA with modulus n = = 323 and exponent b = 131. (a) Find the decryption exponent a. (b) You receive the ciphertext y 1 = 242, y 2 = 143. Find the first letter of the plaintext. (For this question you may need the solution to question 17(c) above.) 27. The following message has been sent using the RSA system with the key n = 1363, b = 87: Decipher the message. 893, 1265, 406, 171, 980, 1040, 12, 1152, The following message has been sent using the RSA system with the key n = 2173, b = 61: Decipher the message. 956, 2111, 1279, 1646, 1938, 1633, 481, 592, Bob uses the ElGamal public key cryptosystem with prime p = 167 and primitive element e = 23. His private key is a = 15. (a) Calculate Bob s public key f. (b) Charlie wants to send the message m = 2 to Bob. He randomly chooses the number k = 10 to encipher his message. Find the ciphertext that Charlie sends to Bob. (c) Alice encrypts her age and sends the ciphertext (3, 154) to Bob. Decrypt this ciphertext to find Alice s age. 30. The following gives a way that Oscar can forge Bob s signature using the ElGamal Signature Scheme. If Oscar chooses c 1 and c 2 and tries to solve for the message m, he is faced with the Discrete Logarithm problem: namely the computation of log e f c 1 c c 2 1 mod p. Hence Oscar cannot sign a random message using this approach. However, Oscar can sign certain messages as follows: Suppose i, j Z p 1 and (j, p 1) = 1. Let c 1 = e i f j (mod p) c 2 = c 1 j 1 (mod p 1) m = c 1 ij 1 (mod p 1) Prove that (c 1, c 2 ) is a valid signature for the message m.
7 (Note that this method produces valid forged signatures, but they don t allow an opponent to forge a signature on a message that they choose, so it is a minimal threat to the security of the ElGamal Signature Scheme.) 31. This exercise provides an example of protocol failure. It shows how if a cryptosystem is used in a careless way the ciphertext can be decrypted by an opponent without determining the key. Suppose that Bob has an RSA cryptosystem with modulus n and exponent b 1, and that he supplies his friend Charlie the same modulus n but chooses a different key b 2 with (b 1, b 2 ) = 1. Thus Charlie uses the RSA cryptosystem with modulus n and exponent b 2. Consider the situation that arises if Alice encrypts the same plaintext x and sends it to both Bob and Charlie. Thus, she computes y 1 = x b 1 (mod n) and y 2 = x b 2 (mod n), sending y 1 to Bob and y 2 to Charlie. Suppose that Oscar intercepts y 1 and y 2 and computes c 1 and c 2 such that c 1 b 1 + c 2 b 2 = 1. (Why can he do this?) computes x 1 = y c 1 1 yc 2 2 (mod n). (a) Show that the value x 1 computed by Oscar is, in fact, Alice s plaintext x. (b) Illustrate this attack by computing x if n = 15857, b 1 = 77, b 2 = 1879, y 1 = 14742, 8678 and y 2 = 1531, Suppose Bob is using the ElGamal Signature Scheme and he signs two messages m 1 and m 2 using the same key k giving signatures (c 1, c 2 ) and (c 1, c 2 ) respectively. (a) Show that if (c 2 c 2, p 1) = 1, then k can be efficiently computed. (b) Describe how the signature scheme can be broken once k is known. 33. Consider the following variation of the ElGamal Signature Scheme. The setup of the scheme is the same as in lectures, with the following change: c 2 = (m kc 1 )a 1 (mod p 1). (a) Bob sends m, c 1, c 2 to Alice. Show how Alice verifies that c 1, c 2 is a valid signature for the message m. (b) Describe a computational advantage of this modified scheme over the original scheme. 34. The Blom Key Distribution Scheme Suppose we have a group of n people {P 1,..., P n }, and we want any ( two people to share a common secret key. One way to do this is to have a trusted dealer D generate n ) 2 keys kij where k ij is the key shared by P i and P j and then securely give each person the n 1 keys associated with them. This involves a lot of communication, and each person has to store a lot of secret information. The Blom Scheme reduces both of these. initialisation The dealer choses a large prime p and values y 1,..., y n Z p where y i is associated with P i. The dealer choses random a, b, c Z p and forms the polynomial f(x, y) = a + b(x + y) + cxy (mod p). public information: p, y 1,..., y n. secret information: the dealer securely gives P i the polynomial g i (x) = f(x, y i ) (mod p). keys: P i and P j have common key k ij = f(y i, y j ). Suppose p = 131, y 1 = 1, y 2 = 2, y 3 = 3, y 4 = 4 and f(x, y) = (x + y) + 2xy. (i) Write down the secret information D sends P 1, P 2, P 3, P 4. (ii) Write down the 6 keys k ij.
8 (iii) Show how P 1 and P 2 calculate k 12. (iv) Show that P 3 cannot determine any information about k 12. (v) Show that if P 3, P 4 cooperate, then they can find k Suppose we have a Shamir (4, 10)-threshold scheme with x i = i for i = 1,..., 10 in Z 131. Suppose P 2, P 5, P 6 and P 8 pool their shares y 2 = 106, y 5 = 8, y 6 = 34, y 8 = 14. Calculate the secret key. Hence find the shares of the remaining participants. 36. Suppose we have a Shamir (3, 7)-threshold scheme with x i = i for i = 1,..., 7 in Z 23. Suppose that P 1, P 4, P 6 pool their shares y 1 = 5, y 4 = 16, y 6 = 3. Calculate the secret key and find the shares of P 2 and P 3.
9 Using Excel with ciphers Calculations by Computer You can use Excel to help do some of the calculations required for these ciphers. You can convert letters into numbers and back as follows. If you type in the command code(a) Excel returns the number 65. We want A to map to 0, so we if we use the command Excel returns the number as required. code(a) 65 The command char(65) returns the letter A. Similarly, char(66)=b,...,char(90)=z. So for example, to turn a letter * into the corresponding number, use the command 0 code( ) 65 and to turn the number * into the corresponding letter, use the command char( + 65) You can also use the command MOD(number,divisor) in excel. For example, use mod(, 26) to find the remainder of the number * when it is divided by 26. For students who have access to Maple or Matlab, you can use the following commands. power(25,2) mod 67; calculates 25 2 (mod 67) d:=igcd(69,3372); calculates d = gcd(69, 3372) d:=igcdex(69,3372, s, t ); calculates d as above and also finds integers s, t with d = sa + tb. ifactor(3902); factorizes 3902 into primes isprime(337937); tests the number for primality nextprime( ); finds the next prime after the given number All of the above functions should be available in Matlab by just typing maple( function ) to get Matlab to call Maple and implement the command function. For example, after typing matlab you could try maple( power(25,2) mod 67 )
Classical Cryptography
Classical Cryptography CSG 252 Fall 2006 Riccardo Pucella Goals of Cryptography Alice wants to send message X to Bob Oscar is on the wire, listening to communications Alice and Bob share a key K Alice
More informationFinal Exam Math 105: Topics in Mathematics Cryptology, the Science of Secret Writing Rhodes College Tuesday, 30 April :30 11:00 a.m.
Final Exam Math 10: Topics in Mathematics Cryptology, the Science of Secret Writing Rhodes College Tuesday, 0 April 2002 :0 11:00 a.m. Instructions: Please be as neat as possible (use a pencil), and show
More informationUniv.-Prof. Dr. rer. nat. Rudolf Mathar. Written Examination. Cryptography. Tuesday, August 29, 2017, 01:30 p.m.
Cryptography Univ.-Prof. Dr. rer. nat. Rudolf Mathar 1 2 3 4 15 15 15 15 60 Written Examination Cryptography Tuesday, August 29, 2017, 01:30 p.m. Name: Matr.-No.: Field of study: Please pay attention to
More informationPublic-Key Cryptosystems CHAPTER 4
Public-Key Cryptosystems CHAPTER 4 Introduction How to distribute the cryptographic keys? Naïve Solution Naïve Solution Give every user P i a separate random key K ij to communicate with every P j. Disadvantage:
More informationSecurity of Networks (12) Exercises
(12) Exercises 1.1 Below are given four examples of ciphertext, one obtained from a Substitution Cipher, one from a Vigenere Cipher, one from an Affine Cipher, and one unspecified. In each case, the task
More informationWinter 2008 Introduction to Modern Cryptography Benny Chor and Rani Hod. Assignment #2
0368.3049.01 Winter 2008 Introduction to Modern Cryptography Benny Chor and Rani Hod Assignment #2 Published Sunday, February 17, 2008 and very slightly revised Feb. 18. Due Tues., March 4, in Rani Hod
More informationUniversity of Regina Department of Mathematics & Statistics Final Examination (April 21, 2009)
Make sure that this examination has 10 numbered pages University of Regina Department of Mathematics & Statistics Final Examination 200910 (April 21, 2009) Mathematics 124 The Art and Science of Secret
More informationLemma 1.2. (1) If p is prime, then ϕ(p) = p 1. (2) If p q are two primes, then ϕ(pq) = (p 1)(q 1).
1 Background 1.1 The group of units MAT 3343, APPLIED ALGEBRA, FALL 2003 Handout 3: The RSA Cryptosystem Peter Selinger Let (R, +, ) be a ring. Then R forms an abelian group under addition. R does not
More informationMATH 158 FINAL EXAM 20 DECEMBER 2016
MATH 158 FINAL EXAM 20 DECEMBER 2016 Name : The exam is double-sided. Make sure to read both sides of each page. The time limit is three hours. No calculators are permitted. You are permitted one page
More informationRSA RSA public key cryptosystem
RSA 1 RSA As we have seen, the security of most cipher systems rests on the users keeping secret a special key, for anyone possessing the key can encrypt and/or decrypt the messages sent between them.
More informationMATH3302 Cryptography Problem Set 2
MATH3302 Cryptography Problem Set 2 These questions are based on the material in Section 4: Shannon s Theory, Section 5: Modern Cryptography, Section 6: The Data Encryption Standard, Section 7: International
More information2. Cryptography 2.5. ElGamal cryptosystems and Discrete logarithms
CRYPTOGRAPHY 19 Cryptography 5 ElGamal cryptosystems and Discrete logarithms Definition Let G be a cyclic group of order n and let α be a generator of G For each A G there exists an uniue 0 a n 1 such
More informationMathematics of Cryptography
UNIT - III Mathematics of Cryptography Part III: Primes and Related Congruence Equations 1 Objectives To introduce prime numbers and their applications in cryptography. To discuss some primality test algorithms
More informationQuestion: Total Points: Score:
University of California, Irvine COMPSCI 134: Elements of Cryptography and Computer and Network Security Midterm Exam (Fall 2016) Duration: 90 minutes November 2, 2016, 7pm-8:30pm Name (First, Last): Please
More informationCryptography. P. Danziger. Transmit...Bob...
10.4 Cryptography P. Danziger 1 Cipher Schemes A cryptographic scheme is an example of a code. The special requirement is that the encoded message be difficult to retrieve without some special piece of
More informationCPE 776:DATA SECURITY & CRYPTOGRAPHY. Some Number Theory and Classical Crypto Systems
CPE 776:DATA SECURITY & CRYPTOGRAPHY Some Number Theory and Classical Crypto Systems Dr. Lo ai Tawalbeh Computer Engineering Department Jordan University of Science and Technology Jordan Some Number Theory
More informationSolutions to the Midterm Test (March 5, 2011)
MATC16 Cryptography and Coding Theory Gábor Pete University of Toronto Scarborough Solutions to the Midterm Test (March 5, 2011) YOUR NAME: DO NOT OPEN THIS BOOKLET UNTIL INSTRUCTED TO DO SO. INSTRUCTIONS:
More informationTheme : Cryptography. Instructor : Prof. C Pandu Rangan. Speaker : Arun Moorthy CS
1 C Theme : Cryptography Instructor : Prof. C Pandu Rangan Speaker : Arun Moorthy 93115 CS 2 RSA Cryptosystem Outline of the Talk! Introduction to RSA! Working of the RSA system and associated terminology!
More information} has dimension = k rank A > 0 over F. For any vector b!
FINAL EXAM Math 115B, UCSB, Winter 2009 - SOLUTIONS Due in SH6518 or as an email attachment at 12:00pm, March 16, 2009. You are to work on your own, and may only consult your notes, text and the class
More informationCandidates must show on each answer book the type of calculator used. Only calculators permitted under UEA Regulations may be used.
UNIVERSITY OF EAST ANGLIA School of Mathematics May/June UG Examination 2010 2011 CRYPTOGRAPHY Time allowed: 2 hours Attempt THREE questions. Candidates must show on each answer book the type of calculator
More informationLecture 1: Introduction to Public key cryptography
Lecture 1: Introduction to Public key cryptography Thomas Johansson T. Johansson (Lund University) 1 / 44 Key distribution Symmetric key cryptography: Alice and Bob share a common secret key. Some means
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 3 January 22, 2013 CPSC 467b, Lecture 3 1/35 Perfect secrecy Caesar cipher Loss of perfection Classical ciphers One-time pad Affine
More informationNumber theory (Chapter 4)
EECS 203 Spring 2016 Lecture 12 Page 1 of 8 Number theory (Chapter 4) Review Compute 6 11 mod 13 in an efficient way What is the prime factorization of 100? 138? What is gcd(100, 138)? What is lcm(100,138)?
More information5199/IOC5063 Theory of Cryptology, 2014 Fall
5199/IOC5063 Theory of Cryptology, 2014 Fall Homework 2 Reference Solution 1. This is about the RSA common modulus problem. Consider that two users A and B use the same modulus n = 146171 for the RSA encryption.
More informationCPSC 467: Cryptography and Computer Security
CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 11 October 7, 2015 CPSC 467, Lecture 11 1/37 Digital Signature Algorithms Signatures from commutative cryptosystems Signatures from
More information5. Classical Cryptographic Techniques from modular arithmetic perspective
. Classical Cryptographic Techniques from modular arithmetic perspective By classical cryptography we mean methods of encipherment that have been used from antiquity through the middle of the twentieth
More informationWeek 7 An Application to Cryptography
SECTION 9. EULER S GENERALIZATION OF FERMAT S THEOREM 55 Week 7 An Application to Cryptography Cryptography the study of the design and analysis of mathematical techniques that ensure secure communications
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 11 February 21, 2013 CPSC 467b, Lecture 11 1/27 Discrete Logarithm Diffie-Hellman Key Exchange ElGamal Key Agreement Primitive Roots
More informationLecture Notes, Week 6
YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467b: Cryptography and Computer Security Week 6 (rev. 3) Professor M. J. Fischer February 15 & 17, 2005 1 RSA Security Lecture Notes, Week 6 Several
More informationCRYPTOGRAPHY AND NUMBER THEORY
CRYPTOGRAPHY AND NUMBER THEORY XINYU SHI Abstract. In this paper, we will discuss a few examples of cryptographic systems, categorized into two different types: symmetric and asymmetric cryptography. We
More informationCryptography. pieces from work by Gordon Royle
Cryptography pieces from work by Gordon Royle The set-up Cryptography is the mathematics of devising secure communication systems, whereas cryptanalysis is the mathematics of breaking such systems. We
More information10 Public Key Cryptography : RSA
10 Public Key Cryptography : RSA 10.1 Introduction The idea behind a public-key system is that it might be possible to find a cryptosystem where it is computationally infeasible to determine d K even if
More information10 Modular Arithmetic and Cryptography
10 Modular Arithmetic and Cryptography 10.1 Encryption and Decryption Encryption is used to send messages secretly. The sender has a message or plaintext. Encryption by the sender takes the plaintext and
More informationIntroduction to Modern Cryptography. Benny Chor
Introduction to Modern Cryptography Benny Chor RSA Public Key Encryption Factoring Algorithms Lecture 7 Tel-Aviv University Revised March 1st, 2008 Reminder: The Prime Number Theorem Let π(x) denote the
More informationSolution to Midterm Examination
YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467a: Cryptography and Computer Security Handout #13 Xueyuan Su November 4, 2008 Instructions: Solution to Midterm Examination This is a closed book
More informationPublic Key Cryptography
T H E U N I V E R S I T Y O F B R I T I S H C O L U M B I A Public Key Cryptography EECE 412 1 What is it? Two keys Sender uses recipient s public key to encrypt Receiver uses his private key to decrypt
More informationSecurity Issues in Cloud Computing Modern Cryptography II Asymmetric Cryptography
Security Issues in Cloud Computing Modern Cryptography II Asymmetric Cryptography Peter Schwabe October 21 and 28, 2011 So far we assumed that Alice and Bob both have some key, which nobody else has. How
More informationAttempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 CRYPTOGRAPHY MTHD6025A Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt
More informationThe RSA cryptosystem and primality tests
Mathematics, KTH Bengt Ek November 2015 Supplementary material for SF2736, Discrete mathematics: The RSA cryptosystem and primality tests Secret codes (i.e. codes used to make messages unreadable to outsiders
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 9 February 6, 2012 CPSC 467b, Lecture 9 1/53 Euler s Theorem Generating RSA Modulus Finding primes by guess and check Density of
More informationSol: First, calculate the number of integers which are relative prime with = (1 1 7 ) (1 1 3 ) = = 2268
ò{çd@àt ø 2005.0.3. Suppose the plaintext alphabets include a z, A Z, 0 9, and the space character, therefore, we work on 63 instead of 26 for an affine cipher. How many keys are possible? What if we add
More informationLecture Notes. Advanced Discrete Structures COT S
Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-27 Recap ADFGX Cipher Block Cipher Modes of Operation Hill Cipher Inverting a Matrix (mod n) Encryption: Hill Cipher Example Multiple
More informationChapter 8 Public-key Cryptography and Digital Signatures
Chapter 8 Public-key Cryptography and Digital Signatures v 1. Introduction to Public-key Cryptography 2. Example of Public-key Algorithm: Diffie- Hellman Key Exchange Scheme 3. RSA Encryption and Digital
More informationOne can use elliptic curves to factor integers, although probably not RSA moduli.
Elliptic Curves Elliptic curves are groups created by defining a binary operation (addition) on the points of the graph of certain polynomial equations in two variables. These groups have several properties
More informationPublic Key Cryptography
Public Key Cryptography Spotlight on Science J. Robert Buchanan Department of Mathematics 2011 What is Cryptography? cryptography: study of methods for sending messages in a form that only be understood
More informationIntroduction to Modern Cryptography. Benny Chor
Introduction to Modern Cryptography Benny Chor RSA: Review and Properties Factoring Algorithms Trapdoor One Way Functions PKC Based on Discrete Logs (Elgamal) Signature Schemes Lecture 8 Tel-Aviv University
More informationDM49-2. Obligatoriske Opgave
DM49-2. Obligatoriske Opgave Jacob Christiansen, moffe42, 130282 Thomas Nordahl Pedersen, nordahl, 270282 1/4-05 Indhold 1 Opgave 1 - Public Exponent 2 1.1 a.................................. 2 1.2 b..................................
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 10 February 19, 2013 CPSC 467b, Lecture 10 1/45 Primality Tests Strong primality tests Weak tests of compositeness Reformulation
More informationLecture 19: Public-key Cryptography (Diffie-Hellman Key Exchange & ElGamal Encryption) Public-key Cryptography
Lecture 19: (Diffie-Hellman Key Exchange & ElGamal Encryption) Recall In private-key cryptography the secret-key sk is always established ahead of time The secrecy of the private-key cryptography relies
More informationCryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 33 The Diffie-Hellman Problem
More informationNotes 10: Public-key cryptography
MTH6115 Cryptography Notes 10: Public-key cryptography In this section we look at two other schemes that have been proposed for publickey ciphers. The first is interesting because it was the earliest such
More informationTHE RSA CRYPTOSYSTEM
THE RSA CRYPTOSYSTEM SILVIA ROBLES Abstract. This paper explores the history and mathematics behind the RSA cryptosystem, including the idea of public key cryptosystems and number theory. It outlines the
More informationJay Daigle Occidental College Math 401: Cryptology
3 Block Ciphers Every encryption method we ve studied so far has been a substitution cipher: that is, each letter is replaced by exactly one other letter. In fact, we ve studied stream ciphers, which produce
More informationYALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE
YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467a: Cryptography and Computer Security Notes 13 (rev. 2) Professor M. J. Fischer October 22, 2008 53 Chinese Remainder Theorem Lecture Notes 13 We
More informationShift Cipher. For 0 i 25, the ith plaintext character is. E.g. k = 3
Shift Cipher For 0 i 25, the ith plaintext character is shifted by some value 0 k 25 (mod 26). E.g. k = 3 a b c d e f g h i j k l m n o p q r s t u v w x y z D E F G H I J K L M N O P Q R S T U V W X Y
More informationPublic Key Encryption
Public Key Encryption KG October 17, 2017 Contents 1 Introduction 1 2 Public Key Encryption 2 3 Schemes Based on Diffie-Hellman 3 3.1 ElGamal.................................... 5 4 RSA 7 4.1 Preliminaries.................................
More informationSlides by Kent Seamons and Tim van der Horst Last Updated: Oct 1, 2013
RSA Slides by Kent Seamons and Tim van der Horst Last Updated: Oct 1, 2013 Recap Recap Number theory o What is a prime number? o What is prime factorization? o What is a GCD? o What does relatively prime
More informationCosc 412: Cryptography and complexity Lecture 7 (22/8/2018) Knapsacks and attacks
1 Cosc 412: Cryptography and complexity Lecture 7 (22/8/2018) Knapsacks and attacks Michael Albert michael.albert@cs.otago.ac.nz 2 This week Arithmetic Knapsack cryptosystems Attacks on knapsacks Some
More informationDefinition: For a positive integer n, if 0<a<n and gcd(a,n)=1, a is relatively prime to n. Ahmet Burak Can Hacettepe University
Number Theory, Public Key Cryptography, RSA Ahmet Burak Can Hacettepe University abc@hacettepe.edu.tr The Euler Phi Function For a positive integer n, if 0
More informationCryptography and Secure Communication Protocols
Cryptography and Secure Communication Protocols Jayadev Misra The University of Texas at Austin October 1, 2003 Contents 1 Introduction 1 2 Early Encryption Schemes 2 2.1 Substitution cyphers.........................
More informationMathematical Foundations of Public-Key Cryptography
Mathematical Foundations of Public-Key Cryptography Adam C. Champion and Dong Xuan CSE 4471: Information Security Material based on (Stallings, 2006) and (Paar and Pelzl, 2010) Outline Review: Basic Mathematical
More informationRSA ENCRYPTION USING THREE MERSENNE PRIMES
Int. J. Chem. Sci.: 14(4), 2016, 2273-2278 ISSN 0972-768X www.sadgurupublications.com RSA ENCRYPTION USING THREE MERSENNE PRIMES Ch. J. L. PADMAJA a*, V. S. BHAGAVAN a and B. SRINIVAS b a Department of
More informationWritten examination. Tuesday, August 18, 2015, 08:30 a.m.
Advanced Methods of Cryptography Univ.-Prof. Dr. rer. nat. Rudolf Mathar 1 2 3 4 19 20 11 20 70 Written examination Tuesday, August 18, 2015, 08:30 a.m. Name: Matr.-No.: Field of study: Please pay attention
More informationCPSC 467b: Cryptography and Computer Security
Outline Quadratic residues Useful tests Digital Signatures CPSC 467b: Cryptography and Computer Security Lecture 14 Michael J. Fischer Department of Computer Science Yale University March 1, 2010 Michael
More information1 Recommended Reading 1. 2 Public Key/Private Key Cryptography Overview RSA Algorithm... 2
Contents 1 Recommended Reading 1 2 Public Key/Private Key Cryptography 1 2.1 Overview............................................. 1 2.2 RSA Algorithm.......................................... 2 3 A Number
More informationSolutions for week 1, Cryptography Course - TDA 352/DIT 250
Solutions for week, Cryptography Course - TDA 352/DIT 250 In this weekly exercise sheet: you will use some historical ciphers, the OTP, the definition of semantic security and some combinatorial problems.
More informationCryptography IV: Asymmetric Ciphers
Cryptography IV: Asymmetric Ciphers Computer Security Lecture 7 David Aspinall School of Informatics University of Edinburgh 31st January 2011 Outline Background RSA Diffie-Hellman ElGamal Summary Outline
More informationTutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction
Tutorial on Quantum Computing Vwani P. Roychowdhury Lecture 1: Introduction 1 & ) &! # Fundamentals Qubits A single qubit is a two state system, such as a two level atom we denote two orthogonal states
More informationTECHNISCHE UNIVERSITEIT EINDHOVEN Faculty of Mathematics and Computer Science Exam Cryptology, Tuesday 30 October 2018
Faculty of Mathematics and Computer Science Exam Cryptology, Tuesday 30 October 2018 Name : TU/e student number : Exercise 1 2 3 4 5 total points Notes: Please hand in all sheets at the end of the exam.
More informationPublic-Key Encryption: ElGamal, RSA, Rabin
Public-Key Encryption: ElGamal, RSA, Rabin Introduction to Modern Cryptography Benny Applebaum Tel-Aviv University Fall Semester, 2011 12 Public-Key Encryption Syntax Encryption algorithm: E. Decryption
More informationOverview. Background / Context. CSC 580 Cryptography and Computer Security. March 21, 2017
CSC 580 Cryptography and Computer Security Math for Public Key Crypto, RSA, and Diffie-Hellman (Sections 2.4-2.6, 2.8, 9.2, 10.1-10.2) March 21, 2017 Overview Today: Math needed for basic public-key crypto
More informationComputer Science A Cryptography and Data Security. Claude Crépeau
Computer Science 308-547A Cryptography and Data Security Claude Crépeau These notes are, largely, transcriptions by Anton Stiglic of class notes from the former course Cryptography and Data Security (308-647A)
More informationLattices. A Lattice is a discrete subgroup of the additive group of n-dimensional space R n.
Lattices A Lattice is a discrete subgroup of the additive group of n-dimensional space R n. Lattices have many uses in cryptography. They may be used to define cryptosystems and to break other ciphers.
More informationCIS 551 / TCOM 401 Computer and Network Security
CIS 551 / TCOM 401 Computer and Network Security Spring 2008 Lecture 15 3/20/08 CIS/TCOM 551 1 Announcements Project 3 available on the web. Get the handout in class today. Project 3 is due April 4th It
More informationIntroduction to Cryptology. Lecture 2
Introduction to Cryptology Lecture 2 Announcements 2 nd vs. 1 st edition of textbook HW1 due Tuesday 2/9 Readings/quizzes (on Canvas) due Friday 2/12 Agenda Last time Historical ciphers and their cryptanalysis
More informationENEE 457: Computer Systems Security 10/3/16. Lecture 9 RSA Encryption and Diffie-Helmann Key Exchange
ENEE 457: Computer Systems Security 10/3/16 Lecture 9 RSA Encryption and Diffie-Helmann Key Exchange Charalampos (Babis) Papamanthou Department of Electrical and Computer Engineering University of Maryland,
More informationImplementation Tutorial on RSA
Implementation Tutorial on Maciek Adamczyk; m adamczyk@umail.ucsb.edu Marianne Magnussen; mariannemagnussen@umail.ucsb.edu Adamczyk and Magnussen Spring 2018 1 / 13 Overview Implementation Tutorial Introduction
More informationLecture 18 - Secret Sharing, Visual Cryptography, Distributed Signatures
Lecture 18 - Secret Sharing, Visual Cryptography, Distributed Signatures Boaz Barak November 27, 2007 Quick review of homework 7 Existence of a CPA-secure public key encryption scheme such that oracle
More informationPractice Assignment 2 Discussion 24/02/ /02/2018
German University in Cairo Faculty of MET (CSEN 1001 Computer and Network Security Course) Dr. Amr El Mougy 1 RSA 1.1 RSA Encryption Practice Assignment 2 Discussion 24/02/2018-29/02/2018 Perform encryption
More informationIntroduction to Cybersecurity Cryptography (Part 5)
Introduction to Cybersecurity Cryptography (Part 5) Prof. Dr. Michael Backes 13.01.2017 February 17 th Special Lecture! 45 Minutes Your Choice 1. Automotive Security 2. Smartphone Security 3. Side Channel
More informationPublic Key Cryptography. All secret key algorithms & hash algorithms do the same thing but public key algorithms look very different from each other.
Public Key Cryptography All secret key algorithms & hash algorithms do the same thing but public key algorithms look very different from each other. The thing that is common among all of them is that each
More informationTHE RSA ENCRYPTION SCHEME
THE RSA ENCRYPTION SCHEME Contents 1. The RSA Encryption Scheme 2 1.1. Advantages over traditional coding methods 3 1.2. Proof of the decoding procedure 4 1.3. Security of the RSA Scheme 4 1.4. Finding
More informationLecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya Resources: Kenneth Rosen,
More informationPublic Key Algorithms
Public Key Algorithms Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse571-09/
More informationThe Hill Cipher A Linear Algebra Perspective
The Hill Cipher A Linear Algebra Perspective Contents 1 Introduction to Classical Cryptography 3 1.1 Alice, Bob & Eve................................. 3 1.2 Types of Attacks.................................
More informationRSA. Ramki Thurimella
RSA Ramki Thurimella Public-Key Cryptography Symmetric cryptography: same key is used for encryption and decryption. Asymmetric cryptography: different keys used for encryption and decryption. Public-Key
More informationL7. Diffie-Hellman (Key Exchange) Protocol. Rocky K. C. Chang, 5 March 2015
L7. Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang, 5 March 2015 1 Outline The basic foundation: multiplicative group modulo prime The basic Diffie-Hellman (DH) protocol The discrete logarithm
More informationCryptography. Lecture 2: Perfect Secrecy and its Limitations. Gil Segev
Cryptography Lecture 2: Perfect Secrecy and its Limitations Gil Segev Last Week Symmetric-key encryption (KeyGen, Enc, Dec) Historical ciphers that are completely broken The basic principles of modern
More informationECE596C: Handout #11
ECE596C: Handout #11 Public Key Cryptosystems Electrical and Computer Engineering, University of Arizona, Loukas Lazos Abstract In this lecture we introduce necessary mathematical background for studying
More informationElliptic Curves. Giulia Mauri. Politecnico di Milano website:
Elliptic Curves Giulia Mauri Politecnico di Milano email: giulia.mauri@polimi.it website: http://home.deib.polimi.it/gmauri May 13, 2015 Giulia Mauri (DEIB) Exercises May 13, 2015 1 / 34 Overview 1 Elliptic
More informationSIGNATURE SCHEMES & CRYPTOGRAPHIC HASH FUNCTIONS. CIS 400/628 Spring 2005 Introduction to Cryptography
SIGNATURE SCHEMES & CRYPTOGRAPHIC HASH FUNCTIONS CIS 400/628 Spring 2005 Introduction to Cryptography This is based on Chapter 8 of Trappe and Washington DIGITAL SIGNATURES message sig 1. How do we bind
More informationPublic-key Cryptography and elliptic curves
Public-key Cryptography and elliptic curves Dan Nichols nichols@math.umass.edu University of Massachusetts Oct. 14, 2015 Cryptography basics Cryptography is the study of secure communications. Here are
More informationCHALMERS GÖTEBORGS UNIVERSITET. TDA352 (Chalmers) - DIT250 (GU) 11 April 2017, 8:30-12:30
CHALMERS GÖTEBORGS UNIVERSITET CRYPTOGRAPHY TDA35 (Chalmers) - DIT50 (GU) 11 April 017, 8:30-1:30 No extra material is allowed during the exam except for pens and a simple calculator (not smartphones).
More informationENEE 459-C Computer Security. Message authentication (continue from previous lecture)
ENEE 459-C Computer Security Message authentication (continue from previous lecture) Last lecture Hash function Cryptographic hash function Message authentication with hash function (attack?) with cryptographic
More informationCourse 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography
Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups
More informationExam Security January 19, :30 11:30
Exam Security January 19, 2016. 8:30 11:30 You can score a maximum of 100. Each question indicates how many it is worth. You are NOT allowed to use books or notes, or a (smart) phone. You may answer in
More informationand Other Fun Stuff James L. Massey
Lectures in Cryptology 10-14 October 2005 School of Engineering and Science International University Bremen Lecture 3: Public-Key Cryptography and Other Fun Stuff James L. Massey [Prof.-em. ETH Zürich,
More informationTheory of Computation Chapter 12: Cryptography
Theory of Computation Chapter 12: Cryptography Guan-Shieng Huang Dec. 20, 2006 0-0 Introduction Alice wants to communicate with Bob secretely. x Alice Bob John Alice y=e(e,x) y Bob y??? John Assumption
More informationPublic Key 9/17/2018. Symmetric Cryptography Review. Symmetric Cryptography: Shortcomings (1) Symmetric Cryptography: Analogy
Symmetric Cryptography Review Alice Bob Public Key x e K (x) y d K (y) x K K Instructor: Dr. Wei (Lisa) Li Department of Computer Science, GSU Two properties of symmetric (secret-key) crypto-systems: The
More informationExercise Sheet Cryptography 1, 2011
Cryptography 1 http://www.cs.ut.ee/~unruh/crypto1-11/ Exercise Sheet Cryptography 1, 2011 Exercise 1 DES The Data Encryption Standard (DES) is a very famous and widely used block cipher. It maps 64-bit
More information