Network Security and Cryptography: Module 1 Flashcards

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/31

flashcard set

Earn XP

Description and Tags

A set of vocabulary-style flashcards covering security goals, attacks, architecture, cryptography models, and modular arithmetic basics.

Last updated 3:36 AM on 8/9/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

32 Terms

1
New cards

Confidentiality

Information security aspect that hides information from unauthorized access to protect it from being endangered.

2
New cards

Integrity

Security goal requiring that changes to information are performed only by authorized entities and through authorized mechanisms.

3
New cards

Availability

Requirement that information and services be accessible to authorized users whenever they are required.

4
New cards

Security attack

Any action that compromises the security of information belonging to an organization.

5
New cards

Security mechanism

A process or device designed to detect, prevent, or recover from a security attack.

6
New cards

Security service

A communication or processing service that enhances the security of systems and information transfers to counter attacks using security mechanisms.

7
New cards

Snooping

An attack threatening confidentiality involving unauthorized access to or interception of data.

8
New cards

Traffic analysis

An attack threatening confidentiality where information is obtained by monitoring online traffic.

9
New cards

Modification

An attack threatening integrity where an attacker intercepts and changes a message.

10
New cards

Masquerading

An attack threatening integrity, also known as spoofing, where an attacker impersonates another entity.

11
New cards

Replaying

An attack threatening integrity where an attacker captures a copy of a message and sends it again later.

12
New cards

Repudiation

An attack threatening integrity where a sender denies sending a message or a receiver denies receiving a message.

13
New cards

Denial of service (DoS)

An attack threatening availability that slows down or completely interrupts a system's services.

14
New cards

Cryptography

Originating from Greek for 'secret writing,' it is the science and art of transforming messages to make them secure and immune to attacks.

15
New cards

Steganography

Originating from Greek for 'covered writing,' it involves hiding data within text or images.

16
New cards

Plaintext

The original message before it is processed by an encryption algorithm.

17
New cards

Ciphertext

The message that is sent through a channel after encryption has been applied.

18
New cards

Kerckhoff’s Principle

The concept that the security of a cipher must rely solely on the secrecy of the key, assuming the adversary knows the algorithm.

19
New cards

Cryptanalysis

The science and art of breaking secret codes.

20
New cards

Ciphertext-Only Attack

A cryptanalysis attack where the attacker only has access to the ciphertext to be decoded.

21
New cards

Known-Plaintext Attack

A cryptanalysis attack where the attacker has a collection of plaintext-ciphertext pairs to help find the key.

22
New cards

Chosen-Plaintext Attack

A known-plaintext attack where the attacker can select specific plaintext to be encrypted and observe the resulting ciphertext.

23
New cards

Chosen-Ciphertext Attack

A cryptanalysis attack where the attacker selects specific ciphertext and studies the resulting decrypted plaintext.

24
New cards

Integer Division Formula

The relationship defined as a=q×n+ra = q \times n + r, where aa is divided by nn to get quotient qq and remainder rr.

25
New cards

Greatest Common Divisor (gcd)

The largest integer that can divide two positive integers simultaneously.

26
New cards

Relatively prime

A condition where the greatest common divisor of two integers, gcd(a,b)\text{gcd}(a, b), is equal to 11.

27
New cards

Extended Euclidean Algorithm

An algorithm used to calculate the gcd(a,b)\text{gcd}(a, b) and find integers ss and tt such that as+bt=gcd(a,b)as + bt = \text{gcd}(a, b).

28
New cards

Modulus

The second input (nn) in the modulo operation that defines the set of residues.

29
New cards

Residue

The output (rr) of a modulo operation.

30
New cards

Congruence Operator

The operator ( \text{\equiv} ) used to show that two integers have the same remainder when divided by the same modulus.

31
New cards

Additive Inverse

Two numbers aa and bb in ZnZ_n such that (a + b) \text{\equiv} 0 \text{ (mod n)}.

32
New cards

Multiplicative Inverse

Two numbers aa and bb in ZnZ_n such that (a \times b) \text{\equiv} 1 \text{ (mod n)}.