Jump to content

Chaos machine

From IdeaWazaWiki
Revision as of 18:07, 27 December 2016 by wikipedia>Hennerhubel (Added new reference to the second paragraph.)

In mathematics, a chaos machine is a class of algorithms constructed on the base of chaos theory (mainly deterministic chaos) to produce pseudo-random oracle. 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.

Theoretical model was published[1] in early 2015 by Maciej A. Czyzewski. 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[2] .

See also

References

  1. ↑ Template:Cite report
  2. ↑ Kaneko, Kunihiko and Tsuda, Ichiro (2001) (in Japanese). Complex systems : chaos and beyond a constructive approach with applications in life sciences. Physics and astronomy online library. Springer. ISBN 3-540-67202-8. http://opac.inria.fr/record=b1101628. 

Template:Crypto-stub