Some applications of IFS based on square symmetries
On 21 October, technical maintenance will be carried out to. During this time, the platforms zurnalai.vu.lt and journals.vu.lt may be temporarily unavailable between 09:00 and 17:00.
Articles
Gintautas Bareikis
Vilnius University, Lithuania
Algirdas Maciulis
Vilnius University, Lithuania
Published 2012-01-25
https://doi.org/10.15388/NA.17.1.14075
PDF

Keywords

key based permutation
iterated function system
square symmetries

How to Cite

Bareikis, G. and Maciulis, A. (2012) “Some applications of IFS based on square symmetries”, Nonlinear Analysis: Modelling and Control, 17(1), pp. 16–26. doi:10.15388/NA.17.1.14075.

Abstract

This paper describes a fractal based method for generating the pseudorandom permutations. We construct an Iterated Function System (IFS) belonging to the class of square symmetries and simulate the pseudorandom walk on a square. In this way some families of key based permutations are generated. The cardinalities of generated families are analysed.

PDF

Downloads

Download data is not yet available.