Speech Encryption Technique using S - box based on Multi Chaotic Maps

Abdullah, Sarah Mohammed; Abduljaleel, Iman Qays

doi:10.18421/tem103-54

Cited by 12 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The quadratic map is expressed as shown in Eq 1 below [ 46 ]: where n is the number of iterations and u is the additive element of chaos, when ∂ ∈ [0, 2], Q ∈ [0, 1] in which the chaotic is realized when ∂ ∈ [1.5, 2] [ 46 ].…”

Section: Section 3: Methodologymentioning

confidence: 99%

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

Al Sibahee,

Abduljabbar,

Luo

et al. 2024

PLoS ONE

View full text Add to dashboard Cite

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.

show abstract

Section: Section 3: Methodologymentioning

confidence: 99%

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

Al Sibahee,

Abduljabbar,

Luo

et al. 2024

PLoS ONE

View full text Add to dashboard Cite

show abstract

“…A DNA molecule comprises four nucleotides: A, T, C, and G. There is a complementary relationship between these nucleotides; if the value '00' is assigned to A, then the value '11' should be assigned to T. Likewise, if the value '01' is assigned to C, then the value '10' should be assigned to G. Thus, there are 24 types of DNA coding rules, but only eight of them meet the complementary relationship [12]. As shown in Table 1, there are eight rules for encoding and decoding the binary sequence.…”

Section: Dna Encodingmentioning

confidence: 99%

An Efficient Color-Image Encryption Method Using DNA Sequence and Chaos Cipher

Shraida¹,

Younis²,

Al-Amiedy³

et al. 2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Nowadays, high-resolution images pose several challenges in the context of image encryption. The encryption of huge images' file sizes requires high computational resources. Traditional encryption techniques like, Data Encryption Standard (DES), and Advanced Encryption Standard (AES) are not only inefficient, but also less secure. Due to characteristics of chaos theory, such as periodicity, sensitivity to initial conditions and control parameters, and unpredictability. Hence, the characteristics of deoxyribonucleic acid (DNA), such as vast parallelism and large storage capacity, make it a promising field. This paper presents an efficient color image encryption method utilizing DNA encoding with two types of hyper-chaotic maps. The proposed encryption method comprises three steps. The first step initializes the conditions for generating Lorenz and Rossler hyper-chaotic maps using a plain image Secure Hash Algorithm (SHA-256/384). The second step performs a confusion procedure by scrambling the three components of the image (red, green, and blue) using Lorenz hyper-chaotic sequences. Finally, the third step combines three approaches to encrypt the scrambled components for diffusion: DNA encoding/decoding, addition operation between components, and XORing with Rossler hyper-chaotic sequences. The simulation results indicate that the suggested encryption algorithm satisfies the requirements of security. The entropy value of confusion and diffusion is 7.997, the key space is 2 200 , and the correlation coefficient is nearly zero. The efficacy of the proposed method has been verified through numerous evaluations, and the results show its resistance and effectiveness against several attacks, like statistical and brute-force attacks. Finally, the devised algorithm vanquishes other relevant color image encryption algorithms.

show abstract

“…Cryptography involves using codes and ciphers to safeguard data and information from unauthorized access [1]. The encryption process transforms plain text into a form that only the intended recipient can understand.…”

Section: Introductionmentioning

confidence: 99%

Designing a Graphical Domain-Specific Modeling Language for Efficient Block Cipher Configuration: BCLang

Qassir,

Gaata,

Sadiq

et al. 2023

TEM Journal

View full text Add to dashboard Cite

Block cipher (BC) is a type of symmetric cipher used to encrypt data. Despite its advantages, it faces a substantial challenge. Writing the script code for the BC scheme accurately using General-Purpose Programming Languages (GPPLs) poses a significant challenge for programmers. The aim of this paper is to present the first graphical domain-specific modeling language (DSML) for designing and implementing BC algorithms, called BCLang. It is an extension to our previous DSML that was developed for Stream cipher. Programming efficiency and expressiveness were increased by reducing grammar and runtime errors and providing a high level of abstraction. BCLang provides the fundamental components of the BC three structures, which enable the programmer to design and implement BC algorithms in a graphical manner. Two keystream generation methods, performance analysis, and tests of the National Institute of Standards and Technology (NIST) for randomness analysis were provided. The presented language was evaluated based on five subjective metrics specific to graphical DSML evaluation. The design, evaluation details, and properties are explained in depth in this paper.

show abstract

Speech Encryption Technique using S - box based on Multi Chaotic Maps

Cited by 12 publications

References 14 publications

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

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

An Efficient Color-Image Encryption Method Using DNA Sequence and Chaos Cipher

Designing a Graphical Domain-Specific Modeling Language for Efficient Block Cipher Configuration: BCLang

Contact Info

Product

Resources

About