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 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.[1]

Theoretical model was published[2] 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,[3] including cryptographic hashes, message authentication codes and randomness extractors.[4]

See also

References

  1. ↑ Blackledge, J M (March 10, 2010). Cryptography using Chaos (PDF) (Speech). Executive Speeches. Warsaw University of Technology.
  2. ↑ Maciej A. Czyzewski (2016). Chaos Machine: Different Approach to the Application and Significance of Numbers (Report). Cryptology ePrint Archive, Report 2016/468.
  3. ↑ Barker, Elaine; Barker, William; Burr, William; Polk, William; Smid, Miles (July 2012). "Recommendation for Key Management" (PDF). NIST Special Publication 800-57. NIST. Retrieved 19 August 2013.
  4. ↑ Kaneko, Kunihiko and Tsuda, Ichiro (2001). "Complex systems : chaos and beyond a constructive approach with applications in life sciences". Physics and astronomy online library (in Japanese). Springer. ISBN 3-540-67202-8.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.