Entropy-based image encryption using Orthogonal Variable Spreading Factor (OVSF)

The purpose of image encryption is to provide data privacy and security. The former ensures that only authorized personnel can access the original content, while the latter implies that there is no evident relationship between the encrypted and the original content, and that the key space is equally...

Full description

Saved in:
Bibliographic Details
Published inIngeniería e investigación Vol. 40; no. 3; pp. 70 - 80
Main Authors Ballesteros, Dora M., Renza, Diego, Peña, Jimmy
Format Journal Article
LanguageEnglish
Portuguese
Published Bogota Universidad Nacional de Colombia 01.12.2020
Facultad de Ingeniería, Universidad Nacional de Colombia
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:The purpose of image encryption is to provide data privacy and security. The former ensures that only authorized personnel can access the original content, while the latter implies that there is no evident relationship between the encrypted and the original content, and that the key space is equally likely and large enough. In the current state of the field, there are several proposals of image encryption techniques with very high privacy (in terms of entropy) but weak in terms of security (i.e., small key space). Recently, a new encoding-based method that provides a long key space (namely 8,57 × 10506) with a middle value of entropy (87%) was proposed. Our proposal preserves the strength of the image encryption methods based on encoding, but with a higher value placed on security than the preliminary works. Every pixel of an image is mapped into an orthogonal code based on 256 bits. The 8-OVSF codes are selected to encode the image, given that the entropy of the inter-symbol is near the possible maximum. Numerous test results verify that our ciphered data have a very high value of entropy (98,5%) with an equally likely and long key space (8,57 × 10506), thus providing an adequate balance between privacy and security.
ISSN:0120-5609
2248-8723
2248-8723
DOI:10.15446/ing.investig.v40n3.81421