Chaos machine: Difference between revisions
Added "chaos machine", because its confused with "chaos machine (toy)" |
Remove {{math-stub}} |
||
| Line 4: | Line 4: | ||
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 presents the idea to create a universal scheme with modular design and customizable parameters, that can be applied where [[randomness]] and [[butterfly effect|sensitiveness]] is needed. | 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 presents the idea to create a universal scheme with modular design and customizable parameters, that can be applied where [[randomness]] and [[butterfly effect|sensitiveness]] is needed. | ||
Theoretical model was published | 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 16-year-old [[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. | ||
== Theory == | == Theory == | ||
| Line 25: | Line 25: | ||
{{crypto-stub}} | {{crypto-stub}} | ||
Revision as of 17:01, 2 October 2016
Template:New unreviewed article
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 presents the idea to create a universal scheme with modular design and customizable parameters, that can be applied where randomness and sensitiveness is needed.
Theoretical model was published[1] in early 2015 by 16-year-old 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.
Theory
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.