摘要
本文将广义Mersenne素数与Montgomery-形式椭圆曲线的CM(复乘)构造方法有机结合,并在构造过程中充分运用了预计算,和原有方法相比,既提高了挑选曲线的速度,又提高了公钥密码体制实现的效率。
In this paper we combine the generalized Mersenne prime and the CM method to construct Montgomery-form elliptic curves, besides it sufficiently use pre-computation, compared with the former method, the new method not only improves the speed of selecting curves, but also improves the efficiency of the public key cryptosystems.
出处
《微计算机信息》
北大核心
2006年第02X期20-21,180,共3页
Control & Automation
基金
河南省杰出青年科学基金资助项目(0312001800)
