Open Access   Article Go Back

A New Bit Level Positional Encryption Algorithm (NBLPEA ver-1)

Asoke Nath1 , Sankar Das2 , Oishi Mazumder3 , Adrija Saha4 , Monimoy Ghosh5

  1. Department of Computer Science, St. Xavier’s College (Autonomous), Kolkata, India.
  2. Department of Computer Science, St. Xavier’s College (Autonomous), Kolkata, India.
  3. Department of Computer Science, St. Xavier’s College (Autonomous), Kolkata, India.
  4. Department of Computer Science, St. Xavier’s College (Autonomous), Kolkata, India.
  5. Department of Computer Science, St. Xavier’s College (Autonomous), Kolkata, India.

Section:Research Paper, Product Type: Journal Paper
Volume-8 , Issue-4 , Page no. 167-172, Apr-2020

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v8i4.167172

Online published on Apr 30, 2020

Copyright © Asoke Nath, Sankar Das, Oishi Mazumder, Adrija Saha, Monimoy Ghosh . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Asoke Nath, Sankar Das, Oishi Mazumder, Adrija Saha, Monimoy Ghosh, “A New Bit Level Positional Encryption Algorithm (NBLPEA ver-1),” International Journal of Computer Sciences and Engineering, Vol.8, Issue.4, pp.167-172, 2020.

MLA Style Citation: Asoke Nath, Sankar Das, Oishi Mazumder, Adrija Saha, Monimoy Ghosh "A New Bit Level Positional Encryption Algorithm (NBLPEA ver-1)." International Journal of Computer Sciences and Engineering 8.4 (2020): 167-172.

APA Style Citation: Asoke Nath, Sankar Das, Oishi Mazumder, Adrija Saha, Monimoy Ghosh, (2020). A New Bit Level Positional Encryption Algorithm (NBLPEA ver-1). International Journal of Computer Sciences and Engineering, 8(4), 167-172.

BibTex Style Citation:
@article{Nath_2020,
author = {Asoke Nath, Sankar Das, Oishi Mazumder, Adrija Saha, Monimoy Ghosh},
title = {A New Bit Level Positional Encryption Algorithm (NBLPEA ver-1)},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {4 2020},
volume = {8},
Issue = {4},
month = {4},
year = {2020},
issn = {2347-2693},
pages = {167-172},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=5099},
doi = {https://doi.org/10.26438/ijcse/v8i4.167172}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v8i4.167172}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=5099
TI - A New Bit Level Positional Encryption Algorithm (NBLPEA ver-1)
T2 - International Journal of Computer Sciences and Engineering
AU - Asoke Nath, Sankar Das, Oishi Mazumder, Adrija Saha, Monimoy Ghosh
PY - 2020
DA - 2020/04/30
PB - IJCSE, Indore, INDIA
SP - 167-172
IS - 4
VL - 8
SN - 2347-2693
ER -

VIEWS PDF XML
231 334 downloads 139 downloads
  
  
           

Abstract

In the world of information we live in, cyber security is of paramount importance. Despite communicating through secure channels, there might be breaches that might be targeted by attackers to extract valuable data. Designing and betterment of these symmetric and asymmetric algorithms remain an open challenge to all. The Bitwise Positional Encryption Algorithm is a completely new idea in this field. This simple encryption technique provides strong protection against any kind of attack, be it brute force or statistical attacks. This multilevel encryption algorithm employs several bit-level encryption procedures and matrix transposition operations. It takes into consideration positional parameters of bits, which is further shuffled randomly and hence is impossible for the intruder to decrypt without knowing the key as well as the exact method. The key here should be a shared parameter, for this is an instance of symmetric encryption. The algorithm works on bit-level so it is not possible to break easily. By this algorithm, one can encrypt any kind of file with extensions like .txt, .doc, .jpg, .png and the like. The present method can be used for encryption of any confidential messages like OTP (One Time Password), ATM transactions etc. It is not possible to get back the original plain text file if there is one change in bits in encrypted text. The testing is done on almost all types of files and it was found that the method is working satisfactorily.

Key-Words / Index Term

Plain text, ciphertext, encryption, decryption, key, transposition, positional extraction.

References

[1] William Stallings, “Cryptography and Network Security: Principles and Practice”, Tata Mc-Graw Hill Publishing LTD.
[2] Behrouz A. Forouzan, “Cryptography and Network Security”, Special Indian edition 2007, Tata Mc-Graw Hill Publishing LTD.
[3] Ronald A. Gove, “Introduction to Encryption Technology.”
[4] Dan Boneh, Victor Shoup, “A Graduate Course in Applied Cryptography.” from Stanford University.
[5] Sachin Sharma, Jeevan Singh Bisht, “Performance Analysis of Data Encryption Algorithms”, Volume-3, Issue-1, pp. 1-5, 2015.
[6] M. Arora, S. Sharma, “Synthesis of Cryptography and Security Attacks”, Volume-5, Issue-5, Oct 2017.
[7] Sreeparna Chakrabarti, Dr. G.N.K. Suresh Babu, “A Literature Survey on the Cryptographic Encryption Algorithms for Secured Data Communication.” in International Journal on Future Revolution in Computer Science & Communication Engineering Volume: 4 Issue: 10.
[8] Asoke Nath, Soumyadip Ray, Salil Anthony Dhara, Sourav Hazra, “3-Dimensional Bit Level Encryption Algorithm Version-3 (3DBLEA-3)”, International Journal of Latest Trends in Engineering and Technology Vol.(10)Issue(2), pp.347-353
[9] Bit Level Encryption Standard(BLES) : Version-I, Neeraj Khanna, Dripto Chatterjee, Joyshree Nath and Asoke Nath, International Journal of Computer Applications(IJCA)(0975-8887) USA Volume 52-No.2.,Aug, Page.41-46(2012).
[10] Multi Way Feedback Encryption Standard Ver1, Purnendu Mukherjee, Prabal Banerjee, Asoke Nath, IJACR, published in September 2013 issue.