The idea of the fast method is independent on the optimization of finite field arithmetic and the choice of coordinate expression of points of elliptic curves.
實(shí)現(xiàn)了算法的快速優(yōu)化，其原理與有限域算術(shù)優(yōu)化和橢圓曲線點(diǎn)的坐標(biāo)表示的選取無(wú)關(guān)，其運(yùn)算速度是通常的重複加倍—點(diǎn)加算法的6倍。