Enhancing security in cryptographic algorithm based on LECCRS Online publication date: Wed, 26-Apr-2017
by K. Mani; A. Devi
Electronic Government, an International Journal (EG), Vol. 13, No. 1, 2017
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the Electronic Government, an International Journal (EG):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook