Computation of Complex Primes Using Elliptic Curves: Application for Cryptosystem Design

• 作者: Boris S. Verkhovsky
• 来源期刊: 通讯、网络与系统学国际期刊(英文)
• 学科: 数学
• 关键词: Communication Security GAUSS Formula COMPLEX PRIMES Points COUNTING Modular ELLIPTIC Curve Applets Dual ELLIPTIC Curves
• 年，卷（期）: 2012,（1）
• 页码范围: 1-6
• 页数: 6页
• 分类号: O1

摘要

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.