Chaos machine: Difference between revisions
libchaos implements known machines, should be in external links |
Prepared for moving to correct path. |
||
| Line 1: | Line 1: | ||
In [[mathematics]], a '''chaos machine''' is a class of algorithms constructed on the base of [[chaos theory]] (mainly deterministic chaos) to produce [[random oracle|pseudo-random oracle]]. It | In [[mathematics]], a '''chaos machine''' is a class of algorithms constructed on the base of [[chaos theory]] (mainly deterministic chaos) to produce [[random oracle|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 [[butterfly effect|sensitiveness]] is needed. | ||
Theoretical model was published<ref>{{cite web |url=https://eprint.iacr.org/2016/468 |title=Chaos Machine: Different Approach to the Application and Significance of Numbers |publisher=Cryptology ePrint Archive, Report 2016/468 |author=Maciej A. Czyzewski |year=2016}}</ref> in early 2015 by | Theoretical model was published<ref>{{cite web |url=https://eprint.iacr.org/2016/468 |title=Chaos Machine: Different Approach to the Application and Significance of Numbers |publisher=Cryptology ePrint Archive, Report 2016/468 |author=Maciej A. Czyzewski |year=2016}}</ref> 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 hash]]es, [[message authentication codes]] and [[randomness extractor]]s. | ||
== See also == | == See also == | ||
Revision as of 17:43, 27 December 2016
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.
See also
External links
References
- ↑ Maciej A. Czyzewski (2016). "Chaos Machine: Different Approach to the Application and Significance of Numbers". Cryptology ePrint Archive, Report 2016/468. https://eprint.iacr.org/2016/468.