Title: Enhancing security in cryptographic algorithm based on LECCRS

Authors: K. Mani; A. Devi

Addresses: Department of Computer Science, Nehru Memorial College, Puthanampatti, Trichy, 621007, India ' Department of Computer Science, Lowry Memorial College, Bangalore, 560016, India

Abstract: The efficiency of any cryptographic algorithms depends on both security and operational speed. When a message is encrypted using any cryptosystems it produces only one level of security because it converts the plaintext into ciphertext where the ciphertext is not easily tractable. To increase the security in any cryptographic algorithm, normally the size of the plaintext and key should be taken very largely. Further, additional levels of security have been introduced in this paper to enhance the security. For that, the message to be encrypted is encoded first so that original form of the message is altered called the first level of security. The encoded message is sometimes too large so that it is compressed which results in changing the encoded form of message called second level security. Finally, the compressed message is encrypted using any one of the public-key cryptosystems by determining the block size dynamically which produces the third level of security. Thus, an integrated approach is proposed called encoded compressed cryptosystem in this paper.

Keywords: Lucas encoding; Fibonacci encoding; Huffman compression; RSA encryption.

DOI: 10.1504/EG.2017.083940

Electronic Government, an International Journal, 2017 Vol.13 No.1, pp.31 - 48

Received: 30 Mar 2016
Accepted: 01 Feb 2017

Published online: 21 Apr 2017 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article