DACS 2201 / 06-Basic Cryptography

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/42

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering basic cryptography terminology, classic and modern algorithms, hashing, and security principles from the DACS 2201 lecture.

Last updated 10:14 AM on 5/28/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

43 Terms

1
New cards

Cryptography

Scrambling data so it cannot be read or understood; it transforms information into an unintelligible form so unauthorized persons cannot access it.

2
New cards

Steganography

The practice of hiding the existence of data, such as embedding hidden messages in unused portions of image, audio, or video files.

3
New cards

Metadata

Data used to describe the content or structure of the actual data.

4
New cards

Encryption

The process of changing original text into a secret message using cryptography.

5
New cards

Decryption

The process of changing a secret message back to its original form.

6
New cards

Plaintext

Unencrypted data that is to be encrypted or the output produced by a decryption process.

7
New cards

Ciphertext

The scrambled and unreadable output produced by the process of encryption.

8
New cards

Cleartext

Data that is stored or transmitted without any encryption.

9
New cards

Cipher

A cryptographic algorithm that takes plaintext data as input and transforms it into ciphertext using procedures based on mathematical formulas.

10
New cards

Key

A value used by a cryptographic algorithm to produce ciphertext; if one is used to encrypt, the reverse process also uses one to decrypt.

11
New cards

Kerckhoff’s Principle

The principle stating that only the key and not the algorithm should be secret.

12
New cards

Substitution

A technique in cryptography where one letter is substituted with another.

13
New cards

Transposition

A technique in cryptography where the order of letters in the message is rearranged.

14
New cards

Caesar Cipher

One of the oldest known keyed substitution algorithms, attributed to Julius Caesar, typically using a key of 33 to shift alphabet positions.

15
New cards

ROT-13 Cipher

A specific Caesar cipher where the key is set to 1313, causing a rotatation of the alphabet by 1313 positions.

16
New cards

Pigpen Cipher

A keyless substitution cipher used by the Freemasons where letters are substituted by symbols enclosing them in a specific figure.

17
New cards

Vigenère Cipher

A substitution cipher that generalizes the Caesar cipher by using a password as a key instead of a single number.

18
New cards

Rail Fence Cipher

Also called the Zig-Zag Cipher; a simple transposition algorithm that places successive letters vertically into key lines following a zig-zag pattern.

19
New cards

Stream Cipher

A modern cryptographic algorithm that takes one character at a time and replaces it with another.

20
New cards

Block Cipher

A modern cryptographic algorithm that manipulates an entire block of plaintext at once, such as blocks of 88 or 1616 bytes.

21
New cards

Sponge Function

A function that takes a string of any length as input and returns a string of any requested variable length.

22
New cards

Hash Algorithm

An algorithm that takes a set of data (string or file) as input and returns a unique string as output, often called a message digest.

23
New cards

Collision Resistant

A characteristic of a secure hash algorithm where it produces a unique output for every different input.

24
New cards

Digital Fingerprint

Another term for a hash output (message digest) because it is unique and used for comparison and integrity verification.

25
New cards

MD5

The most well-known Message Digest (MD) hash algorithm; it is no longer considered suitable for use due to weaknesses.

26
New cards

SHA-2

A Secure Hash Algorithm currently considered secure, including versions such as SHA-256, SHA-384, and SHA-512.

27
New cards

SHA-3

A new hash standard announced in 20152015 that is suitable for low-power devices like sensors and IoT devices.

28
New cards

RIPEMD

Race Integrity Primitives Evaluation Message Digest; a hash algorithm whose primary feature is two independent parallel chains of computation.

29
New cards

Symmetric Cryptographic Algorithm

An algorithm that uses the same key to encrypt and decrypt a document; also known as private key cryptography.

30
New cards

AES

Advanced Encryption Standard; a symmetric block cipher that performs three steps on every block of 128128 bits with no known attacks.

31
New cards

Blowfish

A symmetric block cipher with no known attacks.

32
New cards

Asymmetric Algorithms

Also known as Public Key Cryptography; algorithms that use mathematically related key pairs (one public and one private) to solve the problem of key distribution.

33
New cards

RSA

Rivest, Shamir, and Adleman algorithm; one of the oldest asymmetric algorithms that uses prime numbers to generate key pairs.

34
New cards

ECC

Elliptic Curve Cryptography; an asymmetric algorithm that uses smaller key sizes than RSA, resulting in faster computation and lower power consumption.

35
New cards

DSA

Digital Signature Algorithm; an asymmetric algorithm used to create digital signatures to electronically verify a sender.

36
New cards

Key Exchange Algorithms

Methods that enable two parties to agree on a common secret key over an insecure medium for use in symmetric cryptography.

37
New cards

Diffie-Hellman (DH)

A key exchange method where parties agree on a large prime number and a related integer to separately compute the same secret key.

38
New cards

Perfect Forward Secrecy

A system that generates random public keys that are different for each session, ensuring that if a secret key is compromised, only one message is revealed.

39
New cards

Confidentiality

A data protection state ensuring that only authorized parties can view the data.

40
New cards

Integrity

A data protection state ensuring information is correct and has not been altered.

41
New cards

Authentication

A data protection state ensuring the identity of the sender can be verified.

42
New cards

Nonrepudiation

The inability to deny that a user performed a specific action.

43
New cards

Obfuscation

The practice of making something obscure or unclear to others to protect data.