4 research outputs found
Cellular Automata with Synthetic Image A Secure Image Communication with Transform Domain
Image encryption has attained a great attention due to the necessity to safeguard confidential images. Digital documents, site images, battlefield photographs, etc. need a secure approach for sharing in an open channel. Hardware – software co-design is a better option for exploiting unique features to cipher the confidential images. Cellular automata (CA) and synthetic image influenced transform domain approach for image encryption is proposed in this paper. The digital image is initially divided into four subsections by applying integer wavelet transform. Confusion is accomplished on low – low section of the transformed image using CA rules 90 and 150. The first level of diffusion with consecutive XORing operation of image pixels is initiated by CA rule 42. A synthetic random key image is developed by extracting true random bits generated by Cyclone V field programmable gate array 5CSEMA5F31C6. This random image plays an important role in second level of diffusion. The proposed confusion and two level diffusion assisted image encryption approach has been validated through the entropy, correlation, histogram, number of pixels change rate, unified average change intensity, contrast and encryption quality analyses
Pattern Recognition In Non-Kolmogorovian Structures
We present a generalization of the problem of pattern recognition to
arbitrary probabilistic models. This version deals with the problem of
recognizing an individual pattern among a family of different species or
classes of objects which obey probabilistic laws which do not comply with
Kolmogorov's axioms. We show that such a scenario accommodates many important
examples, and in particular, we provide a rigorous definition of the classical
and the quantum pattern recognition problems, respectively. Our framework
allows for the introduction of non-trivial correlations (as entanglement or
discord) between the different species involved, opening the door to a new way
of harnessing these physical resources for solving pattern recognition
problems. Finally, we present some examples and discuss the computational
complexity of the quantum pattern recognition problem, showing that the most
important quantum computation algorithms can be described as non-Kolmogorovian
pattern recognition problems
A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher
The dynamical system described herein uses a hybrid cellular automata (CA)
mechanism to attain reversibility, and this approach is adapted to create a
novel block cipher algorithm called HCA. CA are widely used for modeling
complex systems and employ an inherently parallel model. Therefore,
applications derived from CA have a tendency to fit very well in the current
computational paradigm where scalability and multi-threading potential are
quite desirable characteristics. HCA model has recently received a patent by
the Brazilian agency INPI. Several evaluations and analyses performed on the
model are presented here, such as theoretical discussions related to its
reversibility and an analysis based on graph theory, which reduces HCA security
to the well-known Hamiltonian cycle problem that belongs to the NP-complete
class. Finally, the cryptographic robustness of HCA is empirically evaluated
through several tests, including avalanche property compliance and the NIST
randomness suite.Comment: 34 pages, 12 figure