PGP: An Algorithmic Overview

Programming, for all ages and all languages.
Post Reply
rich_m
Member
Member
Posts: 33
Joined: Sat Nov 25, 2006 10:05 am

PGP: An Algorithmic Overview

Post by rich_m »

I am trying to understand the Pretty Good Privacy algorithm:: and have atteched a pdf about it.
A Diffie-Hellman key consists of four values: p, a large prime, g, a primitive element under mod p, d, a random number between 1 and p-2, and e, which is g^d mod p.
Can anyone break this down into simple words. as to what
p,g,d and e are? p i understand is a large prime i.e. a number that cant be divided by any number except 1 and itself. d is fine a random number, i understand that.
g---? whats "primitive"?
Attachments
PGP.zip
PGP: An Algorithmic Overview
(33.44 KiB) Downloaded 35 times
imagination is once limit......
User avatar
Combuster
Member
Member
Posts: 9301
Joined: Wed Oct 18, 2006 3:45 am
Libera.chat IRC: [com]buster
Location: On the balcony, where I can actually keep 1½m distance
Contact:

Post by Combuster »

"Certainly avoid yourself. He is a newbie and might not realize it. You'll hate his code deeply a few years down the road." - Sortie
[ My OS ] [ VDisk/SFS ]
Post Reply