Chaos machine: Difference between revisions
No edit summary |
Rescuing 1 sources and tagging 0 as dead.) #IABot (v2.0 |
||
| 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.<ref>{{cite speech |title=Cryptography using Chaos|first=J M|last=Blackledge|event=Executive Speeches|location=Warsaw University of Technology|date=March 10, 2010|url=http://konwersatorium.pw.edu.pl/wyklady/2010_VLZ7_02_wyklad.pdf}}</ref> | 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.<ref>{{cite speech |title=Cryptography using Chaos|first=J M|last=Blackledge|event=Executive Speeches|location=Warsaw University of Technology|date=March 10, 2010|url=http://konwersatorium.pw.edu.pl/wyklady/2010_VLZ7_02_wyklad.pdf}}</ref> | ||
Theoretical model was published in early 2015 by Maciej A. Czyzewski.<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> 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 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><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 in early 2015 by Maciej A. Czyzewski.<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> 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 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><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 |journal= |access-date=2016-12-27 |archive-url=https://web.archive.org/web/20161228124156/http://opac.inria.fr/record=b1101628 |archive-date=2016-12-28 |url-status=dead }}</ref> | ||
== See also == | == See also == | ||
Revision as of 01:18, 4 November 2019
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 in early 2015 by Maciej A. Czyzewski.[2] 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.[3][4]
See also
External links
References
- ↑ Template:Cite speech
- ↑ 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. Retrieved on 2016-12-27.