CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Four Way Encryption Method for Secure Message Coding by use of CBC, Merkle-Hellman, Randomizers and Discrete Logarithmics

by B. Padhmavathi, Arghya Ray, Alisha Anjum
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 67 - Number 4
Year of Publication: 2013
Authors: B. Padhmavathi, Arghya Ray, Alisha Anjum
10.5120/11385-6664

B. Padhmavathi, Arghya Ray, Alisha Anjum . Four Way Encryption Method for Secure Message Coding by use of CBC, Merkle-Hellman, Randomizers and Discrete Logarithmics. International Journal of Computer Applications. 67, 4 ( April 2013), 27-32. DOI=10.5120/11385-6664

@article{ 10.5120/11385-6664,
author = { B. Padhmavathi, Arghya Ray, Alisha Anjum },
title = { Four Way Encryption Method for Secure Message Coding by use of CBC, Merkle-Hellman, Randomizers and Discrete Logarithmics },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 67 },
number = { 4 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 27-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume67/number4/11385-6664/ },
doi = { 10.5120/11385-6664 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:23:47.972213+05:30
%A B. Padhmavathi
%A Arghya Ray
%A Alisha Anjum
%T Four Way Encryption Method for Secure Message Coding by use of CBC, Merkle-Hellman, Randomizers and Discrete Logarithmics
%J International Journal of Computer Applications
%@ 0975-8887
%V 67
%N 4
%P 27-32
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The Cipher Block Chaining (CBC) and the Merkle-Hellman algorithm are two different cryptosystems for encrypting messages. But using these cryptosystems separately has many drawbacks. However there are several ways of getting rid of these drawbacks. This paper demonstrates how to use the combination of both the cryptographic algorithms along with randomized vectors, keys and super-increasing sequence to encrypt messages. The encrypted message is stored in secret buffers and these positions are encrypted by use of discrete logarithmics and sent. This not only strengthens the encrypted message but also makes the transmission more secure, so that only the intended recipient of the message is able to decipher the message. This paper focuses on enhancing the confidentiality of the message transfer.

References
  1. B. Padhmavathi, Arghya Ray, Alisha Anjum, Santhoshi Bhat,"Improvement of CBC Encryption Technique by using the Merkle - Hellman Knapsack Cryptosystem", IEEE Madras sponsored ISCO 2013
  2. Ashish Agarwal ,"Encrypting Messages using the Merkle Hellman Knapsack Cryptosystem", IJCSNS International Journal of Computer Science and Network Security, VOL. 11 No. 5, May 2011
  3. A. Menezes, P. vanOorschot and S. Vanstone, "Handbook of Applied Cryptography", CRC Press, 1996
  4. R. Merkle and M. Hellman, "Hiding information and signatures in trapdoor knapsacks", IEEE Transactions on Information Theory – 24, 5, pp 525 – 530.
  5. W. Diffie and M. Hellman, "New directions in cryptography", IEEE Transactions on Information Theory – 22, 6, pp 644 – 654.
  6. http://www. mast. queensu. ca/~math418/m418oh/m418oh04. pdf
  7. http://mathworld. wolfram. com/SubsetSumProblem. html
  8. William Stallings," Cryptography and Network Security", fifth edition,pg-225-227.
Index Terms

Computer Science
Information Sciences

Keywords

Security cryptography cryptosystem blocks cipher cipher block chaining discrete logarithmics knapsack problem randomizers superincreasing vector

Powered by PhDFocusTM