DCDS-B
Hash function construction based on time average moiré
Minvydas Ragulskis Zenonas Navickas
An algorithm for the construction of hash function based on optical time average moirè experimental technique is proposed in this paper. Algebraic structures of grayscale color functions and time average operators are constructed. Properties of time average operators and effects of digital image representation are explored. The fact that the inverse problem of identification of the original grayscale color function from its time averaged image is an ill-posed problem helps to construct an efficient algorithm for the construction of a new class of one-way collision free hash functions.
keywords: algebraic structure. Time average moire hash function
DCDS-B
The logistic map of matrices
Zenonas Navickas Rasa Smidtaite Alfonsas Vainoras Minvydas Ragulskis
The standard iterative logistic map is extended by replacing the scalar variable by a square matrix of variables. Dynamical properties of such an iterative map are explored in detail when the order of matrices is 2. It is shown that the evolution of the logistic map depends not only on the control parameter but also on the eigenvalues of the matrix of initial conditions. Several computational examples are used to demonstrate the convergence to periodic attractors and the sensitivity of chaotic processes to initials conditions.
keywords: idempotent The logistic map attractor nilpotent.

Year of publication

Related Authors

Related Keywords

[Back to Top]