Chaos machine: Difference between revisions
Corrected a year that was mentioned and expanded with a bit more info |
Added short description |
||
| Line 1: | Line 1: | ||
{{Short description|Type of algorithm}} | |||
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> | ||