-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
I'm giving a talk that has a section on PKI -- what it is, a bit on
how it works, how strong it is, and why everybody should be using
it every day. One of the things I want to do is a little simple
demonstration of how the math works. I know it relies on operators
that can't be done backwards but those are complex operators.
However, other than using the modulus operator as an example of non-
reversible math and then saying "it's a little more drawn-out than
that" I'd like to generate a pair of keys and encrypt simple text
(cf.
http://content.hccfl.edu/pollock/AUnixSec/PublicKeyDemo.htm)
even if its not with a good implementation of PKI.
The problme is that everywhere I go I keep running into advanced
math like Euler's totient and the psi function; and thats where the
math get's WAY above the level of my audience. I want to go a
little past the Alice and Bob conversation and actualy show how two
prime factors are related without needing a degree to discuss it
let alone get the gist of it.
Any ideas?
Thank you,
Storge
-----BEGIN PGP SIGNATURE-----
Version: N/A
iQIcBAEBAgAGBQJTScXFAAoJECRTfHvL6q9DIbwQAIQm7lZSUAI6cwNLFSDWkYrV
AYW1sL3DNRv0fcpUySSAgZC0RtTanW8Ky7Kl0DpmNwY+pWSXc5Ho28jk/mkLmoWY
8ycYLeKdrggDa79fBK2MElznpUNs2Y2GjT25a0jbmTSGQaO09FMOspK4ot/mH3xc
2rxUCKiHQqeeP4O0OqGc/RSUX7Jun8XApIPISEp+laAkyCL1U9KwGMC+C/Y2pVgt
MYDjiojZc65975rCd0U3DrVAeuolj182eeZfvE1IQ22zI2ieW/uUwDeofFY9Xlfd
yQFbEAcosYSzsiTwjWPZPiYh//rffAqinKsZkPtEIj+irn/VWWojXQsR7phwb5Ti
R3248I/qu0bTnXD2Khjg3kaitusS0GsK0eNFgreuwdkLzkB4310uOvRQ/APt3f+W
7eXM9WxrOikf+HM8Vc6JL5/XNXSom7IFp2G99pCoVcs+bGHM2TKzkhOFWyOQpO40
UjDOW7FNOxmFtX84TsLbv9h8zKIHLr5dexKY0RocUL+0pJc0rycOSjtfaHGkZEG0
fJSgaO8Ir3nHd2EmDwt7Y1A8ELok5toYZaoxAtJIT5CwZsG4eFBpgwD9X3IG0N/Z
qG1+E/vzYhG1WmRmz4ayYMFXhFkAuqGjPevkZbeyNuEXtNhEQQhWy6m71p6qC6AU
2UIASE2tqMSXJaWzNbrV
=XEJ2
-----END PGP SIGNATURE-----