summaryrefslogtreecommitdiff
path: root/day2/more-secrets-of-crpyto.txt
blob: 0246a584d674377b691d0a8fd860ad49f4e7e40b (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
# Crypto
Christopher Riley
@giveupalready
https://github.com/carnage

## Overview:
Why do we need crypto?

- Confidentiality
- Key Ex
- Identity
- Authentication

## Asymmetric Crypto
- Symmetric crypto faster, asymmetric slower and computational expensive
- RSA
    - slightly old
    - Needs 2048+ size keys

## Elliptic curve crypto
- Dot function
- Key exchange with shared key created from a -> aG -> aGb <- bG <- b
- Week to man in the middle

## Web of trust
- How can we safely pass the key over an unsecured channel
- Just blindly trust on first use (like ssh)

## The trusted third party
- Get a 3rd actor to meet Alice and Bob to add trust

## hash functions
- md5 weak
- sha good

# Merkel tree
- Hash chunks
- Combine chunks and hash
- Can work out which parts are wrong
- good for static data
- hash tree

## Block chain
- Use block chain to share trusted messages







--------
Web of trust, trust once, trust forever