RSA or ElGamal to encrypt the messa

RSA or ElGamal to encrypt the message directly: CAST-128 and the other symmet-ric algorithms are substantially faster than RSA or ElGamal. Second, the use of the public-key algorithm solves the session-key distribution problem, because only the recipient is able to recover the session key that is bound to the message. Note that we do not need a session-key exchange protocol of the type discussed in Chapter 14, because we are not beginning an ongoing session. Rather, each message is a one-time inde-pendent event with its own key. Furthermore, given the store-and-forward nature of electronic mail, the use of handshaking to assure that both sides have the same session key is not practical. Finally, the use of one-time symmetric keys strengthens what is already a strong symmetric encryption approach. Only a small amount of plaintext is encrypted with each key, and there is no relationship among the keys. Thus, to the extent that the public-key algorithm is secure, the entire scheme is secure. To this end, PGP provides the user with a range of key size options from 768 to 3072 bits (the DSS key for signatures is limited to 1024 bits).

Kết quả (Anh) 1:

RSA or ElGamal to encrypt the message directly: CAST-128 and the other symmet-ric algorithms are substantially faster than the RSA or ElGamal. Second, the use of the public-key algorithm solves the session-key distribution problem, because only the recipient is able to recover the session key that is bound to the message. Note that we do not need a session-key exchange protocol of the type discussed in Chapter 14, because we are not beginning an ongoing session. Rather, each message is a one-time-inde-pendent event with its own key. Furthermore, given the store-and-forward nature of electronic mail, the use of handshaking to assure that both sides have the same session key is not practical. Finally, the use of one-time symmetric keys beet root what is already a strong symmetric encryption approach. Only a small amount of plaintext is encrypted with each key, and there is no relationship among the keys. Thus, to the extent that the public-key algorithm is secure, the entire scheme is secure. To this end, PGP provides the user with a range of key size options from 768 to 3072 bits (the DSS key for signatures is limited to 1024 bits).

Kết quả (Anh) 2:

RSA or ElGamal to encrypt the message trực: CAST-128 and the other points are substantially symmet-ric Algorithms coal Faster RSA or ElGamal. Second, the use of the public-key algorithm solves the problem session-key distribution, only the recipient is vì thể recover the session key is bound to the message rằng. Note rằng We do not need a session-key exchange protocol of the type discussed in Chapter 14, beginning vì We Are not police Ongoing session. Rather, each is a one-time message inde-pendent with riêng key event. Furthermore, given the store-and-forward nature of electronic mail, the use of handshaking to Assure That Both Sides have the same session key is not Practical. Finally, the use of one-time symmetric keys strengthens what is already a strong symmetric encryption Approach. Only a small amount of plaintext is encrypted with each key, and there is no relationship Among the keys. Thus, to the extent là là secure public-key algorithm, the Entire scheme is secure. To this end, PGP Provides the user with a range of key size options from 768 to 3072 bits (the DSS key for signatures is limited to 1024 bits).