Public-Key Cryptosystems CHAPTER 4
|
|
- Daniel Harrington
- 5 years ago
- Views:
Transcription
1 Public-Key Cryptosystems CHAPTER 4
2 Introduction
3 How to distribute the cryptographic keys?
4 Naïve Solution
5 Naïve Solution Give every user P i a separate random key K ij to communicate with every P j. Disadvantage: a quadratic number of keys is needed
6 Problems Someone (Key Distribution Center, KDC) need to distribute the keys. Feasible: if the users are, e.g., working in one company. Infeasible: if the users on the internet. Relies on the honesty of KDC. KDC needs to be permanently available. The users need to store large number of keys in a secure way For 1000 users, we need to = keys. Solution?
7 Public Key Cryptography PKC also solves the message source authentication problem: Only Alice can sign a message, using K. Anyone can verify the signature, using K'. Only if such a function could be found...
8 Diffie-Hellman Key Exchange The DHKE established in 1976 fundamentally has its security based on the DLP. It is obvious that to solve the DLP via polynomial time algorithms is not feasible. The protocol allows two users to exchange a secret key over an insecure medium without any prior secrets.
9 Diffie-Hellman Key Exchange Some Preliminaries: Def: An element g is called a generator of a group G if every element in G can be expressed as the product of finitely many powers of g. Def: If p 1 is an integer, then the numbers coprime to p, taken modulo p, form a group with multiplication as its operation. It is written as (Z/pZ) or Z p*. This group is cyclic and any generator, g, of the group is called a primitive root mod p.
10 Diffie-Hellman Key Exchange Public Parameter Creation A trusted party chooses and publishes a large prime p and an integer g having a large order in Z p Alice Chooses a secret random integer a. Computes A g a (mod p) Along sends A to Busu Private Computation (Setup) Public Exchange of Values Private Computation Bob Chooses a secret random integer b. Computes B g b (mod p) Busu sends B to Along Along computes B a (mod p) Busu computes A b (mod p) The shared secret key is B a (mod p) (g b ) a g ab (g a ) b A b (mod p)
11 Diffie-Hellman Key Exchange If Eve wants to compute k, then she would need either a or b. Otherwise, Eve would need to solve a Discrete Logarithm Problem. There is no known algorithm to accomplish this in a reasonable amount of time.
12 Diffie-Hellman Key Exchange Example: Suppose Alice and Bob agree to use p = 47 and g = 5. Setup Alice chooses a number between 0 and 46, say a = 18. Bob chooses a number between 0 and 46, say b = 22. Exchange Alice publishes ga (mod p), i.e. u = 518 (mod 47) = 2. Bob publishes gb (mod p), i.e. v = 522 (mod 47) = 28.
13 Diffie-Hellman Key Exchange Private Computation: If Alice wants to know the secret key k, she takes Bob s public number, v = 28, and raises it to her private number, a = 18 (taking the result mod 47). This gives her: 2818 (mod 47) = 24. If Bob wants to know the secret key, he takes Alice s public number, u = 2, and raises it to his private number, b = 22 (taking the result mod 47). This gives him: 222 (mod 47) = 24. Thus, Alice and Bob have agreed upon a secret key, k = 24.
14 El-Gammal Public Key Cryptosystem The El-Gammal PKC was designed by Taher El-Gammal in It came after the RSA, but because of its underlying structure that utilizes the DLP, we present it first. Differing from the objective of a key exchange mechanism, a cryptosystem has the objective to encrypt messages.
15 Public Parameter Creation A trusted third party chooses and publishes a large prime p and a primitive root g modulo p. Key Creation Alice Bob Choose a private key 1 a p-1. Compute A = g a (mod p). Publish the public key A. Encryption Decryption Choose plaintext m. Choose random ephemeral key k. Use Along s public key A to compute: i. c 1 = g k (mod p) ii. c 2 = ma k (mod p) 4. Send ciphertext (c 1, c 2 ) to Along. Compute (c 1a ) -1 c 2 (mod p)=m.
16 El-Gammal Public Key Cryptosystem Proof: (Proof of correctness) a c 1 1 c 2 g ka 1 ma k g ka 1 mg ak m mod p. Example Create your own example.
17 El-Gammal Public Key Cryptosystem Plaintext x is masked by a random factor, g αk mod p. DH problem: Given g α, g k mod p, what is g αk mod p? p, g can be common. Then g k mod p can be computed in advance. Same k should not be used repeatedly. Performance: encryption: two exponentiations decryption: one exponentiation, one inversion Size: Ciphertext twice as large as plaintext.
18 Cryptanalysis on DHKE In general Eve has the following objective in order to break into a DHKE protocol: obtain Alice s random secret exponent or Bob s random secret exponent solving the DLP, but no sufficient algorithm solve it in feasible time. Is that the only way where Eve can break into the system?
19 Cryptanalysis on DHKE Definition 4.7.1(Diffie Hellman Problem) Let p be a prime number and g an integer. The Diffie Hellman Problem (DHP) is the problem of computing the value g ab mod p from the known values g a mod p and g b mod p.
20 Cryptanalysis on DHKE Remark It is clear that DHP is NOT MUCH HARDER THAN DLP (DHP p DLP). That is, if you solve DLP you solve DHP. BUT if Eve has an algorithm that solves DHP, Eve does not need to solve DLP. This means, there MAYBE a way to solve DHP without solving DLP. Unless if you can prove that DHP p DLP, it is only then Eve will have no other option to break DHKE other than solving the DLP. (DO YOU UNDERSTAND???)
21 Man in the middle attack on DHKE The MITM attack upon the DHKE is conducted as follows: Eve observes a key exchange between Alice and Bob. Eve intercepts Bob public value, B g b mod p. Eve masquerades as Alice and returns to Bob her public value, E g e mod p. Eve masquerades as Bob and returns to Alice her public value, E g e mod p. Then both Eve and Alice have the same shared key EA = g ae mod p and Eve and Bob have the same shared key EB = g be mod p Then upon intercepting intended from Bob to Alice, Eve can now read/modify. After reading, Eve can either modify or relay the cipher back to Alice encrypted with EA. Alice can decrypt by using Eve s public (to generate AE = g ea mod p ).
22 RSA Cryptosystem Definition (Euler s φ function) defined as the number of positive integers less than and relatively prime to n Let φ N be the number of integers 1 a N such that gcd a, N = 1 Example φ 10 = 4. The integers are 1,3,7,9 Proposition Let p and q be 2 distinct primes and N = pq. Then, φ N = p 1 q 1 Proof: (Assignment) Remark The function φ N counts the number of numbers that are relatively prime to N.
23 RSA Cryptosystem Theorem (Euler s theorem) If gcd a, N = 1, then aφ N 1 mod N, where is Euler s totient function. Proof: Example Compute mod 101. Solution: 101 is prime. From Fermat s little theorem mod 101. Therefore, mod 101.
24 RSA Cryptosystem Remark It is obvious that FLT helps to reduce the number of exponentiations involved. Exercises Divide by 101. What is the remainder? 2. Suppose you write a message as a number m mod 31. Encrypt m as m 7 mod 31. How would you decrypt? Assignment Hint: Decryption is done by raising the ciphertext to a power mod 31. Fermat s little theorem will be useful.
25 The RSA Algorithm Key Generation INPUT: The size n of the prime numbers. OUTPUT: A public key tuple N, e and a private key tuple p, q, d. 1. Generate two random and distinct n-bit strong primes p, q. 2. Compute N = pq and φ N = p 1 q Choose random e such that gcd e, φ N = Compute integer d such that ed 1 mod φ N. 5. Return the public key tuple N, e and a private key pair p, q, d.
26 The RSA Algorithm Encryption INPUT: The public key pair N, e and the message M Z N. OUTPUT: The ciphertext C. Compute C M e mod N Decryption INPUT: The private key d and the message ciphertext C. OUTPUT: The message M. Compute M C d mod N Proof: (Proof of correctness)
27 The RSA Algorithm Example: Perform encryption and decryption using the RSA algorithm for the following: 1. p = 17; q = 11, e = 7;M = p = 11; q = 13, e = 11;M = 7 3. p = 17; q = 31, e = 7;M = 2 In a public-key system using RSA, you intercept the ciphertext C = 10 sent to a user whose public key is e = 5, n = 35.What is the plaintext M?
28 RSA Cryptosystem Remark What is difficult for the adversary to do in order to break RSA? 2. Are the problems that the adversary need to overcome solvable in polynomial time? 3. Do you have an idea how to break RSA? Remark The RSA PKC relies on the difficulty of solving equations of the form x e c mod N (or c x e mod N ) where the quantities e, c and N are known. The security of RSA relies on the assumption that it is difficult to compute the e th roots modulo N. This problem is also known as the RSA problem.
29 RSA Cryptosystem Proposition Solving RSA problem p Factoring N = pq. Proof: If N = pq is factored then d can be computed via de 1 mod φ N RSA problem will be solved.. Then Remark It is still unknown whether if one solves the RSA problem, one is able to factor N = pq.
30 RSA Cryptosystem Proposition Let p and q be distinct primes and let e 1 be an integer that satisfies the condition gcd e, p 1 q 1 = 1. We know there exists a multiplicative inverse d of e such that de 1 mod p 1 q 1. Then the congruence relation x e c mod pq has the unique solution x c d mod pq. Remark What happens when if N is just a prime? We will now discuss that if N is just a prime (not a product of primes) it is comparatively easy to compute e th roots modulo N.
31 RSA Cryptosystem Proposition Let p be a prime and let e 1 be an integer that satisfies the condition gcd e, p 1 = 1. We know there exists an inverse d such that de 1 mod p 1. Then the congruence relation x e c mod p has the solution x c d mod p. Proof: From de 1 mod p 1 there exists k Z such that we have de = 1 + k p 1. Now, c d e c de c 1+k p 1 c c p 1 k c 1 k c mod p. This completes the proof that c d is the e th root modulo p of c.
32 RSA Cryptosystem Example Solving x mod Observe that 7919 is a prime. Now, let us find d in order to solve d mod 7918.We get (via Extended Euclidean Algorithm) d 5277 mod Hence, x mod 7919 is the solution.
33 RSA Cryptosystem Example Solve the congruence relation x mod Observe that the modulus is not a prime since from our earlier lectures (section 2.6) we can see that mod It happens that is a product of 2 prime numbers. But since we do not know the prime factors, we cannot use Proposition to help us!!!
34 RSA Cryptosystem ASSIGNMENT Alice publishes his Public key N= and exponent e = Bob wants to send to Alice the message m= Determine the ciphertext. 2. Determine Alice s private key d. 3. Alice receives a ciphertext c= from Bob. Decrypt the ciphertext. (Just provide the numbers)
35 Rabin Cryptosystem Introduced on 1979 by Rabin. The Rabin cryptosystem utilizes the square root modulo problem. Its an optimal implementation of RSA with the encryption exponent e = 2. The scheme utilizes the CR for decryption. The situation of a 4-to-1 mapping during decryption has deterred it from being utilized.
36 Rabin Cryptosystem Key Generation INPUT: The size n of the prime numbers. OUTPUT: A public key N = pq and a private key pair p, q. Generate two random and distinct n-bit strong primes p, q satisfying p 3 mod 4 and 2 n < p < 2 n+1, q 3 mod 4 and 2 n < q < 2 n+1. Compute N = pq.
37 Rabin Cryptosystem Encryption INPUT: The public key N = pq and the message M Z N. OUTPUT: The ciphertext C. Compute C M 2 mod N Decryption INPUT: The private key p, q and the ciphertext C. OUTPUT: The message M. Compute the square roots of C via CRT since we have the factors of N.
38 Rabin Cryptosystem Let m = 32 1) The key: K = {n, p, q} = {77, 7, 11} 2) The encryption function is applied: e k (m) = m 2 mod n = e k (32) = 32 2 mod 77 = 23 = c Now, the ciphertext c = 23 can be sent. 3) The decryption algorithm is applied: m p = c (p+1)/4 mod p = 23 (7+1)/4 mod 7 = 4 m q = c (q+1)/4 mod q = 23 (11+1)/4 mod 11 = 1
39 Rabin Cryptosystem The Rabin Cryptosystem: example (2) First, we compute b1 y b2 : N/7 b 1 1 mod 7 b 1 = 2 N/11 b 2 1 mod 11 b 2 = 8 x 4 mod 7 and x 1 mod 11 : x = a 1 b 1 (M/m 1 ) + a 2 b 2 (M/m 2 ) = 4 x 2 x x 8 x 7 x 144 = 67 mod 77 x = 67 x 3 mod 7 and x 1 mod 11 : x = a 1 b 1 (M/m 1 ) + a 2 b 2 (M/m 2 ) = 11 x 2 x x 8 x 1 x 122 = 45 mod 77 x = 45 For symmetry: = 10 x = = 32 x = 32
40 Rabin Cryptosystem Remark The Rabin cryptosystem is known to have decryption failure due to its 4-1 mapping. strategies to overcome this feature of the Rabin cryptosystem. Redundancy in the message [Menezes et.al., 1996]. This scheme has a probability 1 decryption failure of approximately 2l 1 where l is the least significant binary string of the message. Extra bits [Kurosawa et. al, 2001]. One will send 2 extra bits of information to specify the square root. The encryption process requires the computation of the Jacobi symbol. This results in a computational overhead which is much more than just computing a single square modulo N. Williams technique [Williams, 1980]. The encryption process requires the encryptor to compute a Jacobi symbol. Hence, losing the performance advantage of Rabin over RSA (as in point no.2).
41 Rabin-RZ Cryptosystem Key Generation INPUT: The size n of the prime numbers. OUTPUT: A public key N = p 2 q and a private key pair p, q. Generate two random and distinct n-bit strong primes p, q satisfying p 3 mod 4 and 2 n < p < 2 n 1, q 3 mod 4 and 2 n < q < 2 n 1. Compute N = p 2 q.
42 Rabin-RZ Cryptosystem Encryption INPUT: The public key N = p 2 q and the message M Z N. OUTPUT: The ciphertext C. Compute C M 2 mod N Decryption INPUT: The private key p, q and the ciphertext C. OUTPUT: The message M. M 2 C mod pq, Compute the square roots of C via CRT. Check k = C m2 p 2 q, if k then m is the unique solution
43 Rabin-RZ Cryptosystem Proof of correctness PoC: C m 2 mod N C = m 2 + k p 2 q k = C m i 2 p 2 q, where i=1 to 4 Check for k ϵ Z, so there is one solution {(k i, m i )} to solve.
44 Rabin-RZ Cryptosystem Bivariate function hard problem: Proposition: Let F(x 1, x 2,..., x n ) be a multivariate one-way function that maps F Z n Z+(2 n 1,2 n 1 ). Let F1 and F2 be such functions (either identical or non-identical) such that A 1 = F 1 (x 1, x 2,..., x n ), A 2 =F 2 (y 1, y 2,..., y n ) and gcd(a 1,A 2 )=1. Let u, v Z + (2 m 1,2 m 1). Let G(u,v)=A1u+A2v If at minimum m n 1 = k, where 2 k is exponentially large for any probabilistic polynomial time (PPT) adversary to sieve through all possible answers, it is infeasible to determine (u,v) over Z from G(u,v). Furthermore, (u,v)is unique for G(u,v) with high probability.
Lecture 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 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 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 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 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 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 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 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 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 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 informationChapter 4 Asymmetric Cryptography
Chapter 4 Asymmetric Cryptography Introduction Encryption: RSA Key Exchange: Diffie-Hellman [NetSec/SysSec], WS 2008/2009 4.1 Asymmetric Cryptography General idea: Use two different keys -K and +K for
More informationAsymmetric Cryptography
Asymmetric Cryptography Chapter 4 Asymmetric Cryptography Introduction Encryption: RSA Key Exchange: Diffie-Hellman General idea: Use two different keys -K and +K for encryption and decryption Given a
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 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 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 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 informationCryptography and RSA. Group (1854, Cayley) Upcoming Interview? Outline. Commutative or Abelian Groups
Great Theoretical Ideas in CS V. Adamchik CS 15-251 Upcoming Interview? Lecture 24 Carnegie Mellon University Cryptography and RSA How the World's Smartest Company Selects the Most Creative Thinkers Groups
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 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 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 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 informationduring transmission safeguard information Cryptography: used to CRYPTOGRAPHY BACKGROUND OF THE MATHEMATICAL
THE MATHEMATICAL BACKGROUND OF CRYPTOGRAPHY Cryptography: used to safeguard information during transmission (e.g., credit card number for internet shopping) as opposed to Coding Theory: used to transmit
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 8 1 The following are equivalent (TFAE) 2 Inverses 3 More on Multiplicative Inverses 4 Linear Congruence Theorem 2 [LCT2] 5 Fermat
More informationIntroduction to Cryptography. Lecture 8
Introduction to Cryptography Lecture 8 Benny Pinkas page 1 1 Groups we will use Multiplication modulo a prime number p (G, ) = ({1,2,,p-1}, ) E.g., Z 7* = ( {1,2,3,4,5,6}, ) Z p * Z N * Multiplication
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 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 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 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 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 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 informationDiscrete Logarithm Problem
Discrete Logarithm Problem Finite Fields The finite field GF(q) exists iff q = p e for some prime p. Example: GF(9) GF(9) = {a + bi a, b Z 3, i 2 = i + 1} = {0, 1, 2, i, 1+i, 2+i, 2i, 1+2i, 2+2i} Addition:
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 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 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 informationA new security notion for asymmetric encryption Draft #12
A new security notion for asymmetric encryption Draft #12 Muhammad Rezal Kamel Ariffin 1,2 1 Al-Kindi Cryptography Research Laboratory, Institute for Mathematical Research, 2 Department of Mathematics,
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 informationAn Introduction to Probabilistic Encryption
Osječki matematički list 6(2006), 37 44 37 An Introduction to Probabilistic Encryption Georg J. Fuchsbauer Abstract. An introduction to probabilistic encryption is given, presenting the first probabilistic
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 informationAsymmetric Encryption
-3 s s Encryption Comp Sci 3600 Outline -3 s s 1-3 2 3 4 5 s s Outline -3 s s 1-3 2 3 4 5 s s Function Using Bitwise XOR -3 s s Key Properties for -3 s s The most important property of a hash function
More informationLecture V : Public Key Cryptography
Lecture V : Public Key Cryptography Internet Security: Principles & Practices John K. Zao, PhD (Harvard) SMIEEE Amir Rezapoor Computer Science Department, National Chiao Tung University 2 Outline Functional
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 informationCODING AND CRYPTOLOGY III CRYPTOLOGY EXERCISES. The questions with a * are extension questions, and will not be included in the assignment.
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
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 informationNetwork Security Technology Spring, 2018 Tutorial 3, Week 4 (March 23) Due Date: March 30
Network Security Technology Spring, 2018 Tutorial 3, Week 4 (March 23) LIU Zhen Due Date: March 30 Questions: 1. RSA (20 Points) Assume that we use RSA with the prime numbers p = 17 and q = 23. (a) Calculate
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 informationA new security notion for asymmetric encryption Draft #10
A new security notion for asymmetric encryption Draft #10 Muhammad Rezal Kamel Ariffin 1,2 1 Al-Kindi Cryptography Research Laboratory, Institute for Mathematical Research, 2 Department of Mathematics,
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 informationOWO Lecture: Modular Arithmetic with Algorithmic Applications
OWO Lecture: Modular Arithmetic with Algorithmic Applications Martin Otto Winter Term 2008/09 Contents 1 Basic ingredients 1 2 Modular arithmetic 2 2.1 Going in circles.......................... 2 2.2
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 informationCryptography. Course 1: Remainder: RSA. Jean-Sébastien Coron. September 21, Université du Luxembourg
Course 1: Remainder: RSA Université du Luxembourg September 21, 2010 Public-key encryption Public-key encryption: two keys. One key is made public and used to encrypt. The other key is kept private and
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 informationOther Public-Key Cryptosystems
Other Public-Key Cryptosystems 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-11/
More informationIntro to Public Key Cryptography Diffie & Hellman Key Exchange
Introduction to Modern Cryptography Lecture 5 Number Theory: 1. Quadratic residues. 2. The discrete log problem. Intro to Public Key Cryptography Diffie & Hellman Key Exchange Course Summary - Math Part
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 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 informationNumber Theory & Modern Cryptography
Number Theory & Modern Cryptography Week 12 Stallings: Ch 4, 8, 9, 10 CNT-4403: 2.April.2015 1 Introduction Increasing importance in cryptography Public Key Crypto and Signatures Concern operations on
More informationCryptography and Security Midterm Exam
Cryptography and Security Midterm Exam Serge Vaudenay 23.11.2017 duration: 1h45 no documents allowed, except one 2-sided sheet of handwritten notes a pocket calculator is allowed communication devices
More information1 Number Theory Basics
ECS 289M (Franklin), Winter 2010, Crypto Review 1 Number Theory Basics This section has some basic facts about number theory, mostly taken (or adapted) from Dan Boneh s number theory fact sheets for his
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 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 informationMethods of Public-Key Cryptography. Émilie Wheeler
Methods of Public-Key Cryptography Émilie Wheeler December 10, 2012 Contents 1 Introduction 2 2 Cryptosystems based on Elementary Number Theory 3 2.1 Elementary Number Theory Background............ 3 2.1.1
More informationLECTURE 5: APPLICATIONS TO CRYPTOGRAPHY AND COMPUTATIONS
LECTURE 5: APPLICATIONS TO CRYPTOGRAPHY AND COMPUTATIONS Modular arithmetics that we have discussed in the previous lectures is very useful in Cryptography and Computer Science. Here we discuss several
More informationAlgorithmic Number Theory and Public-key Cryptography
Algorithmic Number Theory and Public-key Cryptography Course 3 University of Luxembourg March 22, 2018 The RSA algorithm The RSA algorithm is the most widely-used public-key encryption algorithm Invented
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 informationEvidence that the Diffie-Hellman Problem is as Hard as Computing Discrete Logs
Evidence that the Diffie-Hellman Problem is as Hard as Computing Discrete Logs Jonah Brown-Cohen 1 Introduction The Diffie-Hellman protocol was one of the first methods discovered for two people, say Alice
More information8.1 Principles of Public-Key Cryptosystems
Public-key cryptography is a radical departure from all that has gone before. Right up to modern times all cryptographic systems have been based on the elementary tools of substitution and permutation.
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 informationLecture 17 - Diffie-Hellman key exchange, pairing, Identity-Based Encryption and Forward Security
Lecture 17 - Diffie-Hellman key exchange, pairing, Identity-Based Encryption and Forward Security Boaz Barak November 21, 2007 Cyclic groups and discrete log A group G is cyclic if there exists a generator
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 informationThe security of RSA (part 1) The security of RSA (part 1)
The modulus n and its totient value φ(n) are known φ(n) = p q (p + q) + 1 = n (p + q) + 1 The modulus n and its totient value φ(n) are known φ(n) = p q (p + q) + 1 = n (p + q) + 1 i.e. q = (n φ(n) + 1)
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. will now introduce finite fields of increasing importance in cryptography. AES, Elliptic Curve, IDEA, Public Key
Introduction will now introduce finite fields of increasing importance in cryptography AES, Elliptic Curve, IDEA, Public Key concern operations on numbers where what constitutes a number and the type of
More informationMath/Mthe 418/818. Review Questions
Math/Mthe 418/818 Review Questions 1. Show that the number N of bit operations required to compute the product mn of two integers m, n > 1 satisfies N = O(log(m) log(n)). 2. Can φ(n) be computed in polynomial
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 informationCIS 6930/4930 Computer and Network Security. Topic 5.2 Public Key Cryptography
CIS 6930/4930 Computer and Network Security Topic 5.2 Public Key Cryptography 1 Diffie-Hellman Key Exchange 2 Diffie-Hellman Protocol For negotiating a shared secret key using only public communication
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 informationLecture 11: Key Agreement
Introduction to Cryptography 02/22/2018 Lecture 11: Key Agreement Instructor: Vipul Goyal Scribe: Francisco Maturana 1 Hardness Assumptions In order to prove the security of cryptographic primitives, we
More informationDiscrete Mathematics GCD, LCM, RSA Algorithm
Discrete Mathematics GCD, LCM, RSA Algorithm Abdul Hameed http://informationtechnology.pk/pucit abdul.hameed@pucit.edu.pk Lecture 16 Greatest Common Divisor 2 Greatest common divisor The greatest common
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 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 informationCryptography and Security Final Exam
Cryptography and Security Final Exam Serge Vaudenay 17.1.2017 duration: 3h no documents allowed, except one 2-sided sheet of handwritten notes a pocket calculator is allowed communication devices are not
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 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 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 informationPublic Key Cryptography
Public Key Cryptography Introduction Public Key Cryptography Unlike symmetric key, there is no need for Alice and Bob to share a common secret Alice can convey her public key to Bob in a public communication:
More informationOutline. Available public-key technologies. Diffie-Hellman protocol Digital Signature. Elliptic curves and the discrete logarithm problem
Outline Public-key cryptography A collection of hard problems Mathematical Background Trapdoor Knapsack Integer factorization Problem Discrete logarithm problem revisited Case of Study: The Sun NFS Cryptosystem
More informationNumber Theory: Applications. Number Theory Applications. Hash Functions II. Hash Functions III. Pseudorandom Numbers
Number Theory: Applications Number Theory Applications Computer Science & Engineering 235: Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu Results from Number Theory have many applications
More informationFundamentals of Modern Cryptography
Fundamentals of Modern Cryptography BRUCE MOMJIAN This presentation explains the fundamentals of modern cryptographic methods. Creative Commons Attribution License http://momjian.us/presentations Last
More informationEindhoven University of Technology MASTER. Kleptography cryptography with backdoors. Antheunisse, M. Award date: 2015
Eindhoven University of Technology MASTER Kleptography cryptography with backdoors Antheunisse, M. Award date: 2015 Disclaimer This document contains a student thesis (bachelor's or master's), as authored
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 informationarxiv: v3 [cs.it] 14 Nov 2012
A NEW EFFICIENT ASYMMETRIC CRYPTOSYSTEM BASED ON THE SQUARE ROOT PROBLEM arxiv:1207.1157v3 [cs.it] 14 Nov 2012 M.R.K. ARIFFIN, M.A.ASBULLAH, AND N.A. ABU Abstract. The square root modulo problem is a known
More information14 Diffie-Hellman Key Agreement
14 Diffie-Hellman Key Agreement 14.1 Cyclic Groups Definition 14.1 Example Let д Z n. Define д n = {д i % n i Z}, the set of all powers of д reduced mod n. Then д is called a generator of д n, and д n
More informationTHE CUBIC PUBLIC-KEY TRANSFORMATION*
CIRCUITS SYSTEMS SIGNAL PROCESSING c Birkhäuser Boston (2007) VOL. 26, NO. 3, 2007, PP. 353 359 DOI: 10.1007/s00034-006-0309-x THE CUBIC PUBLIC-KEY TRANSFORMATION* Subhash Kak 1 Abstract. This note proposes
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 informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Instructor: Michael Fischer Lecture by Ewa Syta Lecture 13 March 3, 2013 CPSC 467b, Lecture 13 1/52 Elliptic Curves Basics Elliptic Curve Cryptography CPSC
More informationOther Public-Key Cryptosystems
Other Public-Key Cryptosystems Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: 10-1 Overview 1. How to exchange
More informationElliptic curves: Theory and Applications. Day 4: The discrete logarithm problem.
Elliptic curves: Theory and Applications. Day 4: The discrete logarithm problem. Elisa Lorenzo García Université de Rennes 1 14-09-2017 Elisa Lorenzo García (Rennes 1) Elliptic Curves 4 14-09-2017 1 /
More informationASYMMETRIC ENCRYPTION
ASYMMETRIC ENCRYPTION 1 / 1 Recommended Book Steven Levy. Crypto. Penguin books. 2001. A non-technical account of the history of public-key cryptography and the colorful characters involved. 2 / 1 Recall
More informationIntroduction to Cybersecurity Cryptography (Part 4)
Introduction to Cybersecurity Cryptography (Part 4) Review of Last Lecture Blockciphers Review of DES Attacks on Blockciphers Advanced Encryption Standard (AES) Modes of Operation MACs and Hashes Message
More informationNotes for Lecture 17
U.C. Berkeley CS276: Cryptography Handout N17 Luca Trevisan March 17, 2009 Notes for Lecture 17 Scribed by Matt Finifter, posted April 8, 2009 Summary Today we begin to talk about public-key cryptography,
More information