scholarly journals One-Dimensional Audio Scrambling based on Cellular Automata

2018 ◽  
Vol 13 (1) ◽  
pp. 136
Author(s):  
Abdel Latif Abu Dalhoum

Digital audio scrambling is a process used in audio security applications. Scrambling of audio files breaks the correlation between adjacent samples in order to convert the original audio to an unintelligible format. Scrambling is used to protect the audio against wiretapping and illegal surveillance, in addition to being a step in security algorithms, such as watermarking and encryption algorithms. Cellular automata are models that are discrete in nature and depend on simple and local rules to achieve an interesting overall behavior. Two-dimensional cellular automata were previously proposed as a key generation mechanism to scramble audio files. The mechanism was built upon be researchers in the multimedia security field. This paper explores the use of one-dimensional cellular automata in audio scrambling, which simplifies the process as deploying two-dimensional cellular automata requires changing the dimension of the audio file and the one-dimensional cellular automata does not, additionally, elementary one-dimensional cellular automata requires less parameters to configure. The scrambling degree is used to evaluate the model effectiveness in breaking the correlation of adjacent samples. In the experiments, different parameters are taken into account including the cellular automata class, the iterations needed and the method used to calculate the cells at the boundary. Experiments show that the one-dimensional cellular automata are capable of scrambling the audio file without any dimensional change and the chaotic rules tested give the highest scrambling degree.

1997 ◽  
Vol 07 (07) ◽  
pp. 1451-1496 ◽  
Author(s):  
André Barbé

This paper considers three-dimensional coarse-graining invariant orbits for two-dimensional linear cellular automata over a finite field, as a nontrivial extension of the two-dimensional coarse-graining invariant orbits for one-dimensional CA that were studied in an earlier paper. These orbits can be found by solving a particular kind of recursive equations (renormalizing equations with rescaling term). The solution starts from some seed that has to be determined first. In contrast with the one-dimensional case, the seed has infinite support in most cases. The way for solving these equations is discussed by means of some examples. Three categories of problems (and solutions) can be distinguished (as opposed to only one in the one-dimensional case). Finally, the morphology of a few coarse-graining invariant orbits is discussed: Complex order (of quasiperiodic type) seems to emerge from random seeds as well as from seeds of simple order (for example, constant or periodic seeds).


Author(s):  
Geoffrey Hellman ◽  
Stewart Shapiro

This chapter develops a Euclidean, two-dimensional, regions-based theory. As with the semi-Aristotelian account in Chapter 2, the goal here is to recover the now orthodox Dedekind–Cantor continuum on a point-free basis. The chapter derives the Archimedean property for a class of readily postulated orientations of certain special regions, what are called “generalized quadrilaterals” (intended as parallelograms), by which the entire space is covered. Then the chapter generalizes this to arbitrary orientations, and then establishes an isomorphism between the space and the usual point-based one. As in the one-dimensional case, this is done on the basis of axioms which contain no explicit “extremal clause”, and we have no axiom of induction other than ordinary numerical (mathematical) induction.


2002 ◽  
Vol 12 (03n04) ◽  
pp. 341-358
Author(s):  
KRISHNA M. KAVI ◽  
DINESH P. MEHTA

This paper presents two algorithms for mutual exclusion on optical bus architectures including the folded one-dimensional bus, the one-dimensional array with pipelined buses (1D APPB), and the two-dimensional array with pipelined buses (2D APPB). The first algorithm guarantees mutual exclusion, while the second guarantees both mutual exclusion and fairness. Both algorithms exploit the predictability of propagation delays in optical buses.


2007 ◽  
Vol 21 (02n03) ◽  
pp. 139-154 ◽  
Author(s):  
J. H. ASAD

A first-order differential equation of Green's function, at the origin G(0), for the one-dimensional lattice is derived by simple recurrence relation. Green's function at site (m) is then calculated in terms of G(0). A simple recurrence relation connecting the lattice Green's function at the site (m, n) and the first derivative of the lattice Green's function at the site (m ± 1, n) is presented for the two-dimensional lattice, a differential equation of second order in G(0, 0) is obtained. By making use of the latter recurrence relation, lattice Green's function at an arbitrary site is obtained in closed form. Finally, the phase shift and scattering cross-section are evaluated analytically and numerically for one- and two-impurities.


Author(s):  
Bharti bharti ◽  
Debabrata Deb

We use molecular dynamics simulations to investigate the ordering phenomena in two-dimensional (2D) liquid crystals over the one-dimensional periodic substrate (1DPS). We have used Gay-Berne (GB) potential to model the...


2013 ◽  
Vol 33 (2) ◽  
pp. 249-257 ◽  
Author(s):  
Alberto Colombo ◽  
Lívia A. Alvarenga ◽  
Myriane S. Scalco ◽  
Randal C. Ribeiro ◽  
Giselle F. Abreu

The increasing demand for water resources accentuates the need to reduce water waste through a more appropriate irrigation management. In the particular case of irrigated coffee planting, which in recent years presented growth with the predominance of drip irrigation, the improvement of drip irrigation management techniques is a necessity. The proper management of drip irrigation depends on the knowledge of the spatial pattern of soil moisture distribution inside the wetted strip formed under the irrigation lines. In this study, grids of 24 tensiometers were used to determine the water storage within the wetted strip formed under drippers, with a 3.78 L h-1 discharge, evenly spaced by 0.4 m, subjected to two different management criteria (fixed irrigation interval and 60 kPa tension). Estimates of storage based on a one-dimensional analysis, that only considers depth variations, were compared with two-dimensional estimates. The results indicate that for high-frequency irrigation the one-dimensional analysis is not appropriate. However, under less frequent irrigation, the two-dimensional analysis is dispensable, being the one-dimensional sufficient for calculating the water volume stored in the wetted strip.


Author(s):  
Yuliya Tanasyuk ◽  
Petro Burdeinyi

The given paper is devoted to the software development of block cipher based on reversible one-dimensional cellular automata and the study of its statistical properties. The software implementation of the proposed encryption algorithm is performed in C# programming language in Visual Studio 2017. The paper presents specially designed approach for key generation. To ensure desired cryptographic stability, the shared secret parameters can be adjusted to contain information needed for creating substitution tables, defining reversible rules, and hiding final data. For the first time, it is suggested to create substitution tables based on iterations of a cellular automaton that is initialized by the key data.


1997 ◽  
Vol 490 ◽  
Author(s):  
Misha Temkin ◽  
Ivan Chakarov

ABSTRACTA computationally efficient method for ion implantation simulation is presented. The method allows two-dimensional ion implantation profiles in arbitrary shaped structures to be calculated and is valid for both amorphous and crystalline materials. It uses an extension of the one-dimensional dual Pearson approximation into the second dimension.


Sign in / Sign up

Export Citation Format

Share Document