Now let’s talk about how Diffie-Hellman uses modular exponentiation to calculate a shared key.

现在让我们谈谈 Diffie-Hellman 如何使用模幂计算共享密钥。

In Diffie-Hellman, the one-way function is modular exponentiation.

在 Diffie-Hellman 中，单向函数是模幂。

We're well below that today, but with exponentiation, you could get past that three million.

我们今天远低于这个数字，但如果取幂，你可以超过这 300 万。

Here I'm going to add the exponentiation operator, so, 2 to the power of 2. Once again, what do you think is the result of this expression? Pause the video and think about it for a few seconds.

在这里我要加上求幂运算符，所以，2 的 2 次方。 再一次，你认为这个表达式的结果是什么？ 暂停视频并思考几秒钟。

Because the exponentiation operator takes precedence, so first 2 to the power of 2 is executed, the result is 4, then 4 is multiplied by 3, that is 12, and finally 12 is added to 10. So x should be 22.

因为取幂运算符优先， 所以先执行2的2次方，结果是4，然后4乘以3，即12，最后12加上10， 所以x应该是22。