Camp 2007 - 1.01
Chaos Communication Camp 2007
To infinity and beyond
| Speakers | |
|---|---|
|
Seth Hardy |
| Schedule | |
|---|---|
| Day | 4 |
| Room | Shelter Bar |
| Start time | 12:30 |
| Duration | 02:30 |
| Info | |
| ID | 1964 |
| Event type | Lecture |
| Track | Science |
| Language | English |
| Feedback | |
|---|---|
|
Did you attend this event? Give Feedback |
A Crash Course In The Math of Public Key Cryptography
All the math you need to demystify public key crypto, no background needed.
This workshop is a lecture-style presentation on the mathematics of public key encryption, aimed towards people who want or may need to do their own encryption. The focus will be on discrete logarithms (DH, ElGamal, DSA), factoring (RSA), and elliptic curves. No background in mathematics necessary.
This workshop is a lecture in the math background of public key encryption. (Bring something to take notes on!) All the prerequisite math will be covered, no prior background in mathematics is necessary. The goal of the lecture is to have everyone come out with enough understanding of some common algorithms, not just how but also why they work, that they may be able to reproduce and implement the algorithms properly.
The focus will be on the discrete logarithm problem, commonly used in the Diffie-Hellman key exchange, ElGamal encryption, and DSA digital signatures; factoring, which is commonly used by RSA encryption and digital signatures; and elliptic curves, used in variants of the DLP. The math covered will mostly include abstract algebra and number theory.