Thursday, February 4, 2010
Lecture 5:DES & Rivest-Shamir-Adelman (Feb 3)
We began the lecture by discussing how DES came to be unreasonable for encrypting messages when it was easy enough to crack it. Then, triple DES was introduced to cover this weakness. Triple DES is used with two separate keys. The first is used to encrypt, the second is used to decrypt, and finally the first is used to encrypt again. This creates a better encryption because these two keys need to be ordered the right way to decrypt the message, creating an exponential increase in the encryption. We then went over computational complexity and what P, NP, NP-Hard, and NP-Complete problems. Finally, we went over what is behind the Rivest-Shamir-Adelman encryption which uses two large prime numbers.
Subscribe to:
Post Comments (Atom)
This is the most powerful algorithm which is used behind the creation of digital signature and certificates. I am trying to collect the technical detail about how it works. Thank you for giving me a basic idea about it.
ReplyDeleteelectronic signature Microsoft