Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/1500
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kumar, J | - |
dc.contributor.author | Singh, P | - |
dc.contributor.author | Yadav, AK | - |
dc.date.accessioned | 2024-05-14T10:20:16Z | - |
dc.date.available | 2024-05-14T10:20:16Z | - |
dc.date.issued | 2022 | - |
dc.identifier.uri | http://hdl.handle.net/123456789/1500 | - |
dc.description.abstract | Twin decomposition, consisting of equal and random modulus decompositions, not only makes a cryptosystem asymmetric but also resists special attack. A new double-image asymmetric crypto system using twin decomposition in fractional Hartley domain is proposed. An input grayscale image, bonded with another grayscale image as its phase mask, is transformed via fractional Hartley transform. Equal modulus decomposition is applied on the resulting image, giving us two inter mediate images. One of them is subjected to another fractional Hartley transform followed by ran dom modulus decomposition, whereas the other serves as the first private key. The application of random modulus decomposition also results in two images: encrypted image and the second private key. During the process of decryption, firstly the encrypted image is combined with second private key and thereafter it is subjected to inverse fractional Hartley transform. The resulting image is then combined with the first private key, and followed by another inverse fractional Hartley trans form, thus recovering the two original images. The proposed cryptosystem is validated for pairs of grayscale images. | en_US |
dc.language.iso | en | en_US |
dc.title | Asymmetric double-image encryption using twin decomposition in fractional Hartley domain | en_US |
Appears in Collections: | School of Engineering & Technology |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
optappl_5201p21.pdf | 1.83 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.