Intro to Cryptography WGU C839 Module 2. Questions and answers, 100% Accurate. Rated A+

Intro to Cryptography WGU C839 Module 2. Questions and answers, 100% Accurate. Rated A+ 128 bit Hash Function specified by RFC 1321 Designed to replace MD4 Is not collision resistant - -MD5 160 bit Hash Function There are three other version of this hash with 128, 256 and 320 bit algorithms. Developed to replace the original version which was found to have collision issues. Does not follow any standard or security policies or guidelines - -RIPEMD-160 192 bit hash function. Designed using the Merkle-Damgard construction A one-way compression function operates on 64 bit words maintaining 3 words of state and processing 8 words of data. Has 24 rounds using a combination operation mixing with XOR and addition/subtraction, rotates, and S-box lookups. has a Intricate key scheduling algorithm for constructing 24 round keys from the 8 input words. - -Tiger A cryptosystem should be secure even if everything about the system, except the key, is publicly known. - -Kerckhoffs's Principle A fixed-size input to a cryptographic primitive that is random or pseudorandom. Cryptographic methods require this to be non-repeating, not truly random. Is commonly called a nonce (Number Used Once) XORing this with the first block of plaintext or adding it to the front of plaintext prior to encryption solves the Electronic Codebook (ECB) issue when encryption of the same plaintext with the same key results in the same ciphertext. - -Initialization Vector (IV) A random key is XOR'ed with a stream of plaintext. Is sometimes called a state cipher, asynchronous stream cipher or ciphertext autokey (CTAK) - -Symmetric Stream Ciphers A small change yields