CHAPTER 05 - Public-key cryptography_图文.pptVIP

Public-key cryptography CHAPTER 5: Public-key cryptography Rapidly increasing needs for flexible and secure transmission of information require to use new cryptographic methods. The main disadvantage of the classical cryptography is the need to send a (long) key through a super secure channel before sending the message itself. Basic idea - example Basic idea: If it is infeasible from the knowledge of an encryption algorithm ek to construct the corresponding description algorithm dk, then ek can be made public. Toy example: (Telephone directory encryption) Start: Each user U makes public a unique telephone directory tdU to encrypt messages for U and U is the only user to have an inverse telephone directory itdU. Encryption: Each letter X of a plaintext w is replaced, using the telephone directory tdU of the intended receiver U, by the telephone number of a person whose name starts with letter X. Decryption: easy for Uk, with an inverse telephone directory, infeasible for others. Public Establishment of Secret Keys Main problem of the secret-key cryptography: a need to make a secure distribution (establishment) of secret keys ahead of transmissions. Diffie+Hellman solved this problem in 1976 by designing a protocol for secure key establishment (distribution) over public channels. MAN-IN-THE-MIDDLE ATTACK The following attack by a man-in-the-middle is possible against the Diffie-Hellman key establishment protocol. Bloms key pre-distribution protocol allows to a trusted authority (Trent) to distributed secret keys to n (n - 1) / 2 pairs of n users. Let a large prime p n be publically known. The protocol has the following steps: 1. Each user U in the network is assigned, by Trent, a unique public number rU p. Secure communication with secret-key cryptosystems without any need forsecret key distribution (Shamirs no-key algorithm) Basic assumption: Each user X has its own secret encryption function eX secret decryption function dX and all these functions