Data Encryption: How Encryption Works Part 2

How Encryption Works Part II

Fill this out to continue

About the Whitepaper

Data Encryption: How Encryption Works Part 2

If you recall, in our last blog, we touched on the Diffie-Helman method of using two keys – one to encrypt and the other to decrypt. In a practical application of asymmetric key encryption between 2 parties, the Diffie-Helman mechanism requires an exchange of public keys between the 2 entities – so they can encrypt messages meant for the other or decrypt messages sent by the other.

A practical implementation of Diffie-Helman was made possible by 3 MIT scientists – Rivest, Shamir, and Adleman in 1977, the very next year after Diffie and Hellman made their theory public. Popularly known as RSA, this practical implementation of Diffie Helman used mathematical factoring as the way to create the one-way function that is essential as part of the Diffie-Helman key exchange.

Scroll to Top