An implementation of fast algorithm for elliptic curve cryptosystem over GF( p ) |
| |
Authors: | Lu Chen Chen Yanpu and Bian Zhengzhong |
| |
Affiliation: | (1) Life Science Institute, Xi’an Jiaotong University, 710049 Xi’an;(2) Computer Center, Xi’an Communication Colledge, 710106 Xi’an |
| |
Abstract: | The design and implementation of fast algorithms related to Elliptic Curve Cryptography (ECC) over the field GF(p), such as modular addition, modular subtraction, point addition, point production, choice of embedding plaintext to a point,
etc. are given. A practical software library has been produced which supports variable length implementation of the ECC-based
ElGamal cryptosystem. More importantly, this scalable architecture of the design enables the ECC being used in restricted
platforms as well as high-end servers based on Intel Pentium CPU. Applications such as electronic commerce security, data
encryption communication, etc. are thus made possible for real time and effective ECC.
Supported by the National Natural Science Foundation of China (No.60271025) |
| |
Keywords: | PKI Elliptic curve algorithm Finite field Discrete logarithm ElGamal cryptosystem Point group |
本文献已被 SpringerLink 等数据库收录! |
|