Hiding scrambled text messages in speech signals using a lightweight hyperchaotic map and conditional LSB mechanism

This study presents a lightweight, secure audio steganography system for hiding text messages for transmission over the Internet, with the aim of addressing the current problems of high computational cost and insufficient security identified in earlier studies. We propose a two-phase functioning mec...

Full description

Saved in:
Bibliographic Details
Published in:PloS one Vol. 19; no. 1; p. e0296469
Main Authors: Al Sibahee, Mustafa A., Abduljabbar, Zaid Ameen, Luo, Chengwen, Zhang, Jin, Huang, Yijing, Abduljaleel, Iman Qays, Ma, Junchao, Nyangaresi, Vincent Omollo
Format: Journal Article
Language:English
Published: United States Public Library of Science 03.01.2024
Public Library of Science (PLoS)
Subjects:
Access control
Algorithms
Analysis
Communication
Complexity
Computational efficiency
Computer and Information Sciences
Computer applications
Computer Security
Computing costs
Confidentiality
Cybersecurity
Data encryption
Dyslexia
Engineering and Technology
Evaluation
Humans
Innovations
Lightweight
Messages
Methods
Network security
Physical Sciences
Research and Analysis Methods
Scrambling (communication)
Social Sciences
Speech
Steganography
Technology application
Text Messaging
Vectors
Weight reduction
Iraq
ISSN:1932-6203, 1932-6203
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This study presents a lightweight, secure audio steganography system for hiding text messages for transmission over the Internet, with the aim of addressing the current problems of high computational cost and insufficient security identified in earlier studies. We propose a two-phase functioning mechanism. Text characters are first transformed into ASCII code and stored in a vector, which is then divided into three sub-vectors. These sub-vectors are scrambled using two low-complexity operations, namely a forward-backward reading technique and an odd-even index. Two scrambling loops are performed, the first on the small sub-vectors the second on the vector as a whole. In the hiding phase, the speech signal samples are divided into 256 blocks using only 200 values per block, and low-complexity quadratic and the Hénon maps are used to hide the speech signal in a random manner. The conditional LSB is applied as a low-complexity algorithm to identify hidden bits, and a special hyperchaotic map algorithm is developed to randomly choose locations. The proposed approach provides good security for a scrambled text message, with high SNR and PSNR, small MSE and PESQ, a SSIM value of close to one (As indicated in Tables 1, 2, 3, and 4), a BER value of close to zero (as shown in table 8), NCC value near +1 (as shown in table 8), and an MOS value of near five (as described in table 6), as well as a low computational hiding cost.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
Competing Interests: The authors have declared that no competing interests exist.
ISSN:1932-6203
1932-6203
DOI:10.1371/journal.pone.0296469