A hash function based on iterating the logistic map with scalable positions

Our scheme can deal with input messages of any length. Every value of iterating the logistic map is obtained enough digital positions.

The original message can be divided into equalsized sub-blocks, except for the last part. Usually, it is necessary to append some message bits at the end of the original message, in order to fill the final subblock.