First of all excuse me for my inexperience on the topic (I am new to cryptography). I am currently studying for my Master thesis and am am looking for hash function on which I can modify them so thy can be dynamical (meaning the method on which the algorithm is processed is changing on different conditions) by using chaos theory.
I then looked into simple (not real life usable) hash algorithms on which I can do my prof-of-concept. I found the CHA-1 which in my previous post: Is there any code available online for CHA-1? users kindly explained that is a method that shall not be used.
Now I would like to be more descriptive on the topic so you can further understand. I am applying this method on the blockchain and I would like to create a proof-of-concept on which every time a new block is created then the hash algorithm changes as well.
My first thought is to modify the CHA-1 algorithm by making a new tree on which it will produce new values for logistic map's initial conditions from the previous block hash. As a result in order to calculate a new hash you will need the previous block hash, as a key, to calculate the new one, which changes every time a new block is created. I am confident that this method can be applied in mining.
I would like to ask your opinion on which hashing algorithm i can use for this method (that can support my study)?