Academic Journals Database
Disseminating quality controlled scientific knowledge

Potential Vulnerability of Encrypted Messages: Decomposability of Discrete Logarithm Problems

ADD TO MY LIST
 
Author(s): Boris S. Verkhovsky

Journal: International Journal of Communications, Network and System Sciences
ISSN 1913-3715

Volume: 03;
Issue: 08;
Start page: 639;
Date: 2010;
Original page

Keywords: Network Vulnerability | System Security | Discrete Logarithm | Integer Factorization | Multi-Level Decomposition | Complexity Analysis

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.
Affiliate Program     

Tango Rapperswil
Tango Rapperswil