scholarly journals VoIP Speech Encryption System Using Stream Cipher with Chaotic Key Generator

2021 ◽  
pp. 240-248
Author(s):  
Mahmood Khalel Ibrahem ◽  
Hussein Ali Kassim
Keyword(s):  
Stream Cipher ◽  
Chaotic Maps ◽  
Initial Conditions ◽  
Local Network ◽  
Average Delay ◽  
Performance Quality ◽  
Chaotic Cryptography ◽  
Wireless Telecommunication ◽  
Encryption Decryption ◽  
Voice Data

Recently, with the development multimedia technologies and wireless telecommunication, Voice over Internet Protocol, becomes widely used in communication between connecting people, VoIP allows people that are connected to the local network or the Internet to make voice calls using digital connection instead of based on the analog traditional telephone network. The technologies of Internet doesn’t give any security mechanism and there is no way to guarntee that the voice streams will be transmitted over Internet or network have not been intercepted in between. In this paper, VoIP is developed using stream cipher algorithm and the chaotic cryptography for key generator. It is based on the chaotic maps for generating a one-time random key used to encrypt each voice data in the RTP packet. Chaotic maps have been used successfully for encryption bulky data such as voice, image, and video, chaotic cryptography has good properties such as long periodicity, pseudo-randomness, and sensitivity to initial conditions and change in system parameters. A VoIP system was successfully implemented based on the on ITU-T G.729 for voice codec, as a multimedia encoding of Real-time Transport Protocol payload data, then, apply a proposed method to generate three-mixed logistic chaotic maps [1] and then analysis the encryption/ decryption quality measures for speech signal based this method. The experimental work demonstrates that the proposed scheme can provide confidentiality to voice data with voice over IP performance quality, minimum lost in transmitted packet, minimum average delay, and minimum jitter.

A self-updating digital chaotic stream cipher

2018 ◽  
Vol 29 (08) ◽  
pp. 1850074 ◽  
Author(s):  
Jin Zhong ◽  
Dong Jiang ◽  
Qi-Guo Huang ◽  
Yang Cao
Keyword(s):  
Stream Cipher ◽  
Chaotic Maps ◽  
Statistical Evaluation ◽  
Piecewise Linear ◽  
Real Numbers ◽  
The Past ◽  
Dynamical Degradation ◽  
Chaotic Cryptography ◽  
Encryption And Decryption ◽  
Degradation Problem

Chaotic cryptography has been extensively investigated over the past three decades, especially in the field of digital chaotic cryptography. In this paper, we propose a new digital chaotic stream cipher based on double piecewise linear chaotic maps. It initially takes four real numbers as the key, periodically updates the chaotic maps, and efficiently outputs the bit strings. Theoretical analysis shows that our protocol achieves higher anti-cryptanalysis capacities, effectively alleviates the dynamical degradation problem, and thus reaches higher security. Statistical evaluation demonstrates that our protocol can generate bit strings with outstanding statistical properties. In addition, we apply our protocol to image encryption and decryption. Experimental results verify the conclusions of the statistical evaluation, and prove the strong sensitivity of the protocol to the key.

Video Encryption Based on Chaotic System and Stream Cipher

2018 ◽  
Vol 1 (2) ◽  
pp. 33-40
Author(s):  
Laith Abdulhussien Hamood ◽  
Mahmood Khalel Ibrahem
Keyword(s):  
Chaotic System ◽  
Stream Cipher ◽  
Initial Conditions ◽  
Chaotic Map ◽  
Digital Data ◽  
Video Encryption ◽  
Digital Multimedia ◽  
Chaotic Cryptography ◽  
Encryption Method ◽  
Multimedia Encryption

the huge development and use of digital multimedia (video, image) over computer networks has led to increase the need for securing of these digital data. Video encryption is widely used as a method for providing security for digital video. In this paper video encryption method is developed using chaotic system for key generator and stream cipher, it uses chaotic map as one-time key generator which produce key used for encryption process. Chaotic systems have been successfully used for multimedia encryption. Chaotic cryptography have good characteristic such as pseudo-randomness, and sensitivity to initial conditions. Video encryption method have successfully designed and implemented, the tests and analysis results have showed the succeed of the encryption method in term of speed and security.

FAILURE OF A MEAN-FIELD APPROACH FOR THE MILLER–HUSE PHASE TRANSITION

2000 ◽  
Vol 10 (01) ◽  
pp. 251-256 ◽  
Author(s):  
FRANCISCO SASTRE ◽  
GABRIEL PÉREZ
Keyword(s):  
Phase Transition ◽  
Ising Model ◽  
Chaotic Maps ◽  
Initial Conditions ◽  
Mean Field ◽  
Region Of Interest ◽  
Universality Class ◽  
Two Dimensional ◽  
Field Approach

The diffusively coupled lattice of odd-symmetric chaotic maps introduced by Miller and Huse undergoes a continuous ordering phase transition, belonging to a universality class close but not identical to that of the two-dimensional Ising model. Here we consider a natural mean-field approach for this model, and find that it does not have a well-defined phase transition. We show how this is due to the coexistence of two attractors in its mean-field description, for the region of interest in the coupling. The behavior of the model in this limit then becomes dependent on initial conditions, as can be seen in direct simulations.

New Approach of the Playfair's Cipher with A Numerical Value of the Keyword

2017 ◽  
Vol 6 (3) ◽  
pp. 695 ◽  
Author(s):  
Assia Merzoug ◽  
Adda Ali-Pacha ◽  
Naima Hadj-Said
Keyword(s):  
Chaotic Maps ◽  
Initial Conditions ◽  
Logistic Map ◽  
Academic Research ◽  
Chaotic Attractors ◽  
New Approach ◽  
Single Character ◽  
Dimension 2

<p>At least during the last five years there has been an explosion of a public academic research in cryptography for Playfair's cipher. We were interested, and we have proposed a method to improve it, to make it safer and more efficient. We have oversized this encryption matrix by 7x7 coefficents and for its filling, we have combined two chaotic maps (the attractor Henon and logistics map). The attractor Henon of dimension 2, determines the intersection of the row and column of the new matrix playfair. The coefficients of this matrix are calculated from logistic map, each value is a single character of the alphabet used. The secret keyword is formed by the initial conditions of the chaotic attractors.</p>

Kendall’s Tau Based Correlation Analysis of Chaotic Sequences Generated by Piecewise Linear Maps

2015 ◽  
Vol 25 (13) ◽  
pp. 1550177
Author(s):  
Zouhair Ben Jemaa ◽  
Daniele Fournier-Prunaret ◽  
Safya Belghith
Keyword(s):  
Correlation Analysis ◽  
Chaotic Maps ◽  
Initial Conditions ◽  
Piecewise Linear ◽  
Chaotic Map ◽  
Linear Map ◽  
Piecewise Linear Map ◽  
Chaotic Sequences ◽  
Linear Maps ◽  
Piecewise Linear Maps

In many applications, sequences generated by chaotic maps have been considered as pseudo-random sequences. This paper deals with the correlation between chaotic sequences generated by a given piecewise linear map; we have based the measure of the correlation on the statistics of the Kendall tau, which is usually used in the field of statistics. We considered three piecewise linear maps to generate chaotic sequences and computed the statistics of the Kendall tau of couples of sequences obtained from randomly chosen couples of initial conditions. We essentially found that the results depend on the considered chaotic map and that it is possible to approach the uncorrelated case.

DESIGN OF PSEUDO-RANDOM BIT GENERATOR BASED ON CHAOTIC MAPS

2012 ◽  
Vol 26 (32) ◽  
pp. 1250208 ◽  
Author(s):  
XING-YUAN WANG ◽  
LEI YANG
Keyword(s):  
Cycle Length ◽  
Stream Cipher ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
The Other ◽  
One Dimensional ◽  
Random Bit Generator ◽  
Dynamical Properties ◽  
Finite States

In order to solve the problem of degradation of dynamical properties caused by finite states of computer, a new binary stream-cipher algorithm based on dual one-dimensional chaotic maps is proposed in this paper. In the process of generation, we employ a parameter of one chaotic map to perturb the other chaotic map's trajectory to lengthen the cycle-length of the other chaotic map's trajectory. In addition, we design a nonlinear principle to generate a pseudo-random chaotic bit sequence as key stream. Statistic proprieties show that the sequence is of high randomness.

scholarly journals Developing an Enhanced High-Speed Key Transmission (EHSKT) Technique to Avoid Fraud Activity in E-Commerce

2018 ◽  
Vol 12 (3) ◽  
pp. 1187 ◽  
Author(s):  
A.B. Hajira Be ◽  
R. Balasubramanian
Keyword(s):  
High Speed ◽  
Information Technologies ◽  
Information Loss ◽  
Simple Approach ◽  
Business Practices ◽  
Unique Identifier ◽  
Average Delay ◽  
Electronic Transactions ◽  
Special Character ◽  
Encryption Decryption

<span>E-commerce is an emerging and convergence of numerous main information technologies in business practices. E-commerce is an online website where the sale or buys of merchandise ordered electronically. It gives a simple approach to sell items to customers. In the applications suffers payments issues; for example, electronic transactions utilizing Visas or debit cards, net banking, PayPal or different tokens have more consistency problems and are at expanded hazard from being focused than different sites as they suffer more outcomes if there is information loss or modification. An Enhanced High-Speed Key Transmission (EHSKT) Technique is proposed for secure and efficient payment transactions and avoids fraud activity. The proposed system works based UUID (Universally Unique Identifier) to generate a unique id for payment transactions. Proposed system generates Unique id have a combination of number, alphabets, &amp; special character to avoid fraud users. The proposed design reduces the encryption, decryption time and key complexity. Based on Experimental evaluations, proposed methodology reduces 4.73 AD (Average Delay), 23.91 EC (Energy Consumption), 0.95 ET (Encryption Time), 0.85 DT (Decryption Time) and improves 59.8% (Throughput) compared than existing methodologies.</span>

scholarly journals A Novel Method to Identify Initial Values of Chaotic Maps in Cybersecurity

Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 140 ◽  
Author(s):  
Amir Anees ◽  
Iqtadar Hussain
Keyword(s):  
Chaotic Maps ◽  
Initial Conditions ◽  
Chaotic Map ◽  
Communication Security ◽  
Security Systems ◽  
Chaotic Communication ◽  
Major Drawback ◽  
Nonlinear Dynamical ◽  
Initial Values ◽  
Logistic Chaotic Map

Chaos theory has applications in several disciplines and is focusing on the behavior of dynamical systems that are highly sensitive to initial conditions. Chaotic dynamics are the impromptu behavior displayed by some nonlinear dynamical frameworks and have been used as a source of diffusion in cybersecurity for more than two decades. With the addition of chaos, the overall strength of communication security systems can be increased, as seen in recent proposals. However, there is a major drawback of using chaos in communication security systems. Chaotic communication security systems rely on private keys, which are the initial values and parameters of chaotic systems. This paper shows that these chaotic communication security systems can be broken by identifying those initial values through the statistical analysis of standard deviation and variance. The proposed analyses are done on the chaotic sequences of Lorenz chaotic system and Logistic chaotic map and show that the initial values and parameters, which serve as security keys, can be retrieved and broken in short computer times. Furthermore, the proposed model of identifying the initial values can also be applied on other chaotic maps as well.

Sign in / Sign up

Export Citation Format

Share Document