Enhanced Security of Encrypted Text by KDMT: Key-Domain Maximization Technique
Nitin Uniyal1, Girish Dobhal2, Pradeep Semwal3
1Dr. Nitin Uniyal*, Department of Mathematics, UPES, Dehradun, India.
2Dr. GIRISH DOBHAL, Department of Mathematics, UPES, Dehradun, India.
3Mr. Pradeep Semwal, School of Computer Application and Information Technology, SGRR University, Dehradun, India.
Manuscript received on January 02, 2020. | Revised Manuscript received on January 15, 2020. | Manuscript published on January 30, 2020. | PP: 1385-1388 | Volume-8 Issue-5, January 2020. | Retrieval Number: E6326018520/2020©BEIESP | DOI: 10.35940/ijrte.E6326.018520
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Encryption-decryption techniques have been the backbone of network security in the modern era of wireless transmission of data. We present here a more secured encryption-decryption method based on the maximization of key domain in finite field. The proposed technique uses a random primary key to fetch the encryption-decryption key-pair furnished by a unique decomposition. A secondary key taken from a subdomain with specific property is used to add more randomness in the encrypted text structure. A probabilistic comparison of key prediction by hacker is also discussed to justify the added security in the proposed method.
Keywords: Decryption, Encryption, Isomorphism, Permutation.
Scope of the Article: Encryption methods and tools.