A Novel Image Encryption Scheme Based on Reversible Cellular Automata

In this paper, a new scheme for image encryption is presented by reversible cellular automata. The presented scheme is applied in three individual steps. Firstly, the image is blocked and the pixels are substituted by a reversible cellular automaton. Then, image pixels are scrambled by an elementary cellular automata and finally the blocks are attached and pixels are substituted by an individual reversible cellular automaton. Due to reversibility of used cellular automata, decryption scheme can reversely be applied. The experimental results show that encrypted image is suitable visually and this scheme has satisfied quantitative performance

Integral Imaging Based 3-D Image Encryption Algorithm Combined with Cellular Automata

A novel optical encryption method is proposed in this paper to achieve 3-D image encryption. This proposed encryption algorithm combines the use of computational integral imaging (CII) and linear-complemented maximum- length cellular automata (LC-MLCA) to encrypt a 3D image. In the encryption process, the 2-D elemental image array (EIA) recorded by light rays of the 3-D image are mapped inversely through the lenslet array according the ray tracing theory. Next, the 2-D EIA is encrypted by LC-MLCA algorithm. When decrypting the encrypted image, the 2-D EIA is recovered by the LC-MLCA. Using the computational integral imaging reconstruction (CIIR) technique and a 3-D object is subsequently reconstructed on the output plane from the 2-D recovered EIA. Because the 2-D EIA is composed of a number of elemental images having their own perspectives of a 3-D image, even if the encrypted image is seriously harmed, the 3-D image can be successfully reconstructed only with partial data. To verify the usefulness of the proposed algorithm, we perform computational experiments and present the experimental results for various attacks. The experiments demonstrate that the proposed encryption method is valid and exhibits strong robustness and security

Digital image scrambling using 2D cellular automata

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. A. L. A. Dalhoum et al., "Digital Image Scrambling Using 2D Cellular Automata", IEEE MultiMedia, vol. 19, no. 4 pp. 28 – 36, oct-dec. 2012A digital image scrambling method based on a 2D cellular automaton, specifically the well-known Game of Life, produces an effective image encryption technique.This work has been partially sponsored by the Spanish MICINN project TIN2011-28260-C03-0

A Novel Latin Square Image Cipher

In this paper, we introduce a symmetric-key Latin square image cipher (LSIC) for grayscale and color images. Our contributions to the image encryption community include 1) we develop new Latin square image encryption primitives including Latin Square Whitening, Latin Square S-box and Latin Square P-box ; 2) we provide a new way of integrating probabilistic encryption in image encryption by embedding random noise in the least significant image bit-plane; and 3) we construct LSIC with these Latin square image encryption primitives all on one keyed Latin square in a new loom-like substitution-permutation network. Consequently, the proposed LSIC achieve many desired properties of a secure cipher including a large key space, high key sensitivities, uniformly distributed ciphertext, excellent confusion and diffusion properties, semantically secure, and robustness against channel noise. Theoretical analysis show that the LSIC has good resistance to many attack models including brute-force attacks, ciphertext-only attacks, known-plaintext attacks and chosen-plaintext attacks. Experimental analysis under extensive simulation results using the complete USC-SIPI Miscellaneous image dataset demonstrate that LSIC outperforms or reach state of the art suggested by many peer algorithms. All these analysis and results demonstrate that the LSIC is very suitable for digital image encryption. Finally, we open source the LSIC MATLAB code under webpage https://sites.google.com/site/tuftsyuewu/source-code.Comment: 26 pages, 17 figures, and 7 table

Subshifts with Simple Cellular Automata

A subshift is a set of infinite one- or two-way sequences over a fixed finite set, defined by a set of forbidden patterns. In this thesis, we study subshifts in the topological setting, where the natural morphisms between them are ones defined by a (spatially uniform) local rule. Endomorphisms of subshifts are called cellular automata, and we call the set of cellular automata on a subshift its endomorphism monoid. It is known that the set of all sequences (the full shift) allows cellular automata with complex dynamical and computational properties. We are interested in subshifts that do not support such cellular automata. In particular, we study countable subshifts, minimal subshifts and subshifts with additional universal algebraic structure that cellular automata need to respect, and investigate certain criteria of ‘simplicity’ of the endomorphism monoid, for each of them. In the case of countable subshifts, we concentrate on countable sofic shifts, that is, countable subshifts defined by a finite state automaton. We develop some general tools for studying cellular automata on such subshifts, and show that nilpotency and periodicity of cellular automata are decidable properties, and positive expansivity is impossible. Nevertheless, we also prove various undecidability results, by simulating counter machines with cellular automata. We prove that minimal subshifts generated by primitive Pisot substitutions only support virtually cyclic automorphism groups, and give an example of a Toeplitz subshift whose automorphism group is not finitely generated. In the algebraic setting, we study the centralizers of CA, and group and lattice homomorphic CA. In particular, we obtain results about centralizers of symbol permutations and bipermutive CA, and their connections with group structures.Siirretty Doriast

Аналіз кількісних характеристик мікроструктур, синтезованих методом імовірнісних кліткових автоматів

Водка, О. О. Аналіз кількісних характеристик мікроструктур, синтезованих методом імовірнісних кліткових автоматів = Analysis of quantitative characteristics of microstructures synthesized by method of probabilistic cellular automata / О. О. Водка // Зб. наук. пр. НУК. – Миколаїв : НУК, 2019. – № 3 (477). – С. 44–50.Анотація. На мікрорівні металеві матеріали являють собою полікристалічну структуру. Кожен кристал цієї структури має свою форму й орієнтацію у просторі. Це приводить до того, що сукупність форм і орієнтацій кристала визначає механічні характеристики матеріалу. Отже, важливо моделювати мікроструктури матеріалів. Це дасть змогу визначати механічні параметри матеріалів на основі їхньої мікроструктури. Метод кліткових автоматів широко використовується в моделюванні мікроструктури різних матеріалів. Моделі на основі кліткових автоматів широко використовуються для прогнозування поведінки в різних галузях. У роботі розроблено програмне забезпечення для синтетичної генерації мікроструктури полікристалічних матеріалів. Програмне забезпечення дозволяє синтетично згенерувати мікроструктуру матеріалу, використовуючи різні правила сусідства клітинок. Процес кристалізації з фізичного погляду повинен відбуватись рівномірно в усіх напрямках. Через локальні флуктуації та градієнти температури, нерівномірність за об’ємом хімічного складу розплаву кристалізація відбувається нерівномірно в різних напрямках. Для моделювання цього ефекту в роботі пропонується задавати швидкість кристалізації у вигляді еліпса. Радіуси еліпса відповідають швидкості кристалізації у відповідних напрямках. Для визначення ймовірностей переходу еліпс проєктується на клітинки поля. Після чого визначається площа еліпса, що потрапила в кожну клітинку. Отримані площі клітинок – імовірності кристалізації в різних напрямках. На основі згенерованої мікроструктури проводиться дослідження кількісних характеристик мікроструктур. За допомогою програмного забезпечення визначено коефіцієнт форми, нормовану площу зерна, масштабний коефіцієнт і кут орієнтації зерен. Для отриманих даних проведена статистична обробка й отримані функції щільності ймовірності. За статистичними параметрами виконано порівняння отриманих результатів із параметрами мікроструктури чистого заліза.Abstract. The micro-level metallic materials are a polycrystalline structure. Each crystal of this structure has its own shape and orientation in space. This leads to the fact that the set of shapes and orientations of the crystal determines the mechanical characteristics of the material. Thus, it is important to model the microstructures of materials. It allows to determine the mechanical parameters of the materials based on their microstructure. The cellular automaton method is widely used in modeling the microstructure of various materials. Cellular automata are widely used to predict behavior in different industries. In this paper software for synthetic generation of microstructure of polycrystalline materials is developed. The software allows to synthetically generate the microstructure of a material using different cell neighborhood rules. The process of crystallization from a physical point of view must occur uniformly in all directions. Due to local fluctuations and temperature gradients, the uneven volume of the chemical composition of the melt crystallizes unevenly in different directions. In order to model this effect, it is proposed to set the crystallization rate in the form of an ellipse. The ellipse radii correspond to the crystallization rate in the respective directions. To determine the transition probabilities, an ellipse is projected onto field cells. Then determine the area of the ellipse that hit each cell. The cell areas obtained represent crystallization probabilities in different directions. The quantitative characteristics of microstructures are investigated on the basis of microstructures generated. The software determines the shape factor, the normalized grain area, the scale factor and the grain orientation angle. The data obtained are statistically processed and the probability density functions obtained. According to statistical parameters, the obtained results are compared with the parameters of the microstructure of pure iron