期刊
COMPUTER STANDARDS & INTERFACES
卷 31, 期 6, 页码 1069-1072出版社
ELSEVIER
DOI: 10.1016/j.csi.2008.09.037
关键词
Prime modulo; Base value; Discrete logarithm; ASCII; UNICODE
This paper proposes a novel scheme where the key k is generated as discrete logarithm of indices involving prime modulus p and any base value q. This base value q is an element of Z(p). The Discrete logarithm values are substituted for k in the encryption equation. During decryption the corresponding k's are used to recover the plaintext. The sender embeds the p, q values along with the encrypted message and transmits it. This obviates the need for sending the full-length key along with the encrypted message. The proposed method ensures higher security in the transmission. The strength of the method lies in the difficulty of guessing p, q values, the entire key need not be transmitted and the full set of ASCII values of the Z(256) plane figure in the encryption process. The paper also discusses the difficulty of attempting brute force technique to discover p, q values. As an extension of this work. the authors are exploring the possibility of using the full set of UNICODE values instead of the restricted 8-bit ASCII set. (C) 2008 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据