信息安全概论课件-lecture044.pptVIP

Lecture 044 More on Public Key Algorithms CIS 4362 - CIS 5357 Network Security The discrete logarithm problem Let p be a large prime number Say 1000 -- 2000 bits long. Take g to be in the interval [2, p-2]. Consider the exponential function: Expg(?, mod p): x ? gx mod p Expg(?, mod p) is hard to invert. unless p is a “weak” prime (rare case and easy to test for) Cryptographic strong and weak primes A strong prime (cryptographically) is a prime number p such that both p + 1 and p – 1 have large prime factors, r and s respectively, and r – 1 and s – 1 also have large prime factors. If a prime is strong, it is non-weak. p = 2q + 1 is a non-weak prime if p, q are prime. Example N = 11; g = 2. 22 = 4, 23 = 8, 24 = 5, 25 = 10, 26 = 9, 27 = 7, 28 = 3, 29 = 6, 210 = 1 (mod 11) 32 = 9, 33 = 5, 34 = 4, 35 = 1 (mod 11) The residue (2 mod 11) can create all non-zero residues mod 11 via exponentiation. It is called a generator. The residue (3 mod 11) does not have the same property. Encrypting a la El Gamal Take p a non-weak prime: p = uq + 1, with q also prime, and u small. This guarantees Exp(?, mod p) is hard. Take g’ in [2, p-2] and choose g = g’u mod p. Choose private key k at random k in [2, q -1] Compute the public key y = gk mod p. El Gamal Encryption To encrypt m in [1, p-1] for user Bob: public key y = gk, private key k Compute a random value r Compute (A, B) = (gr mod p, m?yr mod p) To decrypt, Bob computes m = B(A-k) mod p Semantic Security Widely used definition for security in an asymmetric-key encryption algorithm Equivalent to IND-CPA Indistinguishable under chosen plaintext attack Semantic Security The game Adversary is given a public key and can generate any number of ciphertexts (polynomial time bound and probabilistically) Adversary generates two equal – length messages m0 and m1 and transmits them to a challenge oracle along with the public key The challenge oracle selects one of the messages by flipping a coin (u