有限域上的椭圆曲线离散对数及Diffie-Hellman密钥交换

ECDLP and Diffie-Hellman Key Exchange

本文介绍了椭圆曲线的基本知识和有限域上的椭圆曲线离散对数问题,并详细阐述了椭圆曲线上乘法的快速算法。这种快速算法可以应用于 Diffie-Hellman密钥交换过程。本文最后用一个例子说明了这个交换过程。

This paper introduces some basic knowledge about elliptical curves and the discrete logarithm problem for the group of an elliptic curve over some finite field. Fast scalar multiplication on elliptical curves is specified, which is useful for the implementation of Diffie-Hellman key exchange illustrated by the example included by the paper.