Chaos machine: Difference between revisions
Added tags to the page using Page Curation (notability) |
Citation about crypto modules from NIST. |
||
| Line 3: | Line 3: | ||
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 | 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<ref>{{cite web|last=Barker|first=Elaine|title=Recommendation for Key Management|url=http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf|work=[[NIST]] Special Publication 800-57|publisher=[[NIST]]|accessdate=19 August 2013|author2=Barker, William |author3=Burr, William |author4=Polk, William |author5= Smid, Miles |date=July 2012}}</ref>, 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 == | ||
Revision as of 12:36, 8 February 2017
| This article may not meet the general notability guideline. Please help to establish notability by adding reliable, secondary sources about the topic. If notability cannot be established, the article is likely to be merged or deleted. (February 2017) |
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[2], including cryptographic hashes, message authentication codes and randomness extractors.[3]
See also
External links
References
- ↑ Template:Cite report
- ↑ Barker, Elaine (July 2012). "Recommendation for Key Management". NIST Special Publication 800-57. NIST. http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf. Retrieved on 19 August 2013.
- ↑ 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.