Open Access   Article Go Back

Modified RSA Cryptosystem with Data Hiding Technique in the Terms of DNA Sequences

Harsh Sahay1

Section:Research Paper, Product Type: Journal Paper
Volume-7 , Issue-9 , Page no. 91-94, Sep-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7i9.9194

Online published on Sep 30, 2019

Copyright © Harsh Sahay . 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

XML View
PDF Download

How to Cite this Paper

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

IEEE Style Citation: Harsh Sahay, “Modified RSA Cryptosystem with Data Hiding Technique in the Terms of DNA Sequences,” International Journal of Computer Sciences and Engineering, Vol.7, Issue.9, pp.91-94, 2019.

MLA Style Citation: Harsh Sahay "Modified RSA Cryptosystem with Data Hiding Technique in the Terms of DNA Sequences." International Journal of Computer Sciences and Engineering 7.9 (2019): 91-94.

APA Style Citation: Harsh Sahay, (2019). Modified RSA Cryptosystem with Data Hiding Technique in the Terms of DNA Sequences. International Journal of Computer Sciences and Engineering, 7(9), 91-94.

BibTex Style Citation:
@article{Sahay_2019,
author = {Harsh Sahay},
title = {Modified RSA Cryptosystem with Data Hiding Technique in the Terms of DNA Sequences},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {9 2019},
volume = {7},
Issue = {9},
month = {9},
year = {2019},
issn = {2347-2693},
pages = {91-94},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=4856},
doi = {https://doi.org/10.26438/ijcse/v7i9.9194}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i9.9194}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=4856
TI - Modified RSA Cryptosystem with Data Hiding Technique in the Terms of DNA Sequences
T2 - International Journal of Computer Sciences and Engineering
AU - Harsh Sahay
PY - 2019
DA - 2019/09/30
PB - IJCSE, Indore, INDIA
SP - 91-94
IS - 9
VL - 7
SN - 2347-2693
ER -

VIEWS PDF XML
394 512 downloads 210 downloads
  
  
           

Abstract

RSA algorithm is an efficient algorithm for preventing unauthorized access over the network. But there are some drawbacks of RSA algorithm such as its high computational time. In this work we are reducing the computational time of RSA algorithm and increasing security of RSA algorithm. In this work we are modifying security of RSA algorithm by using three prime numbers instead of two as used in RSA algorithm. For reducing computational time of RSA algorithm to each character, multiple characters are merged together to form a merged unit. For merging each character cantor’s pairing algorithm has been used. The merged unit is now encrypted to the network. To the receiver side cipher text is received. After decryption, the merged data unit is received to the receiver side. After going to cantor’s unpairing algorithm individual characters of merged data unit are displayed to the receiver side .The highlight of this work is it increases efficacy of RSA cryptosystem. This modified work reduces computational time of RSA algorithm, even increases security of this algorithm. Even In this work we are hiding cipher text in the terms of DNA sequences. So that it is very difficult for intruders to get a real DNAsequence.

Key-Words / Index Term

DNA steganography, Cryptography, RSA, public, key, private key, pairing and unpairing algorithm

References

[1]. DNA based cryptographic technique for data hiding in DNA media Samiha Marwan, Ahmed Shawish, Khaled Nagaty.
[2]. Atul kahate, Cryptography and network security (TMH) RSA algorithm.
[3]. R. L. Rivest, A. Shamir, L. Adelman, “On Digital Signatures and Public Key Cryptosystems,” MI Laboratory for Computer Science Technical Memorandum 82, April 1977.
[4]. Vivek Choudhary1 and Mr. N. Praveen2 “Enhanced RSA Cryptosystem Based on Three Prime Numbers” 1 Post Graduate Scholar, Department of Computer Science & Engineering, SRM University, Chennai, Tamilnadu, India 2 Assistant Professor, Department of Computer Science & Engineering, SRM University, Chennai, Tamilnadu, India
[5]. An Elegant Pairing Function”, Matthew Szudzik, Wolfram Research, Inc. NKS 2006 Wolfram Science Conference