Abstract
Here, we improve our previous bound on the number of finite fields over which elliptical curves of cryptographic interest with a given embedding degree and small complex multiplication discrimination may excist. We also give some heuristic arguements which lead to a lower bound which in some cases is close to our upper bound.
Original language | English |
---|---|
Pages (from-to) | 281-286 |
Number of pages | 6 |
Journal | Advances in Mathematics of Communications |
Volume | 1 |
Issue number | 3 |
Publication status | Published - Aug 2007 |
Keywords
- elliptical curves
- pairing based cryptography
- embedding degree
- ELLIPTIC-CURVES
- WEIL
- CRYPTOSYSTEMS