Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Message steganography using separate locations and blocks

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 14 No. 4 (2024)

DOI
10.11591/ijece.v14i4.pp4055-4067
ISSN
2722-2578, 2088-8708
Published
2024-08-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

A novel method of message steganography is introduced to solve the disadvantages of traditional least significant bit (LSB) based methods by dividing the covering-stego image into a secret number of blocks. A chaotic logistic map model was performed using the chaotic parameters and the number of image blocks for generating a chaotic key. This key was then sorted, and the locations of blocks 1 to 8 were used to select the required blocks to be used as covering-stego blocks. The introduced method simplifies the process of message bits hiding and extracting by adopting a batch method of bits hiding and extracting. A comparative analysis was conducted between the outcomes of proposed method and those of prevalent approaches to outline the enhancements in both speed and quality of message steganography.

Collaboration network of the authors

11 authors · 19 co-authorship links · 6 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Al-Balqa Applied University
  • Taibah University
  • Al-Ahliyya Amman University
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Bilal ZahranAl-Balqa Applied University3
Yousef KhaleelTaibah University2
Anmar AbuhamdahTaibah University2
Bassam Naji Al-TamimiTaibah University2
Aws Al-QaisiAl-Balqa Applied University1
Saleh A. KhawatrehAl-Ahliyya Amman University1
Ahmad A. SharadqahAl-Balqa Applied University1
Mohammad S. KhrisatAl-Balqa Applied University1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Message steganography using separate locations and blocks</dc:title><dc:creator>Rasras, Rashad J.</dc:creator><dc:creator>Abu Sara, Mutaz Rasmi</dc:creator><dc:creator>Alqadi, Ziad</dc:creator><dc:description>&lt;jats:p&gt;A novel method of message steganography is introduced to solve the disadvantages of traditional least significant bit (LSB) based methods by dividing the covering-stego image into a secret number of blocks. A chaotic logistic map model was performed using the chaotic parameters and the number of image blocks for generating a chaotic key. This key was then sorted, and the locations of blocks 1 to 8 were used to select the required blocks to be used as covering-stego blocks. The introduced method simplifies the process of message bits hiding and extracting by adopting a batch method of bits hiding and extracting. A comparative analysis was conducted between the outcomes of proposed method and those of prevalent approaches to outline the enhancements in both speed and quality of message steganography.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2024-08-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v14i4.pp4055-4067</dc:identifier><dc:identifier>10.11591/ijece.v14i4.pp4055-4067</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 14 No 4 (2024); 4055</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>https://ijece.iaescore.com/index.php/IJECE/article/viewFile/34777/17592</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>