Potential Vulnerability of Encrypted Messages: Decomposability of Discrete Logarithm Problems  

作　　者：Boris S. Verkhovsky 

机构地区：[1]不详

出　　处：《International Journal of Communications, Network and System Sciences》2010年第8期639-644,共6页通讯、网络与系统学国际期刊（英文）

摘　　要：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.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.

关 键 词：Network VULNERABILITY System Security Discrete LOGARITHM INTEGER FACTORIZATION Multi-Level Decomposition Complexity Analysis 

分 类 号：O1[理学—数学]