Professional Documents
Culture Documents
action
Week 08 – Security in Computing
Revision
• Understood the various pre-requisites to understand the workings of the RSA algorithm, such as the prime
numbers, prime factorization and the greatest common divisor.
• Understood what primality testing is.
• Analyzed the public-key cryptography and its differences with conventional encryption systems.
• Analyzed the key generation, encryption and decryption steps of the RSA algorithm.
• International Data Encryption Standard (IDEA): Designed in Switzerland and made available in 1990, this algorithm
has seen applications such as PGP.
• RC2 – Key between 1 and 2048 bits. Traditionally limited to 40 bits in software.
• RC4 – Key length allowed is between 1 and 2048 bits and RC4 is notable for its inclusion in the WEP (Wired
Equivalent Protection) protocol, used in early wireless networks.
• Advanced Encryption Standard (AES) or Rijndael: This algorithm uses keys that are 128-, 192- or 256- bits long.
• Public key systems feature a key pair made up of a public and a private key.
• Each entity that participates in the system has two keys which are unique and are assigned.
• In practice, the public key will be published in some location, whereas the private key will remain solely in the
assigned user’s possession and will never be used by anyone else.
• No other intermediate party will be able to view the confidential message since only one person, Ron, has the
means to decrypt it.
• If the other key is used – the PRIVATE key – then a process using DIGITAL SIGNATURES becomes possible.
• Since anything encrypted with the PRIVATE key can be reversed only with the corresponding PUBLIC key and only
one person hold the private key, then the identity of the encrypting party can be assured.
• The mathematical computation takes in Harry’s PRIVATE key to complete the operation.
• If Ron receives the message, he will simply retrieve Harry’s PUBLIC key and use it to verify that the PRIVATE key was
used.
• If the process can be reversed with the key, that means it came from Harry; if it can’t, then it didn’t come from
Harry.
4. Sean binds the encrypted bundle and the plaintext message together.
7. Seeing who the sender is, Zelda retrieves Sean’s public key from the CA they both trust.
8. Zelda decrypts the encrypted hash value; it decrypts successfully, thus validating the identity of the sender (Sean).
9. After the hash is decrypted, Zelda reruns the MD5 algorithm against the plaintext message and compares the new
hash with the one she received from Sean.
10. If the two hashes match, the message has not been altered since Sean signed it.