Loading…

Concurrent encryption and lossless compression using inversion ranks

For secure and efficient transmission or storage, data files are commonly compressed and encrypted. In this work, we introduce a cost-effective encryption method of files as a built-in component of a lossless compression algorithm, thus avoiding the added cost of employing two separate processes. We...

Full description

Saved in:
Bibliographic Details
Published in:Journal of information security and applications 2023-11, Vol.78, p.103587, Article 103587
Main Authors: Koc, Basar, Arnavut, Ziya, Koçak, Hüseyin
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c251t-47a82b7667f3870b7b78ab634507b86706457d33d512edbc338c32df4970af313
container_end_page
container_issue
container_start_page 103587
container_title Journal of information security and applications
container_volume 78
creator Koc, Basar
Arnavut, Ziya
Koçak, Hüseyin
description For secure and efficient transmission or storage, data files are commonly compressed and encrypted. In this work, we introduce a cost-effective encryption method of files as a built-in component of a lossless compression algorithm, thus avoiding the added cost of employing two separate processes. We have shown in earlier studies that preprocessing data with Burrows–Wheeler Transformation followed by Inversion Ranking transformation in advance of the utilization of an entropy coder resulted in an extremely effective general-purpose lossless compression technique. In our proposed algorithm, we isolate the inversion frequency vector obtained from the Inversion Ranking transformation and transmit the compressed file. Since the inversion frequency vector is necessary for decompression, we use it as our secret key and transmit it over a secure channel. Compared to the size of a data file, its frequency vector is rather small. Thus, encrypting only the inversion frequency vector, instead of the entire compressed file, results in substantial savings in computational cost. We demonstrate that the proposed technique is effective and resistant to common attacks on image and audio data sets. [Display omitted] •BWIC is an effective general-purpose lossless data compression algorithm.•Each input data set generates its unique inversion frequency vector, thus a unique secret key.•Our proposed technique does not negatively affect compression efficiency.•Compared to the size of a data file, its frequency vector is rather small.•Resistance of our algorithm to common attacks is demonstrated on image and audio data sets.
doi_str_mv 10.1016/j.jisa.2023.103587
format article
fullrecord <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1016_j_jisa_2023_103587</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S2214212623001710</els_id><sourcerecordid>S2214212623001710</sourcerecordid><originalsourceid>FETCH-LOGICAL-c251t-47a82b7667f3870b7b78ab634507b86706457d33d512edbc338c32df4970af313</originalsourceid><addsrcrecordid>eNp9j7tOwzAUhj2ARFX6Akx5gQT7OL5UYkHhKlVigdlybAc5pE5kp5X69jiUudO56Tv6P4TuCK4IJvy-r3qfdAUYaF5QJsUVWgGQugQC_AZtUuoxxgTIlgFdoadmDOYQowtz4YKJp2n2Yyh0sMUwpjS4lAoz7qeYm-VwSD58Fz4cXfybow4_6RZdd3pIbvNf1-jr5fmzeSt3H6_vzeOuNMDIXNZCS2gF56KjUuBWtELqltOaYdFKLjCvmbCUWkbA2dZQKg0F29VbgXVHCV0jOP81MWeLrlNT9HsdT4pgteirXi36atFXZ_0MPZwhl5MdvYsqGZ9VnfXRmVnZ0V_CfwEoVWW8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Concurrent encryption and lossless compression using inversion ranks</title><source>ScienceDirect Freedom Collection 2022-2024</source><creator>Koc, Basar ; Arnavut, Ziya ; Koçak, Hüseyin</creator><creatorcontrib>Koc, Basar ; Arnavut, Ziya ; Koçak, Hüseyin</creatorcontrib><description>For secure and efficient transmission or storage, data files are commonly compressed and encrypted. In this work, we introduce a cost-effective encryption method of files as a built-in component of a lossless compression algorithm, thus avoiding the added cost of employing two separate processes. We have shown in earlier studies that preprocessing data with Burrows–Wheeler Transformation followed by Inversion Ranking transformation in advance of the utilization of an entropy coder resulted in an extremely effective general-purpose lossless compression technique. In our proposed algorithm, we isolate the inversion frequency vector obtained from the Inversion Ranking transformation and transmit the compressed file. Since the inversion frequency vector is necessary for decompression, we use it as our secret key and transmit it over a secure channel. Compared to the size of a data file, its frequency vector is rather small. Thus, encrypting only the inversion frequency vector, instead of the entire compressed file, results in substantial savings in computational cost. We demonstrate that the proposed technique is effective and resistant to common attacks on image and audio data sets. [Display omitted] •BWIC is an effective general-purpose lossless data compression algorithm.•Each input data set generates its unique inversion frequency vector, thus a unique secret key.•Our proposed technique does not negatively affect compression efficiency.•Compared to the size of a data file, its frequency vector is rather small.•Resistance of our algorithm to common attacks is demonstrated on image and audio data sets.</description><identifier>ISSN: 2214-2126</identifier><identifier>DOI: 10.1016/j.jisa.2023.103587</identifier><language>eng</language><publisher>Elsevier Ltd</publisher><subject>Burrows–Wheeler transformation ; Data security ; Inversion ranking ; Lossless data compression ; Multimedia security</subject><ispartof>Journal of information security and applications, 2023-11, Vol.78, p.103587, Article 103587</ispartof><rights>2023 Elsevier Ltd</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c251t-47a82b7667f3870b7b78ab634507b86706457d33d512edbc338c32df4970af313</cites><orcidid>0000-0001-6307-833X ; 0000-0002-4766-1944</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Koc, Basar</creatorcontrib><creatorcontrib>Arnavut, Ziya</creatorcontrib><creatorcontrib>Koçak, Hüseyin</creatorcontrib><title>Concurrent encryption and lossless compression using inversion ranks</title><title>Journal of information security and applications</title><description>For secure and efficient transmission or storage, data files are commonly compressed and encrypted. In this work, we introduce a cost-effective encryption method of files as a built-in component of a lossless compression algorithm, thus avoiding the added cost of employing two separate processes. We have shown in earlier studies that preprocessing data with Burrows–Wheeler Transformation followed by Inversion Ranking transformation in advance of the utilization of an entropy coder resulted in an extremely effective general-purpose lossless compression technique. In our proposed algorithm, we isolate the inversion frequency vector obtained from the Inversion Ranking transformation and transmit the compressed file. Since the inversion frequency vector is necessary for decompression, we use it as our secret key and transmit it over a secure channel. Compared to the size of a data file, its frequency vector is rather small. Thus, encrypting only the inversion frequency vector, instead of the entire compressed file, results in substantial savings in computational cost. We demonstrate that the proposed technique is effective and resistant to common attacks on image and audio data sets. [Display omitted] •BWIC is an effective general-purpose lossless data compression algorithm.•Each input data set generates its unique inversion frequency vector, thus a unique secret key.•Our proposed technique does not negatively affect compression efficiency.•Compared to the size of a data file, its frequency vector is rather small.•Resistance of our algorithm to common attacks is demonstrated on image and audio data sets.</description><subject>Burrows–Wheeler transformation</subject><subject>Data security</subject><subject>Inversion ranking</subject><subject>Lossless data compression</subject><subject>Multimedia security</subject><issn>2214-2126</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNp9j7tOwzAUhj2ARFX6Akx5gQT7OL5UYkHhKlVigdlybAc5pE5kp5X69jiUudO56Tv6P4TuCK4IJvy-r3qfdAUYaF5QJsUVWgGQugQC_AZtUuoxxgTIlgFdoadmDOYQowtz4YKJp2n2Yyh0sMUwpjS4lAoz7qeYm-VwSD58Fz4cXfybow4_6RZdd3pIbvNf1-jr5fmzeSt3H6_vzeOuNMDIXNZCS2gF56KjUuBWtELqltOaYdFKLjCvmbCUWkbA2dZQKg0F29VbgXVHCV0jOP81MWeLrlNT9HsdT4pgteirXi36atFXZ_0MPZwhl5MdvYsqGZ9VnfXRmVnZ0V_CfwEoVWW8</recordid><startdate>202311</startdate><enddate>202311</enddate><creator>Koc, Basar</creator><creator>Arnavut, Ziya</creator><creator>Koçak, Hüseyin</creator><general>Elsevier Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-6307-833X</orcidid><orcidid>https://orcid.org/0000-0002-4766-1944</orcidid></search><sort><creationdate>202311</creationdate><title>Concurrent encryption and lossless compression using inversion ranks</title><author>Koc, Basar ; Arnavut, Ziya ; Koçak, Hüseyin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c251t-47a82b7667f3870b7b78ab634507b86706457d33d512edbc338c32df4970af313</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Burrows–Wheeler transformation</topic><topic>Data security</topic><topic>Inversion ranking</topic><topic>Lossless data compression</topic><topic>Multimedia security</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Koc, Basar</creatorcontrib><creatorcontrib>Arnavut, Ziya</creatorcontrib><creatorcontrib>Koçak, Hüseyin</creatorcontrib><collection>CrossRef</collection><jtitle>Journal of information security and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Koc, Basar</au><au>Arnavut, Ziya</au><au>Koçak, Hüseyin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Concurrent encryption and lossless compression using inversion ranks</atitle><jtitle>Journal of information security and applications</jtitle><date>2023-11</date><risdate>2023</risdate><volume>78</volume><spage>103587</spage><pages>103587-</pages><artnum>103587</artnum><issn>2214-2126</issn><abstract>For secure and efficient transmission or storage, data files are commonly compressed and encrypted. In this work, we introduce a cost-effective encryption method of files as a built-in component of a lossless compression algorithm, thus avoiding the added cost of employing two separate processes. We have shown in earlier studies that preprocessing data with Burrows–Wheeler Transformation followed by Inversion Ranking transformation in advance of the utilization of an entropy coder resulted in an extremely effective general-purpose lossless compression technique. In our proposed algorithm, we isolate the inversion frequency vector obtained from the Inversion Ranking transformation and transmit the compressed file. Since the inversion frequency vector is necessary for decompression, we use it as our secret key and transmit it over a secure channel. Compared to the size of a data file, its frequency vector is rather small. Thus, encrypting only the inversion frequency vector, instead of the entire compressed file, results in substantial savings in computational cost. We demonstrate that the proposed technique is effective and resistant to common attacks on image and audio data sets. [Display omitted] •BWIC is an effective general-purpose lossless data compression algorithm.•Each input data set generates its unique inversion frequency vector, thus a unique secret key.•Our proposed technique does not negatively affect compression efficiency.•Compared to the size of a data file, its frequency vector is rather small.•Resistance of our algorithm to common attacks is demonstrated on image and audio data sets.</abstract><pub>Elsevier Ltd</pub><doi>10.1016/j.jisa.2023.103587</doi><orcidid>https://orcid.org/0000-0001-6307-833X</orcidid><orcidid>https://orcid.org/0000-0002-4766-1944</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 2214-2126
ispartof Journal of information security and applications, 2023-11, Vol.78, p.103587, Article 103587
issn 2214-2126
language eng
recordid cdi_crossref_primary_10_1016_j_jisa_2023_103587
source ScienceDirect Freedom Collection 2022-2024
subjects Burrows–Wheeler transformation
Data security
Inversion ranking
Lossless data compression
Multimedia security
title Concurrent encryption and lossless compression using inversion ranks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T16%3A49%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Concurrent%20encryption%20and%20lossless%20compression%20using%20inversion%20ranks&rft.jtitle=Journal%20of%20information%20security%20and%20applications&rft.au=Koc,%20Basar&rft.date=2023-11&rft.volume=78&rft.spage=103587&rft.pages=103587-&rft.artnum=103587&rft.issn=2214-2126&rft_id=info:doi/10.1016/j.jisa.2023.103587&rft_dat=%3Celsevier_cross%3ES2214212623001710%3C/elsevier_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c251t-47a82b7667f3870b7b78ab634507b86706457d33d512edbc338c32df4970af313%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true