Article Sidebar

Download
PDF
Statistic
Read Counter : 350 Download : 129

Downloads

Download data is not yet available.

Main Article Content

Abstract

The principal goal of designing any encryption algorithm is to hide the original message and send the non-readable text message to the receiver so that secret message communication can take place over the web. The strength of an encryption algorithm depends on the difficulty of cracking the original message. A number of symmetric and asymmetric key encryption algorithms like DES, TRIPLE DES, AES, BLOWFISH, RSA has been developed to provide greater security affects one over the other. I have described a  protocol in this paper, which fits  the  technique  to realistic  communication  environments,  and  extend  the  security  and  the  range  of applications of the  technique. The basic motive behind the new approach is not to use a ‘key’. Encryption is done by the use of the logic operations amongst the bits of the code word. This can be said as "security through obscurity" where the shared secret is not an encryption key, but the encryption algorithm itself. This algorithm can prove to be an efficient method of encryption and can reduce the complexity of a system that encrypts or decrypts a message. Analysis has been done which shows the advantages and the limitations of this algorithm. With this new approach we are implementing a technique to enhance the security level and to further reduce the time for encryption and decryption.

Keywords

Cryptography Symmetric key cryptography Asymmetric key cryptography DES AES Triple DES Blowfish RSA DBNS and TBNS.

Article Details

Authors retain the copyright without restrictions for their published content in this journal. IJSRTM is a SHERPA ROMEO Journal. 

Publishing License

This is an open-access article distributed under the terms of  Creative Commons License

How to Cite
Chowdhury, A. (2015). A NEW TECHNIQUE TO ENCRYPT A CODE WORD. Students’ Research in Technology & Management, 1(5), 516-527. Retrieved from https://giapjournals.com/ijsrtm/article/view/95

References

  1. O.P Verma, Ritu Agarwal, Dhiraj Dafouti and Shobha Tyagi, “Performance Analysis of Data
  2. Encryption Algorithms”, IEEE Delhi Technological University India, 2011.
  3. Diaa Salama, Abdul. Elminaam, Hatem Mohamed, Abdul Kader and Mohie Mohamed
  4. Hadhoud, “Performance Evaluation of Symmetric Encryption Algorithms”, International
  5. Journal of Computer Science and Network Security, vol.8 No.12, December 2008.
  6. Ketu File white papers, “Symmetric vs. Asymmetric Encryption”, a division of Midwest
  7. Research Corporation.
  8. “Data Encryption Standard,” Federal Information Processing Standards Publication No. 46,
  9. National Bureau of Standards, January 15, 1977.
  10. Tingyuan Nie and Teng Zhang, “A Study of DES and Blowfish Encryption Algorithm”,
  11. IEEE, 2009.
  12. Aamer Nadeem and Dr M. Younus Javed, “A Performance Comparison of Data Encryption
  13. Algorithms”, IEEE, 2005.
  14. Vishwa Gupta, “International Journal of Advanced Research in Computer Science and
  15. Software Engineering”, Vol. 2, Issue 1, January 2012, pp. 1-3.
  16. Dripto Chatterjee, Joyshree Nath, Suvadeep Dasgupta, Asoke Nath “A new Symmetric key
  17. Cryptography Algorithm using extended MSA method: DJSA symmetric key algorithm”
  18. published in 2011 International Conference on Communication Systems and Network
  19. Technologies, 978-0-7695-4437-3/11.
  20. Symmetric key cryptography using random key generator, A. Nath, S. Ghosh, M. A. Mallik,
  21. Proceedings of International conference on SAM-2010 held at Las Vegas (USA) 12-15 July,
  22. , Vol-2, P-239-244.