摘要
本文从应用系统的安全性和高效性的要求出发,阐述了椭圆曲线密码体制的基本原理及其优点,设计了一个基于大素数域Fp椭圆曲线的身份认证系统,并对该系统进行了安全性分析。在椭圆曲线加密模块的实现中,大素数域中的模逆运算和椭圆曲线上的点乘运算经常是算法实现的瓶颈,本文采用模逆运算和点乘运算的改进算法来提高程序的运行效率。
This paper discusses the elliptic curve cryptography and its advantages from the requirements of application system security and efficiency, designs an identity authentication system based on elliptic curve over large prime fields Fp, and analyzes the security final-ly。Usually modular inverse operation on large prime fields and point multiplication on elliptic curve become bottlenecked in realizing the elliptic curve cryptosystem,and this paper adopts the improved measures of them to improve the running efficiency of the program.
出处
《微计算机信息》
北大核心
2007年第3期87-88,115,共3页
Control & Automation
基金
江西省自然科学基金资助项目(0411035)
关键词
椭圆曲线
大素数域
模逆
点乘
身份认证
elliptic curve,large prime fields,modular inverse
point multiplication, identity authentication