Practical Networking .net
post

Diffie-Hellman

How can two people in a crowded room derive a secret that only the pair know, without revealing the secret to anyone else that might be listening? That is exactly the scenario the Diffie-Hellman Key Exchange exists to solve. The Diffie-Hellman Key Exchange is a means for two parties to jointly establish a shared secret over […]

post

Using Asymmetric Keys

We’ve established how Asymmetric encryption makes use of two mathematically linked keys: One referred to as the Public Key, and the other referred to as the Private Key. We’ve also established that what one key encrypts, only the other can decrypt. These two attributes allow us to perform two separate operations with a Key Pair. Asymmetric Encryption Below is […]

post

RSA Example

The RSA algorithm is the most widely used Asymmetric Encryption algorithm deployed to date. The acronym is derived from the last names of the three mathematicians who created it in 1977:  Ron Rivest, Adi Shamir, Leonard Adleman. In order to understand the algorithm, there are a few terms we have to define: Prime – A number […]

post

Asymmetric Encryption

Earlier, we learned that Symmetric encryption is an encryption scheme that uses the same key to encrypt and decrypt. Conversely, Asymmetric encryption, uses different keys to encrypt and decrypt. Lets take a look at a simple example. For the sake of simplicity, let us pretend for this example that there are only the lower case letters a – […]