Cryptography and Security

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

1/117

encourage image

There's no tags or description

Looks like no tags are added yet.

118 Terms

1
New cards

Cybersecurity

The management of attacks and risks by adversarial and malicious elements on computers and networks that support modern businesses and economy involving business, government and community.

2
New cards

Information security

Focuses on the secure exchange and processing of information on modern computers and networks.

3
New cards

Cryptography

A method of ensuring information security that refers to techniques used to ensure data is protected from potentially malicious elements.

4
New cards

Diffie-Hellman Key Exchange

A method of secure key exchange that uses exponentiation under a modulus to share a key.

5
New cards

Discrete Logarithm Problem

Given (g, h, p). Find x such that g^x=h (mod p)

6
New cards

Computational Diffie-Hellman Problem

Given (ga, gb, g) for a random generator g and random a, b ∈ {0, …, q-1}. Find gab

7
New cards

Passive

Type of attack in which a unauthorized user monitors, intercepts, or observes network traffic and communications

8
New cards

Active

Type of attack where an attacker directly interacts with, alters, disrupts, or destroys a system, network, or data

9
New cards

Kerckhoff’s Principle

Security through obscurity is not recommended. It is unwise to make the security of information reliant on how the encryption algorithm works. Instead, we rely on the secrecy of the shared key

10
New cards

Unconditional security

The security of the cipher is independent of the computing resource available to the adversaries

11
New cards

Computational security

Adversaries have limited computational resources and the security is reliant on the size of the computations needed to break the cipher.

12
New cards

Substitution

Principle of encryption algorithm that maps plaintext characters to different values

13
New cards

Transposition

Principle of encryption algorithm that maps plaintext characters to different positions in the ciphertext

14
New cards

Caeser cipher

Classical cipher in which each character is shifted k places

15
New cards

Affine Cipher

Classical cipher in which each character mapped using ap + b mod n

16
New cards

Monoalphabetic cipher

Classical cipher in which each character mapped to a different character

17
New cards

Row transposition cipher

Classical cipher in which the plaintext is written in rows and the ciphertext is built from the columns arranged in a particular order.

18
New cards

Polyalphabetic Cipher

Complex classical cipher that involves a set of monoalphabetic ciphers being applied

19
New cards

Vigenere Cipher

Complex classical cipher that involves rotating set of caeser ciphers being applied, changing each letter of the plaintext

20
New cards

Hill cipher

Complex classical cipher that involves converting the plaintext into a vector and performing matrix multiplication with the key (matrix)

21
New cards

Product cipher

Complex classical cipher that involves combining several substitution and transposition ciphers

22
New cards

Block cipher

Cipher that breaks message down into fixed length blocks before encrypting

23
New cards

Stream cipher

Cipher that generates a key stream and applies it to an incoming plaintext stream.

24
New cards

Vernam Cipher

A Vigenère Cipher where the length of the key is equal to the length of the message

25
New cards

One time pad

An extension of the Vernam cipher that uses a truely random key to provide perfect secrecy

26
New cards

Diffusion

Principle of encryption that dissipates statistical structure of plaintext over ciphertext

27
New cards

Confusion

Principle of encryption that makes relationships between ciphertext and key as complex as possible

28
New cards

Iterated block cipher

A block cipher that involved several repetitions of an iterated round function

29
New cards

Fiestel Cipher

Iterated cipher that involves breaking the plaintext into two parts Ri and Li, moving Ri to the left and XORing Li with the encrypted version of Ri

30
New cards

Data Encryption Standard

A type of Fiestel cipher that has a block size of 64 and key size of 56 bits

31
New cards

DESX

Extension of DES that involves XORing additional keys before and after applying the DES algorithm.

32
New cards

Electronic Codebook

knowt flashcard image
33
New cards

Cipher Block Chaining

knowt flashcard image
34
New cards

Cipher Feedback Mode

knowt flashcard image
35
New cards

Output Feedback Mode

knowt flashcard image
36
New cards

Counter Mode

knowt flashcard image
37
New cards

Advanced Encryption Standard

Symmetric Encryption algorithm commonly used today that is more secure than DES

38
New cards

SubBytes

1st AES operation: each byte is replaced with a different value from a lookup table

39
New cards

ShiftRows

2nd AES operation: each row in the grid moves by a different amount

40
New cards

MixColumns

3rd AES operation: finite field arithmetic used to transform bytes in each column

41
New cards

AddRoundKey

4th AES operation: result is XORed with round key

42
New cards

Symmetric

Type of cryptography that uses a single, shared key for each pair of communicators

43
New cards

Asymmetric

Type of cryptography that uses a public/private key pair per communicator

44
New cards

RSA

Asymmetric encryption/signature algorithm that is based on the assumption that factoring an integer that is the product of two primes is hard.

45
New cards

Factorisation Problem

Given n (where n is the product of two primes p, q), find p and q 

46
New cards

RSA problem

Given (n, e, C = Me) determine the e-th root of C mod n

47
New cards

Chosen Plaintext

Type of attack on encryption in which the adversary can produce a ciphertext for any given plaintext

48
New cards

Chosen Ciphertext

Type of attack on encryption in which the adversary can produce a plaintext for any given ciphertext (ciphertexts must all be chosen in advance)

49
New cards

Adaptive Chosen Ciphertext

Type of attack on encryption in which the adversary can produce a plaintext for any given ciphertext (ciphertexts can be chosen in response to previous plaintexts)

50
New cards

Optimal Asymmetric Encryption Padding

Way of formatting RSA messages to prevent against chosen plaintext attacks

51
New cards

Timing Attack

Type of attack in which the attacker observes the behaviour of the cryptographic algorithms and use the experience to break the secret directly.

52
New cards

Constant time

Counter measure against timing attack that ensures all operations take the same amount of time

53
New cards

Random delay

Counter measure against timing attack that adds in random amounts of extra time to computations

54
New cards

Blinding

Counter measure against timing attack that involves multiplying the input and output of RSA by a random number to change timing of algorithm,

55
New cards

Digital Signature

An electronic tag used to ensure the integrity, authentication and non-repudiation of a message

56
New cards

Existential forgery

An attack where an adversary successfully creates a valid digital signature for at least one new message

57
New cards

Redundancy function

Tool applied to input of RSA function to prevent blinding attacks on digital signatures

58
New cards

Mathematical Attack

Type of attack that uses an exception/edge-case to a hard problem to help break an encryption/signature algorithm

59
New cards

Broadcast problem

Flaw in RSA when the same e value is used for the same message (can be broken using CRT)

60
New cards

Elementary attack

Attack that is possible when two users use the same values for e/d in RSA and so can use their own information to break each other’s encryption.

61
New cards

Preimage resistance

Given an element y in the hash space, it is hard to find x such that H(x) = y

62
New cards

Second Preimage Resistance

Given a message and a hash pair (x, H(x) it is hard to find x’ such that H(x) = H(x’) and x ≠ x’

63
New cards

Collision Resistance

It is hard to find two unique elements x, x’ such that H(x) = H(x’)

64
New cards

Merkle-Damgard Construction

Scheme that applies cipher block chaining to hashes

65
New cards

Birthday Paradox

In a random group of just 23 people, there is more than a 50% chance that at least two people share the same birthday

66
New cards

Birthday Attack

A type of cryptographic brute-force attack that exploits the mathematics of the birthday paradox to find collisions in hash functions with approximately only 2m/2 messages

67
New cards

Message Authentication Code

A cryptographic tag used to confirm the integrity and authenticity of a message. A keyed hash function

68
New cards

Internal Error Control

MAC, then encrypt

69
New cards

External Error Control

Encrypt, then MAC

70
New cards

Physical delivery

Method of symmetric key distribution that involves delivering the key in person

71
New cards

Delivery through a third party

Method of symmetric key distribution that involves passing the key through a trusted intermediary

72
New cards

Transmission via old key

Method of symmetric key distribution that involves reusing an existing channel

73
New cards

Key server

Method of symmetric key distribution that involves relying on a third part to store and manage keys

74
New cards

Public Key Algorithmic Method

Method of symmetric key distribution that uses DH to share key

75
New cards

Needham-Schroeder Protocol

Commonly used method of symmetric key distribution that relies on a trusted third party

76
New cards

Key Distribution Centre

Trusted server used to create, store and allocate cryptographic keys

77
New cards

Merkle Key Distribution

Commonly used method of symmetric key distribution that relies on asymmetric encryption

78
New cards

Pseudorandom Number Generator

Deterministic algorithm that generate random-like objects from a seed.

79
New cards

Public announcement

Method of asymmetric key distribution that involves broadcasting keys

80
New cards

Public directory

Method of asymmetric key distribution that relies on a 3rd party to store a list of all keys

81
New cards

Public Key Authority

Method of asymmetric key distribution that relies on a 3rd party to manage distribution and maintenance of keys

82
New cards

Public Key Certificate

A decentralised method of public key authentication that doesn't rely on an authority being  constantly be online

83
New cards

ElGamal Encryption

An extension of Diffie Hellman key distribution that allows messages to be encrypted

84
New cards

ElGamal Signature

An extension of Diffie Hellman key distribution that allows digital signatures to be created for messages

85
New cards

Secure Socket Layer

Depreciated standards for secure communication over the internet

86
New cards

Transport Layer Security

Current standards for secure communication over the internet

87
New cards

End to End Encryption

A method of ensuring continuous secrecy of a message passed across multiple nodes of the internet

88
New cards

Signal Protocol

A method of providing E2EE that uses X3DH to establish a shared key then a ratchet to provide forward and d future secrecy

89
New cards

Extended triple Diffie-Hellman

A key derivation method that ensures that keys are fresh and can be generated while one party is off line

90
New cards

Forward security

When an attack occurs, all previously sent messages are secure

91
New cards

Future secrecy

When an attack occurs, all future messages are secure

92
New cards

Break-in Recovery

Later keys cannot be calculated from earlier ones

93
New cards

Symmetric-Key Ratchet

A method of continuously deriving new symmetric keys that provides forward-secrecy but not break-in recovery

94
New cards

Diffie-Hellman Ratchet

A method of continuously deriving new encryption keys by continuously updating asymmetric keys, providing forward-secrecy and break in recovery

95
New cards

Identification

First step of authentication - who are you?

96
New cards

Verification

Second step of authentication - prove it

97
New cards

Freshness

Describes whether current keys are current or if they could be old/reused

98
New cards

Replay attack

A form of attack that involves resending a message later

99
New cards

Sequence numbers

A method of ensuring freshness that relies on messages being sent in proper ordering

100
New cards

Timestamps

A method of ensuring freshness that relies on messages being sent withing a certain window of time