Chaos machine

In mathematics, a chaos machine is a class of algorithms constructed on the base of chaos theory (mainly deterministic chaos) to produce pseudo-random oracles. It represents the idea of creating a universal scheme with modular design and customizable parameters, which can be applied wherever randomness and sensitiveness is needed.^[1]

Theoretical model was published in early 2016 by Maciej A. Czyzewski.^[2] It was designed specifically to combine the benefits of hash function and pseudo-random function. However, it can be used to implement many cryptographic primitives, including cryptographic hashes, message authentication codes and randomness extractors.^[3][4]

The flexibility of the chaos machine design allows it to be tailored for different applications by adjusting the choice of parameters. For example, the period length of the pseudo-random output can be targeted by selecting the appropriate space parameter. ^[2]

See also

• Merkle–Damgård construction
• Sponge function