摘要
在对SATOH算法进行研究的基础上,给出了该算法的两个优化实现:一个实现是针对193次扩域,另一个实现是通用的,能处理256次以下的扩张.并介绍了在实现该算法时所采取的一些优化措施.
SATOH algorithm is an important method for elliptic curve point counting. We study this algorithm deeply and have achieved two optimizing implementations. One is for 193 degree expansion, and the other is for generous purpose, handling expansion bellow 256 degree. The first one is for practical purpose and can be used in real project, the second is for study purpose. In this article, the author introduces the ideal of SATOH algorithm, setting out some of the skill used in our implementation.
出处
《广州大学学报(自然科学版)》
CAS
2005年第2期146-148,共3页
Journal of Guangzhou University:Natural Science Edition