CSE 4380 Exam 1 Flashcards (1)

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

1/37

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 1:05 AM on 3/25/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

38 Terms

1
New cards

Information Security

The protection of information from accidental or intentional misuse by persons inside or outside an organization

2
New cards

Key Security Concepts

Confidentiality, integrity, availability

3
New cards

Confidentiality

Assurance that confidential information is not disclosed to unauthorized individuals

4
New cards

Integrtiy

Assures that information and programs changes only in an authorized or specified manor. Maintains trustworthiness of the data.

5
New cards

Availability

Assures that data works promptly and service is not denied to authorized users.

6
New cards

Types of attacks

-Passive: Learn about the system

-Active: Attempt to alter system

-Insider: Initiated by someone inside security perimeter

-Outside: Initiated outside the perimeter

7
New cards

Attack surface

Consists of the reachable and exploitable vulnerabilities in a system (Network, Software, and Human Attack)

8
New cards

Countermeasures

Prevent, Detect, Recover

9
New cards

Cryptographic tools

-Symmetric Encryption (Confidentiality)

-Secure Hash Functions (Integrity)

-Asymmetric Encryption (Confidentiality & Integrity)

10
New cards

Symmetric Encryption

the same key is used to encode and decode

11
New cards

Block Ciphers

-encrypt data in blocks and most common symmetric encryption algorithms

-Good for when you are sending blocks of data such as email, file transfer, etc.

12
New cards

Data Encryption Standard (DES)

A symmetric block cipher that uses a 56-bit key and encrypts data in 64-bit blocks.

13
New cards

Triple DES

Repeats basic DES algorithm three times using either two or three unique keys, using a key size of 112 or 168 bits. More secure than DES but slower

14
New cards

Advanced Encryption Standard (AES)

A symmetric cipher that was approved by the NIST as a replacement for DES. Efficiency and security. Supports key lengths of 128 and 256 bits

15
New cards

Two requirements for secure use of symmetric encryption

-Need strong encryption algorithm

-Sender and receiver must have obtained copies of secret keys in a secure fashion

16
New cards

Cryptanalysis Attack

-Rely on nature of the algorithm and knowledge of the plain text

-If successful all future and past messages are jeopardized

17
New cards

Brute Force attack

An attack on passwords or encryption that tries every possible password or encryption key.

18
New cards

Average time required for exhaustive key search

AES takes more time than DES and triple DES

19
New cards

Stream Cipher

-An encryption method that encrypts a single bit at a time.

-Good for when data is sent over a communications channel such as a web links.

20
New cards

Stream Cipher vs Block Cipher

Stream Ciphers have higher throughput

21
New cards

Advantages of a block cipher

You can reuse keys

22
New cards

Message authentication

-Protects against active attacks

-Verifies received message is authentic

-Can use conventional encryption

23
New cards

Replay Attack

An attack where the data is captured and replayed. Attacker resends message since they have the hash and the receiver could potentially send information back.

24
New cards

Hash Function

Accepts a variable size message M as input and produces a fixed size message digest h= H(M) as output.

25
New cards

Hash Function Properties

-Applied to any size data

-H produces a fixed-length

-H(x) easy to compute for a given x

-One-way resistant (Infeasible to reverse hash)

-Weak collision resistance

-Strong Collision resistance (Prevents the same hash from being found)

26
New cards

Attacking Hash Functions

-Exploit weaknesses in algorithm

-Strength of hash code depends on length of code

27
New cards

Public Key Encryption

uses two keys: a public key that everyone can have and a private key for only the recipient

28
New cards

Misconceptions of Public Key Encryption

-Public Key is more secure from cryptanalysis attacks than symmetric encryption

-Public-Key has made symmetric encryption obsolete

-Key distribution is trivial

29
New cards

Public-Key for confidentiality

If someone sends a message using another person's public key, then only that person can decrypt the message using their private key.

30
New cards

Public-Key for Integrity and Authentication

If someone uses their private key to send a message to someone else. Then that other person can decrypt using the senders public key and verify that the message was sent from them.

31
New cards

Digital Signature

Asymmetric encryption of a hash of message

32
New cards

What is the purpose of a hash function in a digital signature?

Makes the signature faster to compute

33
New cards

Public key for both integrity and confidentiality

Sender encrypts hash using private key as the digital signature. Receiver decrypts message using their own private key. After decrypting the digital signature of the sender then if the result is equal to the hash function ,then integrity is validated.

34
New cards

Public Key Certificates

Used to validate if a public key belongs to a certain person. Certificate Authority is passed in a message.

35
New cards

Digital Envelope

a technique that uses symmetric encryption for large documents, but public key encryption to encrypt and send the symmetric key

36
New cards

RSA Encryption

The system used an algorithm that involves multiplying two large prime numbers to generate a public key, used to encrypt data and decrypt an authentication, and a private key, used to decrypt the data and encrypt an authentication.

37
New cards

What makes it hard for hackers to generate private key for RSA?

-Easy to compute modulus if chi(n) is known, but they do not have it

-If p and q are big enough then it is very hard to factorize n

38
New cards

Security of RSA

-Brute force attacks that try all possible keys

-Mathematical approach with figuring out the prime factorization

Explore top flashcards

flashcards
Chapters 10 & 11 Test
56
Updated 1093d ago
0.0(0)
flashcards
AP Euro Unit 1+2 Anchors
39
Updated 160d ago
0.0(0)
flashcards
Intro to Cognitive Psychology
24
Updated 895d ago
0.0(0)
flashcards
Ch. 17 & 18 Vocabulary
37
Updated 1105d ago
0.0(0)
flashcards
COMPSCI 1210 ( COMP ORG)
116
Updated 1106d ago
0.0(0)
flashcards
Present Perfect
34
Updated 1086d ago
0.0(0)
flashcards
Chapters 10 & 11 Test
56
Updated 1093d ago
0.0(0)
flashcards
AP Euro Unit 1+2 Anchors
39
Updated 160d ago
0.0(0)
flashcards
Intro to Cognitive Psychology
24
Updated 895d ago
0.0(0)
flashcards
Ch. 17 & 18 Vocabulary
37
Updated 1105d ago
0.0(0)
flashcards
COMPSCI 1210 ( COMP ORG)
116
Updated 1106d ago
0.0(0)
flashcards
Present Perfect
34
Updated 1086d ago
0.0(0)