Elliptic curve cryptography is an important part of nowaday's public key cryptosystem.Counting points of elliptic curves over finite fields is of great significance to the selection of safety curves.At present,the...Elliptic curve cryptography is an important part of nowaday's public key cryptosystem.Counting points of elliptic curves over finite fields is of great significance to the selection of safety curves.At present,there are many p-adic algorithms,such as SST algorithm,generalized AGM algorithm,Kedlaya algorithm,etc.,which can deal with the situation of finite fields of small characteristics.In this paper,the authors generalize the MSST algorithm of characteristic 2 to general fields of odd characteristic,and propose the generalized MSST algorithm.The generalized MSST algorithm is achieved by combining the advantages of the SST algorithm and the generalized AGM algorithm.If the time complexity of the multiplication of two n-bit numbers is denoted as O((n)^(μ)),then the time complexity of the generalized MSST algorithm is O(n^(2μ+1/1+μ)),which is the same as the improved SST algorithm.In practical experiments,the running time of the generalized MSST algorithm is less than that of the improved SST algorithm.展开更多
基金supported by the National Natural Science Foundation of China under Grant No.11701552。
文摘Elliptic curve cryptography is an important part of nowaday's public key cryptosystem.Counting points of elliptic curves over finite fields is of great significance to the selection of safety curves.At present,there are many p-adic algorithms,such as SST algorithm,generalized AGM algorithm,Kedlaya algorithm,etc.,which can deal with the situation of finite fields of small characteristics.In this paper,the authors generalize the MSST algorithm of characteristic 2 to general fields of odd characteristic,and propose the generalized MSST algorithm.The generalized MSST algorithm is achieved by combining the advantages of the SST algorithm and the generalized AGM algorithm.If the time complexity of the multiplication of two n-bit numbers is denoted as O((n)^(μ)),then the time complexity of the generalized MSST algorithm is O(n^(2μ+1/1+μ)),which is the same as the improved SST algorithm.In practical experiments,the running time of the generalized MSST algorithm is less than that of the improved SST algorithm.
