一种基于Z/nZ上椭圆曲线的公钥密码算法

本文在 Ｋ Ｍ Ｏ Ｖ 算法［１］的基础上作了改动，提出了一种 Ｚ／ｎ Ｚ 上椭圆曲线公钥密码算法，ｎ是两个大安全素数之积，算法安全性基于整数因子分解难题，与 Ｒ Ｓ Ａ 体制相似，能抵卸一些对 Ｒ Ｓ Ａ 算法的攻击，不足之处在于不能证明其安全性是否等价于因子分解问题。算法加解密过程都很简洁，且在加密过程中引入随机数，实现概率加密。同时给出了数字签名和身份认证方案。

A Public Key Cryptosystem Based on Elliptic Curves over Z/nZ

This paper presents a new public key cryptosystem based on elliptic curves over Z/nZ according KMOV1],where n is the product of two large secure primes.Its security bases on the difficulty of factoring n ,just like RSA.It can resist some of the known attacks on RSA,although it is not known whether breaking the system is equivalent to factoring n.In this algorithm the encryption and decryption are simple,and random number is used when encrypting for probability encryption.Then digital signature and authentication schemes are given.