《ch09 Public Key Cryptography and RSA》-公开·课件设计.pptVIP

Cryptography and Network SecurityChapter 9 Fourth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 9 – Public Key Cryptography and RSA 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 while the good or little name was made public, the true or great name appears to have been carefully concealed. —The Golden Bough, Sir James George Frazer Private-Key Cryptography traditional private/secret/single key cryptography uses one key shared by both sender and receiver if this key is disclosed communications are compromised also is symmetric, parties are equal hence does not protect sender from receiver forging a message claiming is sent by sender Public-Key Cryptography probably most significant advance in the 3000 year history of cryptography uses two keys – a public a private key asymmetric since parties are not equal uses clever application of number theoretic concepts to function complements rather than replaces private key crypto Why Public-Key Cryptography? developed to address two key issues: key distribution – how to have secure communications in general without having to trust a KDC with your key digital signatures – how to verify a message comes intact from the claimed sender public invention due to Whitfield Diffie Martin Hellman at Stanford Uni in 1976 known earlier in classified community Public-Key Cryptography public-key/two-key/asymmetric cryptography involves the use of two keys: a public-key, which may be known by anybody, and can be used to encrypt messages, and verify signatures a private-key, known only to the recipient, used to decrypt messages, and sign (create) signatures is asymmetric because those who encrypt messages or verify signatures cannot decrypt messages or create signatures Public-Key Cryptography Public-Key Characteristics Public-Key algorithms rely on two keys where: it is computationally infeasible to find d