An efficient method to generate elliptic curves
In this paper, an efficient method to generate elliptic curves for public key cryptosystems based on discrete logarithm problem is presented. Usually, to resist possible attacks, such as MOV reduction, public key cryptosystems based on elliptic curve E over field GF（q） must satify the following cond...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2001-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/thesisDetails?columnId=74366247&Fpath=home&index=0 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, an efficient method to generate elliptic curves for public key cryptosystems based on discrete logarithm problem is presented. Usually, to resist possible attacks, such as MOV reduction, public key cryptosystems based on elliptic curve E over field GF（q） must satify the following condition: the order m of the curve has a large prime factor of the form 2p+1 where p is a prime and q21 mod m. This condition can be relaxed to include primes of the form 2ip+1 （i is a small integer） without compromising security. Hence, the number of elliptic curves suitable for use by public key cryptosystems is increased greatly. We design a method to implement such a scheme, showing that, it is much faster to generate a suitable elliptic curve with this new scheme than with the original scheme. |
|---|---|
| ISSN: | 1000-436X |