B. Verkhovsky, “Algorithms for Integer Factorization Based on Counting Solutions of Various Modular Equations,” International Journal of Communications, Network and System Sciences, Vol. 4, No. 11, 2011, pp. 675-682. doi:10.4236/ijcns.2011.411083

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.