Skip main navigation

The idea behind the Diffie-Hellman algorithm

Chris Hughes explains how Alice and Bob can use modular arithmetic to safely share a secret, even in the presence of eavesdroppers.

A worked example of how the Diffie-Hellman key exchange works.

Check the calculations as Chris talks you through the example. Did you manage to successfully follow all of the steps?

This article is from the free online

The Mathematics of Cryptography: From Ancient Rome to a Quantum Future

Created by
FutureLearn - Learning For Life

Reach your personal and professional goals

Unlock access to hundreds of expert online courses and degrees from top universities and educators to gain accredited qualifications and professional CV-building certificates.

Join over 18 million learners to launch, switch or build upon your career, all at your own pace, across a wide range of topic areas.

Start Learning now