Flashcards in Lecture 3: 25th September 2019 Deck (30)

Loading flashcards...

1

## What are cryptographic hashes?

### A mathematical function or algorithm which takes an input of arbitrary size and returns an output (digest) of a fixed size. It is used to implement mechanisms that transform communications to make them hard to decipher to aid confidentiality and privacy.

2

## What are the properties of cryptographic hashes?

###
pre-image resistance: can't easily find an input that produces a given output

weak collision resistance: given one (fixed) input and its hash, can't easily find another input that gives the same hash

strong collision resistance: can't find any (variable) pair of inputs that give the same hash

3

## What are one-way hash functions?

### A mathematical function or algorithm which takes an input of arbitrary size and returns an output (digest) of a fixed size for which it is hard to find an input for a given output, nor an input whose hash is the same as another given input (pre-image resistance and weak collision resistance).

4

## What is a message authentication code?

### A short piece of data attached to messages to authenticate them generated from a keyed hash function using the message data and a symmetric key known to the sender and receiver.

5

## How are message authentication codes made?

### A keyed hash function combines the message data with a symmetric key known to the sender and receiver to generate a MAC.

6

## What is the Digital Signature Algorithm?

### A mathematical process that generates public and private keys with prime numbers and modular arithmetic to facilitate the use of digital signatures.

7

## How does the Digital Signature Algorithm work?

###
Make keys:

Choose two primes, p (large) and q and choose a random number x between 0 and q. Let g be the result of a math equation on p and q. Let y = (g ^ x) mod p.

private key is {p, q, g, x} and public key is {p, q, g, y}

Then to sign a message:

Take a hash function H (often one of the SHA series)

Let h = the hash of the message

Choose random k, 0 < k < q

Compute r = ((g ^ k) mod p) mod q

Compute i such that k ∗ i mod q = 1

Compute s = i ∗ (h + r ∗ x) mod q = 1

Package the signature as {r,s}

8

## What is a certificate?

### A digital code generated using public-key encryption and a one-way hash function that is authenticated by a trusted third party or certificate authority to verify a message's integrity and authenticate the sender's claimed identity.

9

## What is a certificate aka?

### Certificates are aka digital signatures.

10

## What are certificates made from?

### Certificates are formed from the digest of a message through a hash function (integrity) encrypted by the sender's private encryption key (authenticity), along with a label to show the claimed identity of the sender.

11

## What is a digital fingerprint?

### The output of a one-way fingerprinting (hash) function applied to a message used to verify the integrity of the message.

12

## How do digital signatures work? Give the concept, not the algorithm.

###
The digital fingerprint (hash digest) is encrypted with the sender's private key to form the digital signature and sent with message. The receiver uses the sender's public key to decrypt to find the digital fingerprint. The receiver then independently hash the original message themselves. Authenticity and integrity verified iff the two hash digests are the same.

Confidentiality can also be added. The sender can generate a random key and use it to encrypt the message. They can then encrypt the key with the receiver's public key and send it with the message. The receiver can decrypt the key with their private key to view the original message and perform the same above integrity and authenticity verification checks.

13

## What do digital signatures, message digests, and cryptographic protocols give in terms of the original aims of security?

###
A digital signature gives authenticity

A message digest gives integrity

Cryptographic protocols give confidentiality

14

## What is PGP?

### Pretty Good Privacy is a protocol and set of software that uses encryption for privacy and authentication based on validity assessed by the trust in another party, which propagates in a web and increases for users over time, without relying on any certificate authorities.

15

## How does PGP work?

### Users sign documents with their keys. Trust networks built up, with users trusting those who they trust also trust. Users go through the multiple levels of trust over time as their trust is established.

16

## What are the levels of trust in PGP?

### Untrusted, marginal trust (at least one other trusted user must vouch for a new public key), full trust (trust user to provide their keys without further verification), and implicit trust (for keys that you own). Trusted keys are added to a "key ring" for each user.

17

## What is Public Key Infrastructure?

### A set of roles, policies, hardware, software, and procedures needed to create, manage, distribute, use, store, and revoke digital certificates and manage public-key encryption to aid trusted communication by verifying the authenticity, integrity, and configuration of messages.

18

## What are the possible states of certificates used in PKI?

### Construction; issuance; signing; confirmation / denial; invalidation

19

## What are certificate authorities?

###
Trusted entities that control the distribution of digital certificates in a network. A Certificate Authority can issue certificates, schedule revocation and publish revocation lists.

CAs distribute certificates and certifies identities through registration and identity-public key bindings. note some argue should be private key.

20

## How are certificate authorities related?

### In a hierarchical tree with a trusted root CA that controls other CAs that may be local or remote to users.

21

## What are the consequences of the hierarchical nature of the relations between different certificate authorities?

### Certificates can be hierarchical => very long, having to pass through multiple levels to the root CA.

22

## How are CAs on the lower level of the tree related?

### They certify each other.

23

## What is pre-image resistance in hash algorithms?

### can't easily find an input that produces a given output

24

## What is weak collision resistance in hash algorithms?

### given one (fixed) input and its hash, can't easily find another input that gives the same hash

25

## What is strong collision resistance in hash algorithms?

### can't find any (variable) pair of inputs that give the same hash

26

## What is the difference between a MAC, digital signature, digital fingerprint, and certificate?

###
Digital signature = certificate.

A digital fingerprint is the hash of a message that is encrypted with the sender's private key to form a digital signature.

A MAC is a short piece of data attached to messages to authenticate them generated from a keyed hash function using the message data and a symmetric key known to the sender and receiver.

Both MACs and digital signatures chiefly verify integrity and authenticity but digital signatures can also provide confidentiality.

27

## What is a digital signature?

28

## Of what are certificates in PKI composed?

### Subject's public key and the certificate and private key of the issuer CA.

29

## What is the X.509 standard?

### A standard format of public-key certificates.

30