研究了Q2的非分歧扩域上椭圆曲线的近似计算问题:椭圆曲线有理点群中元素的有限表示、点加法中的提升算法以及点加法的近似计算等.借助两种提升算法完整地给出椭圆曲线有理点群中加法的近似计算公式,这将为利用无限域上椭圆曲线构造密码的可行性分析提供完善的理论基础.
In this paper we address approximation calculations on the elliptic curves defined over unramified extensions of 2-adic number fields, including the finite representation of rational points of an elliptic curve over such fields, lifting algorithms in the point addition and the addition formula with approxima- tion calculations under this representation. Combining with two lifting methods, we get approximation calculation formulas in all conditions for the point addition of the group of rational points on an elliptic curve over these fields. It will be beneficial for the feasibility analysis on the elliptic curve cryptography defined over infinite fields.