A new dynamic speech encryption algorithm based on Lorenz chaotic map over internet protocol

International Journal of Electrical and Computer Engineering (IJECE)
Vol. 10, No. 5, October 2020, pp. 4824~4834
ISSN: 2088-8708, DOI: 10.11591/ijece.v10i5.pp4824-4834  4824
Journal homepage: http://ijece.iaescore.com/index.php/IJECE
A new dynamic speech encryption algorithm based on Lorenz
chaotic map over internet protocol
Obaida M. Al-Hazaimeh
Department of Computer Science and Information Technology, Al- Balqa' Applied University, Jordan
Article Info ABSTRACT
Article history:
Received Feb 3, 2020
Revised Mar 13, 2020
Accepted Mar 24, 2020
This paper introduces a dynamic speech encryption algorithm based on
Lorenz chaotic map over internet protocol to enhance the services of
the real-time applications such as increases the security level and reduces
latency. The proposed algorithm was divided into two processes: dynamic
key generation process using 128-bit hash value to dynamically alter
the initial secret keys, and encryption and decryption process using Lorenz
system. In the proposed algorithm, the performance evaluation is carried out
through efficient simulations and implementations and statistical analysis.
In addition, the average time delay in the proposed algorithm and some of
the existing algorithms such as AES is compared. The obtained results
concluded that, the proposed dynamic speech encryption algorithm is
effectually secured against various cryptanalysis attacks and has
useful cryptographic properties such as confusion and diffusion for better
voice communication in the voice applications field in the Internet.
Keywords:
AMR-WB-G.722.2
Chaos-theory
Cryptography
IP telephony
Lorenz map
Copyright © 2020 Institute of Advanced Engineering and Science.
All rights reserved.
Corresponding Author:
Obaida M. Al-hazaimeh,
Department of Computer Science and Information Technology,
Al- Balqa' Applied University,
21163, Jordan.
Email: dr_obaida@bau.edu.jo
1. INTRODUCTION
Voice application over Internet protocol (i.e., VoIP) is a IP telephony technology that allows
the voice data as human voice to transfers in real-time over Internet Protocol (i.e., IP) in a manner that
emulates the traditional telephone service (i.e., PSTN) [1, 2]. In general, the voice application over internet
protocol only requires an program on the end-point computer (i.e., sender, or receiver) capable of encoding
and decoding transmitting speech and Internet access [3, 4].
Voice application over internet protocol technology provides more advantages when it is compared
to the traditional telephone service. IP telephony technology is cheaper, can be integrated with other media
services, portable, and allows for more efficient bandwidth utilization. Therefore, the service providers prefer
the IP telephony technology as a method to reduce the cost over existing multimedia services. Moreover,
the infrastructure of the IP telephony is considered as a solid economical ground in building the more recent
revenue-generating services. Markedly, the deployment of IP telephony technology is becoming more
popular and is considered as an integral part of a global competitive landscape [5, 6]. Despite of all these
positive features, the IP telephony technology is facing some difficulties and challenges such as security,
packet loss, and latency. Consequently, more advanced techniques or strategies are warranted to competently
manage these difficulties, which are expected to ensure the quality of the IP telephony technology services
(i.e., QoS) [3, 7]. For example, the threat of the intruders over IP networks is the greatest security challenge
in IP telephony technology. The later will be a great concern since these offenders utilize various sniffing
tools to compromise the conversation of the IP telephony. To managing the security challenges, cryptography
serves as a valuable tool to maintain data secrecy [8, 9].

Int J Elec & Comp Eng ISSN: 2088-8708 
A new dynamic speech encryption algorithm based on lorenz chaotic map (Obaida M. Al-Hazaimeh)
4825
The science of cryptology consists of two major parts: cryptography and cryptanalysis. The science
of cryptology and its cryptographic primitives are categorized as illustrated in Figure 1. While cryptography
is the art of maintaining data secrecy against unauthorized access (i.e., intruders), on the other sided,
cryptanalysis is about analyzing and handling infringement of secure communication [10, 11].
Figure 1. Taxonomy of cryptology
To maintain data secrecy against unauthorized access over IP networks the cryptography is widely
used. However, most of the existing cryptographic algorithms are built to maintain text data secrecy.
Therefore, these existing algorithms are not suitable for voice applications over internet protocol because it
involves extensive computation and consumed a large amount of time (i.e., delay) [5, 12]. The following four
performance factors: encryption delay, the security level, message delay, and processing power are mainly
used to measure the VoIP security. The security level (i.e., complexity) of the security algorithm seems to
have an impact on these measurement factors [8, 13, 14]. Constructing new speech encryption algorithms
based on chaos theory to increase the security level has drawn for many scientists and researchers
attention [15-21], but unfortunately some of these constructed algorithms have a number of practical
problems in terms of cryptanalysis attacks [22, 23]. In this paper, a new dynamic speech encryption
algorithm using Lorenz chaotic map over IP network is proposed. While generating a chaotic key stream,
the system parameters and 128-bit hash value of the plain-speech are included in the proposed algorithm to
obtain a highest security level.
The rest of this paper is organized into 5 sections including the introduction as follows: section 2 has
described the proposed algorithm based on Lorenz system. Section 3 describes simulation result and security
analysis, and explains the procedures used to test the proposed algorithm. In section 4, a comparison with
existing work is given and finally conclusion is presented in sections 5.
2. PROPOSED ALGORITHM
In practical, Lorenz chaotic map has useful cryptographic properties such as confusion and
diffusion, sensitivity to initial conditions and parameters, and un-predictability [20]. Therefore, Lorenz
chaotic map is used in this paper to propose a new symmetric speech encryption algorithm. It consists of two
major parts: keys generation using 128-bit hash value of plain speech frame and the logistic, and encrypting
the speech frame using chaotic sequences which are generated by Lorenz system. The overall block diagram
of the proposed algorithm architecture can be illustrated by Figure 2.

 ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 10, No. 5, October 2020 : 4824 - 4834
4826
Figure 2. Block diagram
Below, we will provide an introductory definition of the Lorenz system and analyze its main
positive features regarding to cryptography. Then, the steps to implement such a process of the encryption
parts will be discuss. The decryption steps for completeness will also be illustrated.
2.1. Lorenz chaotic system
Lorenz system is a dynamical system which was studied first by Edward Norton Lorenz around
1960 [24], This chaotic system is described by non-linear system of ordinary differential equations
(i.e., ODEs) as given in (1).
ẋ = a(y − x),
ẏ = (σ − z)x − y,
ż = xy − bz.
(1)
The real numbers a, σ, b are called the control parameters, where x, y, z are variables called the state
variables, and ẋ, ẏ, and ż are the time derivatives of x, y, and z. Usually, the Lorenz system (1) is commonly
solved numerically using RK45 (Runge-Kutta methods) for given control parameters, and initial values of
the state variables (i.e., x0, y0, z0). In Figure 3 a chaotic attractor (i.e., Lorenz butterfly) of the dynamical
Lorenz system (1) is presented.
Figure 3. Chaotic attractor

4827
For different values of parameter σ the dynamical system (1) exhibits chaos. By having positive
Lyapunov exponents (i.e., sensitivity to initial conditions), chaos can be recognized for many dynamical
systems, and in particular (1). In Figure 4, the maximum Lyapunov exponent of (1) versus values of σ are
plotted. In this paper, we have fixed a and b to be a = 10, b = 8/3, and allow value of σ to dynamically vary
in the interval [28, 90] to provide a large enough key-space to resist brute-force attacks. Moreover, this will
guarantee that (1) has dense (chaotic) attractors, which is important in terms of cryptography; any change in
initial conditions will cause trajectories to remain in the same attractor set, thus making it difficult to predict
any outcome without knowing the exact initial conditions of the system as well as the iteration counts in
the numerical solution.
Figure 4. Maximum lyapunov exponents
2.2. Generation process for the initial values and parameters
In the generation process, we utilize the 128-bit hash value of the plain-speech frame generated by
MD5 hash function to dynamically change the initial secret keysx0, y0, z0and σ0. In the following steps,
the generation process is described in the details.
Algorithm 1: Generation process
Step 1:
Compute a 128-bit hash value K from the plain speech frame Bj, and then
compute four
26-bit sequences as the following:
𝑥 𝑛 = digits(𝑥0 − floor(𝑥0), 26)
𝑦𝑛 = digits(𝑦0 − floor(𝑦0), 26)
𝑧 𝑛 = digits(𝑧0 − floor(𝑧0), 26)
𝜎 𝑛 = digits(𝜎0 − floor(𝜎0), 26)
Step 2: Set 𝑟 = mod(count(𝜎 𝑛, 1), 13).
Step 3: Set s = xn, yn, zn, 1100 to construct the 128-bit string.
Step 4:
Compute a new 128-bit hash-value by 𝐻 𝑁 = rotL(𝑠 XOR 𝐾, 𝑟), then divide 128-bit hash
value into four 32-bit vectors: 𝐻 𝑁 = 𝑘1, 𝑘2, 𝑘3, 𝑘4.
Step 5:
Normalize the initial secret key to the interval (0, 1) using f(t) = (arctan(t) +
π/2)/π as the following:
𝑥 𝑁 = 𝑓(𝑥0), 𝑦 𝑁 = 𝑓(𝑦0), 𝑧 𝑁 = 𝑓(𝑧0), σ 𝑁 = 𝑓(𝜎0).
Step 6:
Set 𝑛𝑖 = 100 + count(𝑘𝑖, 1), 𝑖 = 1, 2, 3, 4 to construct a four chaotic numbers 𝑙1, 𝑙2, 𝑙3,
𝑙4 ∈ (0, 1) by iterating the logistic map 𝑛1, 𝑛2, 𝑛3, and 𝑛4 times using the
initial-values 𝑥 𝑁, 𝑦 𝑁, 𝑧 𝑁, σ 𝑁, respectively.
Step 7:
Finally, the following formula is used to compute the new four chaotic keys
𝑥̅, 𝑦̅, 𝑧̅, and σ̅:
[𝑥̅ 𝑦̅𝑧̅] = [𝑥0 𝑦0 𝑧0] + [𝑙1 𝑙2 𝑙3] + 2−32
× [𝑘1 𝑘2 𝑘3], σ̅ = 14 + 15 × (𝑙4 + 2−32
𝑘4).
2.3. Encryption process
In the encryption process, a several iterations over the plain speech frame that involves a set of
operation such as substitutions, permutations, transformations, and transpositions are performed to
complicate the process of decrypting cipher speech frame by cyber-intruders (i.e., unauthorized access)
[25, 26]. In Figure 5 the block diagram of the proposed decryption process is presented. The speech
encryption algorithm proposed in this paper consists of the following sequential steps:

 ISSN: 2088-8708
4828
Algorithm 2: Encryption process
Step 1:
Arrange the 20-ms speech frame in 𝐁 = {𝐵1, 𝐵2, … , 𝐵𝑗} of length 𝑗 = 132, each element
is the 8-bit representation of the bit 0 (BIT-0: FF81) or the bit 1 (BIT-
1: 007F) of
the coder parameters which is codified on 8 bits.
Step 2:
Set 𝑑̅ = floor(𝑑/13), then iterate the Lorenz system (1)using RK-45 method for (𝑑̅ +
1) times using the new initial-values 𝑥(0) = 𝑥̅, 𝑦(0) = 𝑦̅, and 𝑧(0) = 𝑧̅, and new
control parameter 𝜎 = σ̅, to get three chaotic sequences 𝑋, 𝑌, and 𝑍. Then
compute the following three sequences:
𝑋 𝑁 = {𝑥1, 𝑥2, … , 𝑥 𝑑̅+1}, 𝑌𝑁 = {𝑦1, 𝑦2, … , 𝑦 𝑑̅+1}, 𝑍 𝑁 = {𝑧1, 𝑧2, … , 𝑧 𝑑̅+1}
for 𝑖 = 1, 2, … , 𝑑̅ + 1:
𝑥𝑖 = digits(𝑋𝑖 − floor(𝑋𝑖), 26),
𝑦𝑖 = digits(𝑌𝑖 − floor(𝑌𝑖), 26),
𝑧𝑖 = digits(𝑍𝑖 − floor(𝑍𝑖), 26).
Step 3:
Set 𝑑̃ = 𝑑̅ if (𝑑/13) is an integer. Otherwise, 𝑑̃ = 𝑑̅ + 1,. Then, partitioning the
array 𝑷 into 𝑑̃ vectors as 𝑷 = 𝑃1, 𝑃2, … , 𝑃 𝑑̃
where,
𝑃𝑖 = 𝑝13(𝑖−1)+1, … , 𝑝13𝑖, 𝑃 𝑑̃ = 𝑝13𝑑̅+1, … , 𝑝 𝑑, 𝑖 = 1,2, … , 𝑑̅
Step 4:
Construct the sequence 𝑈 = 𝑈1, 𝑈2, … , 𝑈 𝑑̃ with𝑈𝑖 = 𝐵𝑖, for 𝑖 = 1, 2, … , 𝑑̅, and
𝑈 𝑑̃ = digits(𝐵 𝑑̃, length(𝑃 𝑑̃)). Observe that length(𝑈𝑖) = 28 + 28 = 56bit = 7 × 8bit, and
length(𝑃 𝑑̃) = (𝑑 − 13𝑑̅) × 8bit.
Step 5: Construct rotations𝑟𝑖 = count(𝑧𝑖, 1), 𝑖 = 1, 2, … , 𝑑̃.
Step 6:
Finally, the cipher speech frame 𝐂 is obtained using the formula:
𝐶𝑖 = rotL(𝑈𝑖 𝑋𝑂𝑅 𝑃𝑖, 𝑟𝑖), 𝑖 = 1,2, … , 𝑑̃.
Figure 5. Decryption algorithm
3. SIMULATION RESULT AND SECURITY ANALYSIS
This section discusses the proposed speech encryption algorithm, which simulated on a 1.6 GHz
core (TM) i5, 1-TB hard disk capacities and 4-GB memory with MATLAB software. In this section,
as an example, different speech samples of audio files are selected with different sampling rate (i.e., 5000
samples per second). The simulation result was validated by applying the statistical tests such as histogram
analysis, correlation, randomness, and sensitivity to prove the performance metrics [22]. Below,
standardized tests are given.
3.1. Histogram analysis test
To evaluate the quality of encrypted speech signals, this analysis is the most accurate test.
Practically, the proposed algorithm is likely to encrypt the plain speech signals in a random manner
(i.e., noisy signals). Histogram of the input speech signals are illustrated in Figure 6(a) and Figure 6(d).
The corresponding histogram of the encrypted speech signals using the secret keys: x0, y0, z0, σ0,
and 128-bit hash value of the speech signals are illustrated in Figure 6(b) and Figure 6(e). The results in
Figure 6 shows that the histograms of the encrypted speech signals are fairly uniform distributed and totally
different from the plain speech signals. In addition, the result indicates that the proposed algorithm can
be decrypted correctly with the correct keys as illustrated in Figure 6(c) and Figure 6(f).

4829
(a) (d)
(b) (e)
(c) (f)
Figure 6. Histogram analysis, (a) Input speech signal_1, (b) Encrypted speech signal_1,
(c) Decrypted speech signal_1, (d) Input speech signal_2, (e) Encrypted speech signal_2,
(f) Decrypted speech signal_2
3.2. Correlation test
The chaotic system was found to produce a strong encryption method, which can be
efficiently identified by correlation method [23]. The correlation method is computed as (2).
𝑟𝑥𝑦 =
cov(𝑥,𝑦)
√ 𝐷(𝑥)√𝐷(𝑦)
(2)

 ISSN: 2088-8708
4830
where
cov(𝑥, 𝑦) =
1
𝑁
∑ (𝑥𝑖 − 𝐸(𝑥))(𝑦𝑖 − 𝐸(𝑦))𝑁
𝑖=1 , 𝐸(𝑥) =
1
𝑁
∑ 𝑥𝑖
𝑁
𝑖=1 , 𝐷(𝑥) =
1
𝑁
∑ (𝑥𝑖
𝑁
𝑖=1 −𝐸(𝑥))2
,
where N is the number of speech samples. In proposed algorithm, the correlation coefficient
cov(x, y) between the plain and the ciphered speech samples are tabulated in Table 1. The result in Table 1
shows that the proposed speech encryption algorithm is efficient enough, because the correlation test has
been satisfied that would resist statistical attacks.
Table 1. Correlation test
File Name Original Encrypted
Sample_1.wav 0.98153 0.000992
Sample_2.wav 0.98726 0.000642
Sample_3.wav 0.99114 0.001765
Sample_4.wav 0.96241 0.001357
3.3. Randomness tests
To measure the strength of the encrypted speech frames against cryptanalysis attacks, we have
performed a different suite of statistical tests in this section known as DIEHARD (i.e., 18-tests) and NIST
(i.e., 15-tests) test suite [23, 27]. For given sequence, these suites are designed mainly to measure the quality
of the randomness. As can be seen from Table 2 and Table 3, the p-value of each test ranges from 0.01 to
0.99 (i.e., success range), which means the encrypted sequence is random at the 99% of confidence level.
Table 2. DIEHARD tests suite
Test No. p-value Result
1 0.508955 Testing passed
Table 3. NIST tests suite
Test No. p-value Result

4831
3.4. Information entropy
Information entropy is used usually as a measure of disorder, or randomness in encrypted speech
signal [28]. The entropy function 𝐻(𝑠)of a source s can be computed as (3).
𝐻(𝑠) = ∑ 𝑃(𝑠𝑖) log2
1
𝑃(𝑠 𝑖)
2𝑁−1
𝑖=1 (3)
where P(Si) represents Si probability. The entropy value for the encrypted speech signals should ideally be 8.
In other words, if the entropy value of the encrypted speech signals is less than 8, then the predictability
threats to the encrypted speech signals are exists. In this paper, ENT test suite is used to calculate
the information entropy value. Practically, ENT is a suite composed of the following three tests: entropy,
serial correlation, and chi-square coefficient as shown in Table 4. From these results, the obtained values are
evaluated to be almost as the theoretical value, which means that the proposed speech encryption algorithm is
efficient enough (i.e., secure) upon the cryptanalysis attacks (i.e., entropy).
Table 4. ENT test suite
No. ENT test suite Theoretical value Obtained value
1 Entropy Close to 8 7.999986
2 Serial correlation Close to 0 0.000381
3 Chi-square coefficient Close to 127.5 127.5019
3.5. Key sensitivity test
To ensure the security against brute-force attacks, the excellent encrypted speech quality must be
sensitive in extreme way with respect to the secret keys [24, 29]. In the proposed algorithm, any slightly
change (i.e., bit flip) on the following sensitivity factors: hash values, keys, and other encryption keys such as
parameters that would generate a completely different decryption results as shown in Figure 7.
(a) (b)
(c) (d)
Figure 7. Key sensitivity, (a) Input speech signal, (b) Decrypted speech signal with correct key,
(c) Decrypted speech signal with incorrect key hash value, (d) Decrypted speech signal with incorrect x0

 ISSN: 2088-8708
4832
4. COMPARISON WITH EXISTING WORKS
There are several types of delay in the current IP telephony networks such as processing (i.e., coder,
decoder, digital signal processing), serialization, queuing, propagation, and network delay as shown in
Figure 8. Some of them are fixed while others are variable as illustrated in Table 5. IP telephony applications
are delay sensitive. Therefore, the ITU-T has recommended that the maximum threshold of the delay time
(i.e., ∑delay sources) is 150 ms [2, 5, 6]. The adaptive multi-rate wideband (AMR-WB G.722.2) speech
codec is used in this paper to collect N speech samples as one frame because it supports the GSM features
such as discontinuous transmission, comfort noise generation, and voice activity detection [30].
Figure 8. Packet flow
Table 5. Delay source
Delay source Formula Description Delay type
Coder 𝐶 𝐷 = (2𝑁 + 1) ∗ 𝐹𝑟𝑎𝑚𝑒 𝑆𝑖𝑧𝑒 + 𝐿𝑜𝑜𝑘 𝑎ℎ𝑒𝑎𝑑 𝑡𝑖𝑚𝑒 Collect the speech samples as
frames.
Fixed
Decoder
𝐷 𝐷 =
𝐶 𝐷
2
Playback of the coder process. Fixed
Serialization
𝑆 𝐷 =
𝐹𝑟𝑎𝑚𝑒 𝑆𝑖𝑧𝑒
𝐼𝑛𝑡𝑒𝑟𝑓𝑎𝑐𝑒 𝐶𝑙𝑜𝑐𝑘𝑖𝑛𝑔 𝑅𝑎𝑡𝑒
Time to clock a speech frame onto a
network interface.
Fixed
Queuing
𝑄 𝐷 =
(𝑉𝑜𝑖𝑐𝑒 𝐹𝑟𝑎𝑚𝑒 𝑆𝑖𝑧𝑒 + 5120)
𝐿𝑖𝑛𝑒 𝑆𝑝𝑒𝑒𝑑
Time the voice packet spends in
router.
Variable
Network 𝑁 𝐷 = 𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑅𝑜𝑢𝑡𝑒𝑟𝑠 ∗ (𝑄 𝐷+𝑆 𝐷) Time the voice packet spends to go
from one point to another.
Variable
Propagation Caused by the light speed in copper-based networks (i.e., 125,000 miles per second), or in
fiber (i.e., 186,000 miles per second)
Fixed
Security Caused by the encryption and decryption processes. Fixed
A practical comparison on the average time delay between advanced encryption standard algorithm
and proposed algorithm in the same environment and conditions is made in this section. In end-to-end delay,
the implementation result shows that the average time delay to encrypt the speech data using the proposed
algorithm is 2.287701494 ms and the average time delay to encrypt the speech data using AES is
2.7832762824 ms as illustrated in Table 6 and Table 7 respectively. In other words, a column chart showing
the AES algorithm is slower than the proposed speech encryption algorithm is presented in Figure 9.
Table 6. End-to-end delay time for fast Ethernet using the proposed speech encryption algorithm

4833
Table 7. End-to-end delay time for fast ethernet using AES algorithm
Figure 9. Average delay time
5. CONCLUSION
In this paper we have achieved our objective of designing a dynamic speech encryption algorithm
based on Lorenz chaotic map over internet protocol to enhance the real-time services. The proposed
algorithm was divided into two processes: key generation process using 128-bit hash value, and encryption
and decryption process using Lorenz system. To evaluate the security level of the proposed algorithm,
efficient simulations and implementations and analysis have been conducted. The security level is increased
by using a multi key with every new speech packet and increasing a key length which protects the proposed
algorithm against various cryptanalysis attacks. In addition, a comparison between the average time delay in
the proposed algorithm and some of the existing encryption algorithms is made. The results endorse that
the proposed algorithm achieved a higher security level with a lowest average delay time and it is an
excellent choice for voice communication in practical applications in the Internet.
REFERENCES
[1] B. Goode, “Voice over internet protocol (VoIP),” Proceedings of the IEEE, vol. 90, no. 9, pp. 1495-1517, 2002.
[2] H. Oouch, et al., “Study on appropriate voice data length of IP packets for VoIP network adjustment,” in Global
Telecommunications Conference, 2002. GLOBECOM'02. IEEE, vol. 2, pp. 1618-1622, 2002.
[3] R. Dantu, et al., “Issues and challenges in securing VoIP,” Computers & Security, vol. 28, no. 8, pp. 743-753, 2009.
[4] O. M. Al-Hazaimeh, “Increase the security level for real-time application using new key management solution,”
International Journal of Computer Science Issues (IJCSI), vol. 9, no. 3, pp. 240-246, 2012.
[5] S. Na and S. Yoo, “Allowable propagation delay for VoIP calls of acceptable quality,” in Proceedings of the First
International Workshop on Advanced Internet Services and Applications, pp. 47-56, 2002.
[6] O. M. Al-Hazaimeh, “New cryptographic algorithms for enhancing security of voice data,” Thesis, Universiti Utara
Malaysia, 2010.
[7] M. Zandi, et al., “Overview of security issues of VoIP,” in Proceedings of the Third IASTED European Conference
on Internet and Multimedia Systems and Applications, pp. 254-259, 2007.
[8] J. Seedorf, “Security challenges for peer-to-peer SIP,” IEEE Network, vol. 20, no. 5, pp. 38-45, 2006.
[9] O. M. Al-Hazaimeh, “Combining audio samples and image frames for enhancing video security,” Indian Journal of
Science and Technology, vol. 8, no. 10, p. 940, 2015.
[10] E. Schaefer, “An introduction to cryptography and Cryptanalysis,” California's Silicon Valley: Santa Clara
University, pp. 4-5, 2009.
[11] M. Mishra and V. H. Mankar, “Review on chaotic sequences based cryptography and cryptanalysis,” International
Journal of Electronics Engineering, vol. 3, no. 2, pp. 189-194, 2011.

 ISSN: 2088-8708
4834
[12] O. M. Al-Hazaimeh, et al., “A novel video encryption algorithm-based on speaker voice as the public key,” in 2014
IEEE International Conference on Control Science and Systems Engineering, pp. 180-184, 2014.
[13] C. T. Elrod, “VoIP security,” Google Patents, US8295188B2, 2012.
[14] M. Šalamon, “Chaotic electronic circuits in cryptography,” in Applied cryptography and network security,
pp. 295-320, 2012.
[15] E. Mosa, et al., “Chaotic encryption of speech signals,” International Journal of Speech Technology, vol. 14,
no. 4, pp. 285-26, 2011.
[16] L. J. Sheu, “A speech encryption using fractional chaotic systems,” Nonlinear dynamics, vol. 65, no. 1,
pp. 103-108, 2011.
[17] P. Sathiyamurthi and S. Ramakrishnan, “Speech encryption using chaotic shift keying for secured speech
communication,” EURASIP Journal on Audio, Speech, and Music Processing, vol. 2017, no. 1, pp. 20-30, 2017.
[18] H. T. Yau, et al., “Application of a chaotic synchronization system to secure communication,” Information
technology and control, vol. 41, no. 3, pp. 274-282, 2012.
[19] M. S. Azzaz, et al., “Synchronized hybrid chaotic generators: Application to real-time wireless speech encryption,”
Communications in Nonlinear Science and Numerical Simulation, vol. 18, no. 8, pp. 2035-2047, 2013.
[20] F. J. Farsana, et al., “An audio encryption scheme based on Fast Walsh Hadamard Transform and mixed chaotic
keystreams,” Applied Computing and Informatics, 2019.
[21] K. Kordov, “A Novel Audio Encryption Algorithm with Permutation-Substitution Architecture,” Electronics,
vol. 8, pp. 530-544, 2019.
[22] C. E. Shannon, “Communication theory of secrecy systems,” The Bell system technical journal, vol. 28, no. 4,
pp. 656-715, 1949.
[23] W. Chang, et al., “Randomness testing of compressed data,” arXiv preprint arXiv:1001.3485, 2010.
[24] O. M. Al-Hazaimeh, et al., “Image encryption algorithm based on Lorenz chaotic map with dynamic secret keys,”
Neural Computing and Applications, pp. 1-11, 2017.
[25] R. S. Mohammed and S. B. Sadkhan, “Speech scrambler based on proposed random chaotic maps,” in 2016
Al-Sadeq International Conference on Multidisciplinary in IT and Communication Science and Applications
(AIC-MITCSA), pp. 1-6, 2016.
[26] A. K. Mittal, et al., “Secure communication based on chaotic switching and rapid synchronization using parameter
adaptation,” International Journal of Innovative Computing, Information and Control, vol. 11, no. 2, pp. 569-585,
Apr 2015.
[27] J. Soto, “Statistical testing of random number generators,” in Proceedings of the 22nd national information systems
security conference, 1999.
[28] X. Zhang and Z. Zhao, “Chaos-based image encryption with total shuffling and bidirectional diffusion,” Nonlinear
Dynamics, vol. 75, no. 1-2, pp. 319-330, 2014.
[29] J. Fridrich, “Symmetric ciphers based on two-dimensional chaotic maps,” International Journal of Bifurcation and
chaos, vol. 8, no. 6, pp. 1259-1284, 1998.
[30] M. Boumaraf and F. Merazka, “Speech Coding Combining Chaos Encryption and Error Recovery for G. 722.2
Codec,” in Proceedings of the 3rd International Conference on Natural Language and Speech Processing,
pp. 128-134, 2019.
BIOGRAPHY OF AUTHOR
Obaida M. Al-Hazaimeh received his BSc in Computer Science from Applied Science
University, Jordan in 2004 and MSc in Computer science from University Science Malaysia,
Malaysia, in 2006. He received his PhD degree in Network Security (Cryptography) from
Malaysia in 2010. He is an associate professor at department of computer science and
information technology, Al-Balqa' Applied University, Jordan. His main research interests are
Cryptology, image processing, machine learning, and chaos theory. He has published more
than 34 Papers as author and Co-author in international refereed journals.

A new dynamic speech encryption algorithm based on Lorenz chaotic map over internet protocol

Recommended

More Related Content

What's hot (17)

Similar to A new dynamic speech encryption algorithm based on Lorenz chaotic map over internet protocol (20)

More from IJECEIAES (20)

Recently uploaded (20)

A new dynamic speech encryption algorithm based on Lorenz chaotic map over internet protocol