Singhalese(锡兰人).pptVIP

Elliptic Curve Cryptography Jen-Chang Liu, 2004 Adapted from lecture slides by Lawrie Brown Ref: RSA Security’s Official Guide to Cryptography No Singhalese(錫蘭人), whether man or woman, would venture out of the house without a bunch of keys in his hand, for without such a talisman(護身符) he would fear that some devil might take advantage of his weak state to slip into his body. —The Golden Bough, Sir James George Frazer Review: Requirement for public-key cryptography Diffie and Hellman (1976) proposed the public-key cryptography requirement: It is computationally easy to generate a pair of keys It is computationally easy for a sender to encrypt It is computationally easy for a receiver to decrypt It is computationally infeasible for an opponent, knowing the public key, to determine the private key It is computationally infeasible for an opponent, knowing the public key and ciphtertext, to recover the plaintext Review: one-way function 1968, R. M. Needham’s system 1974, G. Purdy published the first detail description of such a one-way function One-way function Computation in Zp , Review: (trapdoor) one-way function Elliptic Curve Cryptography (ECC) majority of public-key crypto (RSA, D-H) use either integer or polynomial arithmetic with very large numbers/polynomials imposes a significant load in storing and processing keys and messages an alternative is to use elliptic curves offers same security with smaller bit sizes Outline Operations over abelian groups (可換群) Elliptic curves over the reals Elliptic curves over the finite fields Elliptic curve cryptography Abelian group Group with communicative property Group: {G, ?} G: a set of elements ?: binary operation to each pair (a,b) in G obeys: closure: a?b is also in G associative law: (a?b)?c = a?(b?c) has identity e: e?a = a?e = a has inverses a-1: a?a-1 = e Public ciphers based on an abelian group Exponentiation (repeated multiplication) in RSA and D-H algorithm Idea: Find another abelian group! In e