CSEC 701 Cryptography Review

0.0(0)
studied byStudied by 0 people
0.0(0)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/52

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

53 Terms

1
New cards

one time pad

perfect cipher

2
New cards

block cipher

plaintext divided into blocks of a preset size, using subs and transp

3
New cards

short key problem

use double DES using two keys and encrypt twice

4
New cards

AES

block cipher 128 bits, key size 128, 192, and 256

5
New cards

mode

a technique for applying the cipher by mixing its outputs to hide ciphertext patterns (ECB and CBC)

6
New cards

ECB

each block encrypted independently, identical blocks mean same ciphertext

7
New cards

CBC

message blocks linked otgethor, uses IV to start process

8
New cards

CTR

no chaining

9
New cards

RC4

RSA security, stream cipher psuedo one time pad

10
New cards

hash function

a transformation of a message of arbitrary length into a fixed length value, produces a unique value that corresponds to the data entered

11
New cards

good hash function

changes the hash output radically for a tiny chnage in input

12
New cards

hash functions

NOT encryption, used for error detection or checking integrity of a file, file comparison, and membership query

13
New cards

hash collision

duplicate hashes form same input, h =f (M), about 50% chnace to find collisions

14
New cards

birthday attack

finding at least two people having the same birthday, chance of collision

15
New cards

level of safety

number of trials have to try before finding a collision, possible outcomes 2^n (=H), ex: H=2^160 : 2^80

16
New cards

why is collision bad

can allow attackers to create twin documents and effectively alter the original document 

17
New cards

dangers of hash functions

they are non-cryptographic,

18
New cards

one way hash

easy to generate code but computationally infeasible to find data mapping to speciifc hash vaue (impractical to reverse), collision free

19
New cards

weak collision

not broken, given M, find M’ that has the same hash value

20
New cards

strong collision

broken, find a apir fo M that have the same hash value

21
New cards

MD5

one way hash function, 128 bit message, broken

22
New cards

SHA

one way hash function, 160bit message digest

23
New cards

message authentication

protect integrity of message, validate identity of originator, non-repudiation of origin, with or without message encryption

24
New cards

with message encyrption

where confidentiality is not needed, slow encryption

25
New cards

MAC

small block appended to the message, problem with altering, must use encryption to generate a MAC, encryption is slow, must encrypt only hash 

26
New cards

HMAC

faster that block cipher, need to add a key

27
New cards

entropy

level or amount of randomness

28
New cards

asymmetric key

use public and private key

29
New cards

public key algorithms

DH, RSA, and EC

30
New cards

RSA

public key scheme, security due to cost of factorng large numbers

31
New cards

magin in the finite field

based on an exponentiation in a finite field over integers modulo a prime

32
New cards

RSA algorithm calculate

select p and q values (prime, secret), calculate n=p*q (public), calculate (n)=(p-1)(q-1) (secret), select e, determine d such that d*e=1 mod (n)

33
New cards

DH key exchnage

based on difficulty of computing discrete logarithms, NOT encryption algorithm,

34
New cards

discrete logarithm 

find the smallest k for ex: 3^k =5 mod 7

35
New cards

ECDH

uses additive groups of points on an elliptuc curve, group operation is denoted by +

36
New cards

elliptic curve

y² = x³ + ax + b

37
New cards

ECC

harder to solve than DH, requirs less memory, less power consumption 

38
New cards

symmetric encryption

faster, better for bulk transfers, key management problem

39
New cards

asymmetric encryption

solves key distrubution issue, has computational complexity

40
New cards

session key

a symmetric key used for encrypting messages during a communication session, two step process 

41
New cards

digital signature

cryptographic implementation of electronic signature, not digitized signature, helps prove, authenticate, and verifies by 3rd party, senders private key is used

42
New cards

features of digital signature 

authenticity, unforgeability property, nonresuability, repudiation 

43
New cards

DSS

using SHA, contains the RSA method and ECDSA method,

44
New cards

digital certificate

public key combined with owners name, binds individuals identitty to a public key

45
New cards

public key challenges 

hwo to tell if public key is fake

46
New cards

3rd party endoresement

use public key, notary(CA) encrypts certificate with his private key, 3rd aprtys private key is used

47
New cards

digital certificate format

X.509, widely used standard

48
New cards

PKI

use of digital certificates and the endoresement process

49
New cards

certificate repository 

a centralized directory that can be accessed 

50
New cards

certificate based threats

forging false certificate, false sense of security, stolen certificates

51
New cards

COMODO incident

fraudulent certificates issued fpr 8 domains

52
New cards

MITM attack with hash collision 

an MITM attacker presents a fake certificate to the victim 

53
New cards

what encryption key used most common in RSA

65537 or 2^16 +1