K. Rubin and A. Silverberg, “Ranks of Elliptic Curves”, Bulletin American Mathematical Society (New Series), Vol. 39, No. 4, 2002, pp. 455-474. doi:10.1090/S0273-0979-02-00952-7
has been cited by the following article:
TITLE: Computation of Complex Primes Using Elliptic Curves: Application for Cryptosystem Design
AUTHORS: Boris S. Verkhovsky
KEYWORDS: Communication Security; Gauss Formula; Complex Primes; Points Counting; Modular Elliptic Curve; Applets; Dual Elliptic Curves
JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.5 No.1, January 20, 2012
ABSTRACT: This paper provides several generalizations of Gauss theorem that counts points on special elliptic curves. It is demonstrated how to implement these generalizations for computation of complex primes, which are applicable in several protocols providing security in communication networks. Numerical examples illustrate the ideas discussed in this paper.