Chaos machine: Difference between revisions
Added new reference to the second paragraph. |
m WP:CHECKWIKI error fix for #61. Punctuation goes before References. Do general fixes if a problem exists. - using AWB (12130) |
||
| 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 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. | 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 report |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|language=English |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<ref>{{cite journal |url=http://opac.inria.fr/record=b1101628 |title=Complex systems : chaos and beyond a constructive approach with applications in life sciences |publisher=Springer| isbn=3-540-67202-8 |series = Physics and astronomy online library|language= Japanese|author=Kaneko, Kunihiko and Tsuda, Ichiro |year=2001}}</ref> | Theoretical model was published<ref>{{cite report |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|language=English |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.<ref>{{cite journal |url=http://opac.inria.fr/record=b1101628 |title=Complex systems : chaos and beyond a constructive approach with applications in life sciences |publisher=Springer| isbn=3-540-67202-8 |series = Physics and astronomy online library|language= Japanese|author=Kaneko, Kunihiko and Tsuda, Ichiro |year=2001}}</ref> | ||
== See also == | == See also == | ||
| Line 17: | Line 17: | ||
[[Category:Theory of cryptography]] | [[Category:Theory of cryptography]] | ||
[[Category:Chaos theory]] | [[Category:Chaos theory]] | ||
{{crypto-stub}} | {{crypto-stub}} | ||
Revision as of 08:20, 28 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.[2]
See also
External links
References
- ↑ Template:Cite report
- ↑ 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.