首页 / 资料库 / 文献详情

A KIND OF GOOD ELLIPTIC CURVE USED TO SET UP CRYPTOSYSTEM

孙琦、肖戎

1990中国科学通报：英文版Computer Science被引 1

摘要

Let F_q be a finite field, q=p~l, l≥1. Here p is a prime, p≠2, 3. f(x)=x~3+Ax+B, where A, B are integers, p+△=-16(4A~3+27B~2). E denotes an elliptic curve over F_q determined by y~2=f(x). Recently, Koblitz established two kinds of cryptosystems based on elliptic curve discrete logarithm problem. However, in his method of imbedding plantexts there are obvious faults that make some plantexts impossible to be imbedded in E. So, we cannot use it because some plantexts cannot be encrypted.

引用本文（GB/T 7714）