Elliptic curve cryptosystems([19],[25]) are based on the elliptic curve discrete logarithm problem(ECDLP). If elliptic curve cryptosystems avoid FRreduction([11],[17]) and anomalous elliptic curve over Fq ([3], [33], [35]), then with current knowledge we can construct elliptic curve cryptosystems over a smaller definition field. ECDLP has an interesting property that the security deeply depends...

by the mordell-weil theorem‎, ‎the group of rational points on an elliptic curve over a number field is a finitely generated abelian group‎. ‎there is no known algorithm for finding the rank of this group‎. ‎this paper computes the rank of the family $ e_p:y^2=x^3-3px $ of elliptic curves‎, ‎where p is a prime‎.

Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosystems([16]). This is why elliptic curve cryptosystems have begun to attract notice. There are mainly two types in elliptic curve cryptosystems, elliptic curves E over IF2r and E over IFp. Some current systems based on ...

We construct an elliptic curve over Q with non-trivial 2-torsion point and rank exactly equal to 15.

We prove a general identity for a 3F2 hypergeometric function over a finite field Fq, where q is a power of an odd prime. A special case of this identity was proved by Greene and Stanton in 1986. As an application, we prove a finite field analogue of Clausen’s Theorem expressing a 3F2 as the square of a 2F1. As another application, we evaluate an infinite family of 3F2(z) over Fq at z = −1/8. T...

II