Key pairs and GPG

The basics are that all modern security relies on a simple feature of prime numbers - it’s really hard to find a factor of a very very large number. Hard as in hundreds of years via brute force.

Edward Snowden said it simply - trust the math

But the math is simple - how is it implemented

My goal is to look at the anatomy of a GPG key (openpgp) and show how the primary key self signs it’s user ids and subkeys - that way I can show a calculation in process and show how subkeys can be split up and still have link back to primary key pair

Using larger than 4096 size http://www.jroller.com/robertburrelldonkin/entry/gnupg_8192bit_rsa_keys

Basdically adjyst ‘keygen.c’