Please use this identifier to cite or link to this item:
http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/9940
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Verma, Salil | - |
dc.contributor.author | Sahil | - |
dc.contributor.author | Dhiman, Pankaj [Guided by] | - |
dc.date.accessioned | 2023-09-12T13:07:47Z | - |
dc.date.available | 2023-09-12T13:07:47Z | - |
dc.date.issued | 2023 | - |
dc.identifier.uri | http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/9940 | - |
dc.description | Enrolment No. 191514,191443 | en_US |
dc.description.abstract | In today's world, secure online data transmission takes precedence over other activities. Various algorithms exist to provide the computational difficulty that makes cracking the key to identify a unique message difficult. Many researchers have applied various cryptographic algorithms for secure data transmission, and various hybrid cryptographic algorithms have been proposed to improve the level of information security. Key management plays an important role in implementing cryptographic algorithms. For this reason, we applied image encryption technology that uses a random image as a key. I used a random image as a key and encrypted another image as information using the RSA algorithm. The proposed method is compared with conventional approaches and concludes that encryption algorithms implemented using images as keys offer more security in terms of encryption and decryption times. | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | Jaypee University of Information Technology, Solan, H.P. | en_US |
dc.subject | Encryption | en_US |
dc.subject | Decryption | en_US |
dc.subject | Cryptography | en_US |
dc.title | Image Encryption using RSA | en_US |
dc.type | Project Report | en_US |
Appears in Collections: | B.Tech. Project Reports |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Image Encryption using RSA.pdf | 5.79 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.