• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.7
• /
• pp.693-700
• /
• 2016

It is important that we can calculate the order of non-supersingular elliptic curves with large prime factors over the finite field GF(q) to guarantee the security of public key cryptosystems based on discrete logarithm problem(DLP). Schoof algorithm, however, which is used to calculate the order of the non-supersingular elliptic curves currently is so complicated that many papers are appeared recently to update the algorithm. To avoid Schoof algorithm, in this paper, we propose an algorithm to calculate orders of elliptic curves over finite composite fields of the forms $GF(2^m)=GF(2^{rs})=GF((2^r)^s)$ using Weil's theorem. Implementing the program based on the proposed algorithm, we find a efficient non-supersingular elliptic curve over the finite composite field $GF(2^5)^{31})$ of the order larger than $10^{40}$ with prime factor larger than $10^{40}$ using the elliptic curve $E(GF(2^5))$ of the order 36.

• East Asian mathematical journal
• /
• v.32 no.1
• /
• pp.61-75
• /
• 2016

If ${\phi}$ is a polarizable endomorphism on a projective variety, then the Weil height machine guarantees that ${\phi}$ satisfies Northcott's theorem. In this paper, we show that Northcott's theorem only holds for polarizable endomorphisms and generalize this result to arbitrary dominant endomorphisms: we introduce the height expansion and contraction coefficients which provide weak Northcott's theorem for dominant endomorphisms. We also give some applications of the height expansion and contraction coefficients.