# It286-Unit 6 Essay

682 Words3 Pages
Unit 6 – Cryptography Basics and Implementation Kaplan University IT286: Introduction to Network Security - 01 Professor Denver Lee Martin Substitution and transposition ciphers are two categories of ciphers used in classical cryptography. Substitution and transposition differ in how chunks of the message are handled by the encryption process. This means that the process encrypts chunks of the message based on the user’s message preferences. Modern cryptanalysis makes simple substitution and transposition ciphers obsolete. However, these techniques remain useful for understanding cryptography and the workings of more complex modern ciphers. If you use the rot13 encoding algorithm to encode “It is critical for network administrators to understand cryptography”, it would look like this “Vg vf pevgvpny sbe argjbex nqzvavfgengbef gb haqrefgnaq pelcgbtencul.” A hash algorithm is like the check digit in a barcode or a credit card. Basically, Hashing is the transformation of a string of characters into a usually shorter fixed-length value or key that represents the original string. Symmetric algorithms are often called secret key algorithms because they use the same key to encrypt and decrypt a message. That means that the receiver and the sender need to have the same key, and if the keys is not secret it’s not a symmetric algorithm. After researching, some of the weaknesses with symmetric algorithms is that key distribution can be a problems. Whereas, how do I get the secret key from the sender to the receiver without anybody grabbing it in between? Also, symmetric algorithms lacks nonrepudiation. That means that there is no easy way using symmetric algorithms to figure out that who said they sent the message actually sent the message. Symmetric algorithms are not scalable because if you want to send one message out to a lot of people you have to first ensure that