TITLE:
Potential Vulnerability of Encrypted Messages: Decomposability of Discrete Logarithm Problems
AUTHORS:
Boris S. Verkhovsky
KEYWORDS:
Network Vulnerability, System Security, Discrete Logarithm, Integer Factorization, Multi-Level Decomposition, Complexity Analysis
JOURNAL NAME:
International Journal of Communications, Network and System Sciences,
Vol.3 No.8,
August
31,
2010
ABSTRACT: This paper provides a framework that reduces the computational complexity of the discrete logarithm problem. The paper describes how to decompose the initial DLP onto several DLPs of smaller dimensions. Decomposability of the DLP is an indicator of potential vulnerability of encrypted messages transmitted via open channels of the Internet or within corporate networks. Several numerical examples illustrate the frame- work and show its computational efficiency.