scholarly journals A new dynamic speech encryption algorithm based on lorenz chaotic map over internet protocol

2020 ◽  
Vol 10 (5) ◽  
pp. 4824
Author(s):  
Obaida M. Al-hazaimeh
Keyword(s):  
Chaotic Map ◽  
Internet Protocol ◽  
Encryption Algorithm ◽  
Security Level ◽  
Generation Process ◽  
Voice Communication ◽  
Secret Keys ◽  
Speech Encryption ◽  
Dynamic Key ◽  
The Voice

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.

The Dual Mapping Key Variable Voice Encryption Algorithm

2012 ◽  
Vol 263-266 ◽  
pp. 3083-3090
Author(s):  
Hui Zhou ◽  
Zhi Jun Wang ◽  
Bing Yan
Keyword(s):  
Chaotic Map ◽  
Encryption Algorithm ◽  
Simulation Results ◽  
Dual Mapping ◽  
The Voice

In this paper, the cat map and the chaotic map are analyzed, and a key variable algorithm which combines chaotic map and cat map is proposed. What’s more, a variable key encryption system processes combined with the voice preprocessing is put forward. The simulation results show that the algorithm has a good voice encryption security features.

scholarly journals An Image Encryption Algorithm Based on Time-Delay and Random Insertion

Entropy ◽  
2018 ◽  
Vol 20 (12) ◽  
pp. 974 ◽  
Author(s):  
Xiaoling Huang ◽  
Guodong Ye
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Experimental Tests ◽  
Encryption Algorithm ◽  
Secure Communications ◽  
Diffusion Structure ◽  
Secret Keys ◽  
Plain Image ◽  
Two Stages ◽  
Image Encryption Algorithm

An image encryption algorithm is presented in this paper based on a chaotic map. Different from traditional methods based on the permutation-diffusion structure, the keystream here depends on both secret keys and the pre-processed image. In particular, in the permutation stage, a middle parameter is designed to revise the outputs of the chaotic map, yielding a temporal delay phenomena. Then, diffusion operation is applied after a group of random numbers is inserted into the permuted image. Therefore, the gray distribution can be changed and is different from that of the plain-image. This insertion acts as a one-time pad. Moreover, the keystream for the diffusion operation is designed to be influenced by secret keys assigned in the permutation stage. As a result, the two stages are mixed together to strengthen entirety. Experimental tests also suggest that our algorithm, permutation– insertion–diffusion (PID), performs better when expecting secure communications for images.

Image encryption algorithm based on Lorenz chaotic map with dynamic secret keys

2017 ◽  
Vol 31 (7) ◽  
pp. 2395-2405 ◽  
Author(s):  
Obaida M. Al-Hazaimeh ◽  
Mohammad F. Al-Jamal ◽  
Nouh Alhindawi ◽  
Abedalkareem Omari
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Encryption Algorithm ◽  
Secret Keys ◽  
Image Encryption Algorithm

scholarly journals New Image Encryption Algorithm Using Hyperchaotic System and Fibonacci Q-Matrix

Electronics ◽  
2021 ◽  
Vol 10 (9) ◽  
pp. 1066
Author(s):  
Khalid M. Hosny ◽  
Sara T. Kamal ◽  
Mohamed M. Darwish ◽  
George A. Papakostas
Keyword(s):  
Image Encryption ◽  
Correlation Coefficients ◽  
Encryption Algorithm ◽  
Security Level ◽  
Hyperchaotic System ◽  
Secret Keys ◽  
Q Matrix ◽  
Digital Image Encryption ◽  
And Diffusion ◽  
Image Encryption Algorithm

In the age of Information Technology, the day-life required transmitting millions of images between users. Securing these images is essential. Digital image encryption is a well-known technique used in securing image content. In image encryption techniques, digital images are converted into noise images using secret keys, where restoring them to their originals required the same keys. Most image encryption techniques depend on two steps: confusion and diffusion. In this work, a new algorithm presented for image encryption using a hyperchaotic system and Fibonacci Q-matrix. The original image is confused in this algorithm, utilizing randomly generated numbers by the six-dimension hyperchaotic system. Then, the permutated image diffused using the Fibonacci Q-matrix. The proposed image encryption algorithm tested using noise and data cut attacks, histograms, keyspace, and sensitivity. Moreover, the proposed algorithm’s performance compared with several existing algorithms using entropy, correlation coefficients, and robustness against attack. The proposed algorithm achieved an excellent security level and outperformed the existing image encryption algorithms.

scholarly journals A new speech encryption algorithm based on dual shuffling Hénon chaotic map

2021 ◽  
Vol 11 (3) ◽  
pp. 2203
Author(s):  
Obaida M. Al-hazaimeh
Keyword(s):  
Chaotic Map ◽  
Security Level ◽  
Initial Condition ◽  
State Variables ◽  
The Past ◽  
Random Fashion ◽  
Xor Operation ◽  
Speech Encryption ◽  
Original Speech ◽  
Differential Attacks

Over the past few decades, many algorithms have been proposed to improve the performance of speech encryption over un-secure channel (i.e., Internet). In this paper, the security level was enhanced using a dynamic dual chaotic based on Hénon chaotic map. In the proposed algorithm, the speech elements are shuffled in a random fashion. Moreover, when both Hénon state variables are free to be used for shuffling the index is toggled randomly between them according to toggle bit. After index shuffling each speech element is modified with XOR operation between the original speech element value and the key that is selected randomly from the updated key table. The same chaotic map is used to initiate the empty or full table and provide new table entries from the values that are already shuffled. The experimental results show that the proposed crypto-system is simple, fast with extra random toggling behavior. The high order of substitution make it sensitive to initial condition, common cryptanalysis attacks such as linear and differential attacks are infeasible.

A Solution for Voice Communication Base on Web Mobile in the Telepresence System

2013 ◽  
Vol 850-851 ◽  
pp. 458-461
Author(s):  
Yi Quan Kong ◽  
Yi Fu Jin ◽  
Fa Xin Zhao
Keyword(s):  
Optimization Algorithm ◽  
Data Stream ◽  
High Performance ◽  
Internet Protocol ◽  
Network Resources ◽  
Voice Communication ◽  
Practical Solution ◽  
Empirical Results ◽  
Voice Data ◽  
The Voice

In order to to provide an effective, high performance and practical solution for voice communication base on web mobile over internet protocol in the telepresence system. The paper used one method which contained optimization algorithm of voice communication in the telepresence system. We also designed one web mobile famework structure and voice communication terminal configure .Empirical results show that solution guarantees the Qos of the voice data stream and enhances the efficiency of network resources oice communication base on web mobile over internet protocol in the telepresence system.

scholarly journals Design and Development of Secure Mobile Communication over GSM Network Using Open Source Operating System (OS)

2019 ◽  
pp. 1-5
Keyword(s):  
Operating System ◽  
Open Source ◽  
Mobile Phones ◽  
Mobile Communication ◽  
Internet Protocol ◽  
Research Work ◽  
Voice Communication ◽  
The World ◽  
Gsm Network ◽  
The Voice

With the rapidly advancing technology of today, exchange of information and data is a very pertinent matter. The world has just recently witnessed the effects of information leakage through the issue of WikiLeaks. There are huge amounts of data being shared over different platforms nowadays. Global System for Mobile Communication (GSM) is one of the most reliable platforms known to and used by almost all people in the world for text as well as voice communication. With the tools like Android Studio and NetBeans available, it is now possible to encrypt the text that has to be sent over the GSM, so that it can be decrypted at the other end of the communication path. However, the encryption and decryption of voice being transmitted over the GSM network still remains a question. In the domain of real time voice encryption, much of the work being carried out pertains to the voice being exchanged through the Internet Protocol. As compared to the Voice over Internet Protocol (VoIP), voice over the GSM network has not seen much research work related to its security aspects. The purpose of this paper is to document the results of a project aimed at developing a platform for mobile phones in order to communicate over the GSM network in a secure manner. The most suitable method for achieving the above mentioned objective is to use an open source Operating System (OS), so that the source code is easily accessible and usable. In this paper, the Android OS will be under discussion, which is compatible with all the Android mobile phones. In this way, the maximum number of mobile phone users can be benefitted because Android cell phones are being widely used nowadays. The use of cryptographic algorithms for securing the voice communication over the GSM network is also a part of this paper. The work revolves around the Java programming language since the Android application development has been carried out in Java through the use of Android Studio. Also, NetBeans has been employed for developing algorithms for voice encryption

Image Encryption Algorithm Based on Substitution Principle and Shuffling Scheme

2020 ◽  
Vol 38 (3B) ◽  
pp. 98-103
Author(s):  
Atyaf S. Hamad ◽  
Alaa K. Farhan
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Second Phase ◽  
Cipher Text ◽  
The Face ◽  
Substitution Principle ◽  
2D Logistic Map ◽  
Image Encryption Algorithm

This research presents a method of image encryption that has been designed based on the algorithm of complete shuffling, transformation of substitution box, and predicated image crypto-system. This proposed algorithm presents extra confusion in the first phase because of including an S-box based on using substitution by AES algorithm in encryption and its inverse in Decryption. In the second phase, shifting and rotation were used based on secrete key in each channel depending on the result from the chaotic map, 2D logistic map and the output was processed and used for the encryption algorithm. It is known from earlier studies that simple encryption of images based on the scheme of shuffling is insecure in the face of chosen cipher text attacks. Later, an extended algorithm has been projected. This algorithm performs well against chosen cipher text attacks. In addition, the proposed approach was analyzed for NPCR, UACI (Unified Average Changing Intensity), and Entropy analysis for determining its strength.

Sign in / Sign up

Export Citation Format

Share Document