WGU D334, Shawns study guide

WGU D334, Shawns study guide Leave the first rating Students also studied Terms in this set (93) Western Governors UniversityD 334 Save C839v5/D334 Additional Practice Teacher 165 terms ShawnD_Preview C839v5/D334 Algorithms Drill Teacher 51 terms ShawnD_Preview Introduction to Cryptography - D33...120 terms PerkoniPreview Introdu 250 term Squ Practice questions for this set Learn1 / 7Study using Learn This method generates a true random number and uses some form of random process.One approach is to monitor the movements of a mouse pointer on a screen or from the pauses between keystrokes. Overall, the method is generally slow, especially if it involves human interaction, but is non-deterministic and aperiodic.Encryption/Decryptionchanging plaintext into ciphertext / changing it back should be applied to information you want to protect at rest as well as in transit AescryptEncrypt individual files Choose an answer 1Pseudo-random number generators (prngs 2Output Feedback (OFB) 3Hashing4True Random number generators (TRNGs) Don't know?

Bitlocker and FileVaultencrypt full disks Mono-alphabetic code or substitutionSingle mapping from alphabet to cipher alphabet polyalphabetic codeMapping of alphabet to multiple cipher alphabets One-time padUnbreakable encryption. only uses its cipher code once Pseudo-random number generators (PRNGs)This method repeats the random numbers after a given time (periodic). They are fast and are also deterministic and are useful in producing a repeatable set of random numbers.True Random number generators (TRNGs)This method generates a true random number and uses some form of random process. One approach is to monitor the movements of a mouse pointer on a screen or from the pauses between keystrokes. Overall, the method is generally slow, especially if it involves human interaction, but is non-deterministic and aperiodic.Frequency analysisCipher cracking methodology that involves identifying patterns and variations in the probability of codes.Entropymeasures level of unpredictability Hardware Security Module (HSM)a tamper-evident and intrusion-resistant physical device that safeguards and manages cryptographic keys and provides cryptographic processing Trusted platform module (TPM)A dedicated processor that handles hardware-level encryption; allows you to encrypt data on your device Pigpenmono-alphabetic substitution cipher that makes use of mapping plaintext characters to graphical characters rather than to alphabetic ones.Rail codeEmploys a method to scramble text by writing it in a sequence across a number of rails.BIFIDMakes use of a grid and which maps the letters into numeric values.Playfair5 × 5 matrix containing the alphabet less the letter J. Cipher/decipher process consists of a set of rules outlining use of column and row combinations.Morse CodeEncoding method, rather than a cipher, that works by translating characters into sequences of dots (.) and dashes (-) Caeser Ciphera technique for encryption that shifts the alphabet by some number of characters Vigenere CipherAn encryption algorithm which works by applying a key word to a plaintext. The key word is aligned with the plaintext and each letter of the keyword determines by how many places the plaintext should be rotated. For example "D" signals a rotation of 3. In short is uses multiple Ceasar Ciphers to encrypt a single plaintext making it more secure.

Four square cipherUses four 5 × 5 matrices arranged in a square, are where each matrix contains 25 letters for encoding and decoding operations.enigma machineAn example of a one time pad encryption device.Binary Math "AND"both the first and second numbers you are ANDing must be 1 for the answer to be 1, anything else 0 Binary Math "OR"if any or both of the numbers you are ORing are 1, then the answer is 1, anything else 0 Binary Math "XOR"one but not both of the numbers you are XORing must be 1 for your answer to be

• Anything else is 0

Modulus operator mathSimply divide the first number by the second and return the remainder. Annotated using the (mod) or (%). Example: 5 mod 2 = 1 [2 goes into 5 a max of twice (4), 5-4 = the remainder which is 1]

Combination vs. Permutationcombination: order doesn't matter

permutation: order matters

Secret Key encryptionUses a single key that is shared by both the sender and the receiver Diffie-HellmanA widely used key exchange algorithm used to exchange the secret key in symmetric cryptography.suffers from man in the middle attacks symmetric encryptiontwo types, Block and stream Symmetric Block Encryptioninvolves grouping data into blocks and encrypting the individual blocks padding is used to fill blocks to operating size.Symmetric stream encryption-involves encrypting one bit at a time, i.e., a synchronous stream -is often much faster than block and can typically be applied in real-time applications.S-boxesperform substitution as part the encryption process. Take a given input and leverage look-up tables that produce a given output Saltingthe process of adding an initialization vector to the ciphering process to change its operation and ensure that the ciphertext does not give the original plaintext when played back Electronic Code Book (ECB)Most basic, weak and unsecure mode. Each block is processed separately. No salt or IV is used, same key is used to encrypt each block.Cipher block Chaining (CBC)step up from ECB, incorporates IV. Results of encryption from previous block is input into encryption process of the current block

Cipher Feedback (CFB)converts the block cipher into a self-synchronizing stream cipher.Current block takes the output of the XOR process vs. from the cipher stage of the previous block.Output Feedback (OFB)-Converts the block cipher to a synchronous stream output.-Current block takes output from the cipher stage vs from the output of the XOR process of the previous block (difference between CFB and OFB).-The first stage takes the data blocks and X-ORs it with the encrypted version of the IV value. The output of the first stage encryption is then feed into the next stage, and encrypted, with the output being X-OR'ed with the second block.Counter Mode (CTR)-Converts the block cipher into a stream cipher.-Generates a counter value and a nonce, and encrypts this, in order to EX-OR with the plain text block.-The advantage of CTR is that each block is processed independent of the others, facilitating ability to conduct parallel processing of blocks. i.e., feedback from other stages to feed into the current one is not required.Hashingdescribes one-way or irreversible encryption used for protecting the integrity of data. Takes a variable length input and produces a fixed length output.collisiontwo different input values that produce the same hash signature APR1Apache defined, iterates the hash value 1000 times. Addresses the problem of brute force attacks. Has a salted value.Rainbow tableA table of hash values and their corresponding plaintext values that can be used to look up password values if an attacker is able to steal a system's encrypted password file.HMACmessage authentication code that can be used to verify the integrity and authentication of the message. Hashes the message with a secret key One-time passwordallows a new unique password to be created for each instance, based on an initial seed Timed One-time passwordallows for a new unique passcode to be created for each instance, based on initial seed and a given time period.Hased one time passwordallows for a new unique passcode to be created for each instance, based on counter value and iniial seed.public key encryption (PKE)uses two keys: a public key that everyone can have and a private key for only the recipient.often too slow for real time communication.identity checking and key protection.RSALeverages prime number characteristics, 1024-4096 bit variable key size, 1 round Most Popular / provides authentication and encryption / authentication through digital signatures