A study of an automorphism on the logistic maps over prime fields

In this paper, we propose a logistic map over prime fields, which is one way to implement the logistic map over real domain into a computer. We describe a definition and some properties for the logistic map over prime fields, and prove an automorphism between two maps with different control values. We also discuss both advantages and disadvantages of the existence for the automorphism, and an aptitude for the map used by the pseudorandom number generators.