|
Twitter
|
Facebook
|
Google+
|
VKontakte
|
LinkedIn
|
 
 
International Journal of Innovation and Scientific Research
ISSN: 2351-8014
 
 
Friday 29 March 2024

About IJISR

News

Submission

Downloads

Archives

Custom Search

Contact

  • Contact us
  • Newsletter:

Connect with IJISR

   
 
 
 

QR Verification System Using RSA Algorithm


Volume 10, Issue 2, October 2014, Pages 433–437

 QR Verification System Using RSA Algorithm

K. Naresh1 and Prathibha N. Pillai2

1 PG Student [CSP], Dept. of ECE, GVP College of Engineering (A), Visakhapatnam, Andhra Pradesh, India
2 Assistant Professor, Dept. of ECE, GVP College of Engineering (A), Visakhapatnam, Andhra Pradesh, India

Original language: English

Copyright © 2014 ISSR Journals. 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.

Abstract


Now a days, in data transmission security and authentication are the major challenges. To resolve these problems different techniques are used like cryptography, steganography etc. in the image steganography, we are using two images i.e., cover image and hidden image. The hidden image is sent by put it in the cover image. In the present techniques, only one key is used for both encryption and decryption. So, the users can see the data and also they can modify the content of the data. . Now we are using QR code which represents the hidden image and sent the QR code by encryption and decryption. We proposed a novel algorithm, in which the sender has two keys (public and private keys) and the user is provided with only one key (public key) by using RSA algorithm. Thus, the user can only see the data and he can't modify the data.

Author Keywords: RSA algorithm, RS code, QR code, Finite fields, steganography.


How to Cite this Article


K. Naresh and Prathibha N. Pillai, “QR Verification System Using RSA Algorithm,” International Journal of Innovation and Scientific Research, vol. 10, no. 2, pp. 433–437, October 2014.