Intro to Cryptography WGU C839 Module 2. Questions and answers, 100% Accurate, VERIFIED. UPDATED 2024/25

Intro to Cryptography WGU C839 Module 2. Questions and answers, 100% Accurate, VERIFIED. The same key is used to encrypt messages as well as decrypt messages. These algorithms are always faster but have an issue with exchanging keys. - -Symmetric Cryptography Modern cryptography began when Claude Shannon publish "Communication Theory of Secrecy Systems" in 1949. He focused on this concept by quantifying information, leading to a number of methods for encrypting and decrypting information. - -Information Theory Change to one character in plain text affect multiple characters in the cipher text. - -Diffusion Attempts to make the relationship between statistical frequencies of the cipher text and the actual key as complex as possible. Uses complex substitution algorithms. - -Confusion A small change yields large effects in the output. Fiestel's variation on Claude Shannon's concept of diffusion. Ideally, a change in one bit of plaintext would change all the bits in the ciphertext. - -Avalanche A cryptosystem should be secure even if everything about the system, except the key, is publicly known. - -Kerckhoffs's Principle C = E(k,p) expresses what mathematically? - -Symmetric Algorithm for Encryption P = D(k,c) expresses what mathematically? - -Symmetric Algorithm for Decryption Changing some part of the plain text for some matching part of the cipher text is? - -Substitution Swapping of blocks of cipher text. given a sentence "I like icecream" you could swap every three-letter sequence (or block) with the next and get: "ikel I creiceam" Modern versions do this at the level of bits or blocks of bits. - -Transposition Asks if there is a ONE in BOTH the first and second number. If both numbers have a ONE in BOTH places the resultant number is ONE. If not then the resultant number is ZERO. First Number: 1 1 0 1 Second Number: 0 1 1 0 Result Number: 0 1 0 0 - -Binary AND